Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r159-smll-167819445200061.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is DoubleExponent-PT-020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-smll-167819445200061
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 7.9K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 340K Mar 5 18:22 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 DoubleExponent-PT-020-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678469531080

Running Version 202205111006
[2023-03-10 17:32:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 17:32:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 17:32:14] [INFO ] Load time of PNML (sax parser for PT used): 346 ms
[2023-03-10 17:32:14] [INFO ] Transformed 1064 places.
[2023-03-10 17:32:14] [INFO ] Transformed 998 transitions.
[2023-03-10 17:32:14] [INFO ] Parsed PT model containing 1064 places and 998 transitions in 610 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 998 rows 1064 cols
[2023-03-10 17:32:14] [INFO ] Invariants computation overflowed in 260 ms
Incomplete random walk after 10000 steps, including 335 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 277 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 287 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 275 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 285 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 272 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 280 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
// Phase 1: matrix 998 rows 1064 cols
[2023-03-10 17:32:15] [INFO ] Invariants computation overflowed in 150 ms
[2023-03-10 17:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:20] [INFO ] [Real]Absence check using state equation in 4396 ms returned unknown
[2023-03-10 17:32:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:24] [INFO ] [Real]Absence check using state equation in 3042 ms returned sat
[2023-03-10 17:32:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:27] [INFO ] [Nat]Absence check using state equation in 2903 ms returned sat
[2023-03-10 17:32:28] [INFO ] Deduced a trap composed of 72 places in 1016 ms of which 20 ms to minimize.
[2023-03-10 17:32:29] [INFO ] Deduced a trap composed of 61 places in 983 ms of which 4 ms to minimize.
[2023-03-10 17:32: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 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:32:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:33] [INFO ] [Real]Absence check using state equation in 3700 ms returned sat
[2023-03-10 17:32:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:36] [INFO ] [Nat]Absence check using state equation in 2842 ms returned sat
[2023-03-10 17:32:37] [INFO ] Deduced a trap composed of 77 places in 511 ms of which 2 ms to minimize.
[2023-03-10 17:32:37] [INFO ] Deduced a trap composed of 90 places in 591 ms of which 1 ms to minimize.
[2023-03-10 17:32:38] [INFO ] Deduced a trap composed of 305 places in 425 ms of which 1 ms to minimize.
[2023-03-10 17:32:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1854 ms
[2023-03-10 17:32:38] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 79 ms.
[2023-03-10 17:32:38] [INFO ] Added : 5 causal constraints over 1 iterations in 164 ms. Result :unknown
[2023-03-10 17:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:39] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2023-03-10 17:32:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:40] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2023-03-10 17:32:41] [INFO ] Deduced a trap composed of 368 places in 850 ms of which 2 ms to minimize.
[2023-03-10 17:32:43] [INFO ] Deduced a trap composed of 59 places in 831 ms of which 2 ms to minimize.
[2023-03-10 17:32:43] [INFO ] Deduced a trap composed of 400 places in 682 ms of which 2 ms to minimize.
[2023-03-10 17:32:44] [INFO ] Deduced a trap composed of 55 places in 892 ms of which 1 ms to minimize.
[2023-03-10 17:32:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:46] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2023-03-10 17:32:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:48] [INFO ] [Nat]Absence check using state equation in 1462 ms returned sat
[2023-03-10 17:32:49] [INFO ] Deduced a trap composed of 445 places in 792 ms of which 1 ms to minimize.
[2023-03-10 17:32:49] [INFO ] Deduced a trap composed of 31 places in 554 ms of which 1 ms to minimize.
[2023-03-10 17:32:50] [INFO ] Deduced a trap composed of 113 places in 430 ms of which 2 ms to minimize.
[2023-03-10 17:32:51] [INFO ] Deduced a trap composed of 89 places in 791 ms of which 1 ms to minimize.
[2023-03-10 17:32:51] [INFO ] Deduced a trap composed of 108 places in 739 ms of which 1 ms to minimize.
[2023-03-10 17:32:51] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:32:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:55] [INFO ] [Real]Absence check using state equation in 3375 ms returned sat
[2023-03-10 17:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:32:57] [INFO ] [Nat]Absence check using state equation in 1959 ms returned sat
[2023-03-10 17:32:58] [INFO ] Deduced a trap composed of 408 places in 748 ms of which 2 ms to minimize.
[2023-03-10 17:32:59] [INFO ] Deduced a trap composed of 58 places in 813 ms of which 3 ms to minimize.
[2023-03-10 17:33:00] [INFO ] Deduced a trap composed of 418 places in 828 ms of which 2 ms to minimize.
[2023-03-10 17:33:01] [INFO ] Deduced a trap composed of 41 places in 724 ms of which 1 ms to minimize.
[2023-03-10 17:33:01] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:02] [INFO ] [Real]Absence check using state equation in 1357 ms returned sat
[2023-03-10 17:33:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:04] [INFO ] [Nat]Absence check using state equation in 1608 ms returned sat
[2023-03-10 17:33:05] [INFO ] Deduced a trap composed of 61 places in 596 ms of which 1 ms to minimize.
[2023-03-10 17:33:06] [INFO ] Deduced a trap composed of 397 places in 820 ms of which 2 ms to minimize.
[2023-03-10 17:33:07] [INFO ] Deduced a trap composed of 415 places in 866 ms of which 1 ms to minimize.
[2023-03-10 17:33:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2675 ms
[2023-03-10 17:33:07] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 96 ms.
[2023-03-10 17:33:07] [INFO ] Added : 5 causal constraints over 1 iterations in 526 ms. Result :unknown
[2023-03-10 17:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:08] [INFO ] [Real]Absence check using state equation in 754 ms returned sat
[2023-03-10 17:33:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:09] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2023-03-10 17:33:10] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 107 ms.
[2023-03-10 17:33:13] [INFO ] Added : 50 causal constraints over 10 iterations in 3739 ms. Result :unknown
[2023-03-10 17:33:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:15] [INFO ] [Real]Absence check using state equation in 1887 ms returned sat
[2023-03-10 17:33:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:18] [INFO ] [Nat]Absence check using state equation in 2297 ms returned sat
[2023-03-10 17:33:19] [INFO ] Deduced a trap composed of 67 places in 649 ms of which 1 ms to minimize.
[2023-03-10 17:33:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 882 ms
[2023-03-10 17:33:19] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 124 ms.
[2023-03-10 17:33:20] [INFO ] Added : 20 causal constraints over 4 iterations in 1635 ms. Result :unknown
[2023-03-10 17:33:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:22] [INFO ] [Real]Absence check using state equation in 1071 ms returned sat
[2023-03-10 17:33:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:23] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2023-03-10 17:33:24] [INFO ] Deduced a trap composed of 65 places in 570 ms of which 2 ms to minimize.
[2023-03-10 17:33:25] [INFO ] Deduced a trap composed of 73 places in 807 ms of which 1 ms to minimize.
[2023-03-10 17:33:25] [INFO ] Deduced a trap composed of 84 places in 856 ms of which 1 ms to minimize.
[2023-03-10 17:33:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2545 ms
[2023-03-10 17:33:26] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 118 ms.
[2023-03-10 17:33:27] [INFO ] Added : 20 causal constraints over 4 iterations in 1224 ms. Result :unknown
[2023-03-10 17:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:28] [INFO ] [Real]Absence check using state equation in 1199 ms returned sat
[2023-03-10 17:33:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:30] [INFO ] [Nat]Absence check using state equation in 1051 ms returned sat
[2023-03-10 17:33:30] [INFO ] Deduced a trap composed of 149 places in 556 ms of which 1 ms to minimize.
[2023-03-10 17:33:31] [INFO ] Deduced a trap composed of 137 places in 594 ms of which 1 ms to minimize.
[2023-03-10 17:33:31] [INFO ] Deduced a trap composed of 163 places in 561 ms of which 1 ms to minimize.
[2023-03-10 17:33:32] [INFO ] Deduced a trap composed of 151 places in 564 ms of which 2 ms to minimize.
[2023-03-10 17:33:33] [INFO ] Deduced a trap composed of 175 places in 582 ms of which 1 ms to minimize.
[2023-03-10 17:33:33] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 3799 ms
[2023-03-10 17:33:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:35] [INFO ] [Real]Absence check using state equation in 945 ms returned sat
[2023-03-10 17:33:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:36] [INFO ] [Nat]Absence check using state equation in 1031 ms returned sat
[2023-03-10 17:33:36] [INFO ] Deduced a trap composed of 113 places in 443 ms of which 1 ms to minimize.
[2023-03-10 17:33:37] [INFO ] Deduced a trap composed of 125 places in 467 ms of which 5 ms to minimize.
[2023-03-10 17:33:38] [INFO ] Deduced a trap composed of 501 places in 915 ms of which 2 ms to minimize.
[2023-03-10 17:33:39] [INFO ] Deduced a trap composed of 477 places in 800 ms of which 1 ms to minimize.
[2023-03-10 17:33:40] [INFO ] Deduced a trap composed of 470 places in 924 ms of which 2 ms to minimize.
[2023-03-10 17:33:40] [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 11
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:43] [INFO ] [Real]Absence check using state equation in 3307 ms returned sat
[2023-03-10 17:33:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:47] [INFO ] [Nat]Absence check using state equation in 3132 ms returned sat
[2023-03-10 17:33:47] [INFO ] Deduced a trap composed of 349 places in 785 ms of which 2 ms to minimize.
[2023-03-10 17:33:48] [INFO ] Deduced a trap composed of 163 places in 356 ms of which 1 ms to minimize.
[2023-03-10 17:33:49] [INFO ] Deduced a trap composed of 277 places in 569 ms of which 1 ms to minimize.
[2023-03-10 17:33:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:52] [INFO ] [Real]Absence check using state equation in 3566 ms returned sat
[2023-03-10 17:33:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:54] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2023-03-10 17:33:55] [INFO ] Deduced a trap composed of 381 places in 1045 ms of which 2 ms to minimize.
[2023-03-10 17:33:56] [INFO ] Deduced a trap composed of 394 places in 684 ms of which 2 ms to minimize.
[2023-03-10 17:33:57] [INFO ] Deduced a trap composed of 395 places in 884 ms of which 1 ms to minimize.
[2023-03-10 17:33:58] [INFO ] Deduced a trap composed of 55 places in 861 ms of which 4 ms to minimize.
[2023-03-10 17:33:58] [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 13
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 17:33:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:33:59] [INFO ] [Real]Absence check using state equation in 749 ms returned sat
[2023-03-10 17:33:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:33:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:34:00] [INFO ] [Nat]Absence check using state equation in 899 ms returned sat
[2023-03-10 17:34:01] [INFO ] Deduced a trap composed of 396 places in 1110 ms of which 2 ms to minimize.
[2023-03-10 17:34:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1773 ms
[2023-03-10 17:34:02] [INFO ] Computed and/alt/rep : 997/1933/997 causal constraints (skipped 0 transitions) in 112 ms.
[2023-03-10 17:34:04] [INFO ] Added : 20 causal constraints over 4 iterations in 2095 ms. Result :unknown
[2023-03-10 17:34:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:34:06] [INFO ] [Real]Absence check using state equation in 1618 ms returned sat
[2023-03-10 17:34:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:34:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:34:07] [INFO ] [Nat]Absence check using state equation in 1398 ms returned sat
[2023-03-10 17:34:08] [INFO ] Deduced a trap composed of 65 places in 650 ms of which 1 ms to minimize.
[2023-03-10 17:34:09] [INFO ] Deduced a trap composed of 107 places in 652 ms of which 1 ms to minimize.
[2023-03-10 17:34:10] [INFO ] Deduced a trap composed of 105 places in 718 ms of which 2 ms to minimize.
[2023-03-10 17:34:10] [INFO ] Deduced a trap composed of 84 places in 735 ms of which 1 ms to minimize.
[2023-03-10 17:34:11] [INFO ] Deduced a trap composed of 84 places in 758 ms of which 2 ms to minimize.
[2023-03-10 17:34:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 1064 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Graph (complete) has 1816 edges and 1064 vertex of which 1060 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 228 transitions
Trivial Post-agglo rules discarded 228 transitions
Performed 228 trivial Post agglomeration. Transition count delta: 228
Iterating post reduction 0 with 228 rules applied. Total rules applied 229 place count 1060 transition count 770
Reduce places removed 228 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 231 rules applied. Total rules applied 460 place count 832 transition count 767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 463 place count 829 transition count 767
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 463 place count 829 transition count 724
Deduced a syphon composed of 43 places in 11 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 549 place count 786 transition count 724
Performed 173 Post agglomeration using F-continuation condition.Transition count delta: 173
Deduced a syphon composed of 173 places in 4 ms
Reduce places removed 173 places and 0 transitions.
Iterating global reduction 3 with 346 rules applied. Total rules applied 895 place count 613 transition count 551
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 12 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 969 place count 576 transition count 551
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1049 place count 576 transition count 471
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 3 with 80 rules applied. Total rules applied 1129 place count 496 transition count 471
Partial Free-agglomeration rule applied 79 times.
Drop transitions removed 79 transitions
Iterating global reduction 4 with 79 rules applied. Total rules applied 1208 place count 496 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1209 place count 495 transition count 470
Applied a total of 1209 rules in 512 ms. Remains 495 /1064 variables (removed 569) and now considering 470/998 (removed 528) transitions.
Finished structural reductions, in 1 iterations. Remains : 495/1064 places, 470/998 transitions.
// Phase 1: matrix 470 rows 495 cols
[2023-03-10 17:35:31] [INFO ] Computed 101 place invariants in 122 ms
Incomplete random walk after 1000000 steps, including 128413 resets, run finished after 1809 ms. (steps per millisecond=552 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84578 resets, run finished after 998 ms. (steps per millisecond=1002 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84960 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84459 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85011 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84426 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84727 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84642 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84658 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85037 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84727 resets, run finished after 1002 ms. (steps per millisecond=998 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84607 resets, run finished after 1214 ms. (steps per millisecond=823 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84780 resets, run finished after 1025 ms. (steps per millisecond=975 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84481 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84578 resets, run finished after 994 ms. (steps per millisecond=1006 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84961 resets, run finished after 990 ms. (steps per millisecond=1010 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84639 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 16) seen :0
// Phase 1: matrix 470 rows 495 cols
[2023-03-10 17:35:49] [INFO ] Computed 101 place invariants in 124 ms
[2023-03-10 17:35:49] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:35:49] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 35 ms returned sat
[2023-03-10 17:35:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:35:49] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2023-03-10 17:35:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:35:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:35:50] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-10 17:35:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:35:50] [INFO ] [Nat]Absence check using state equation in 531 ms returned sat
[2023-03-10 17:35:50] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:35:53] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:35:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 6085 ms returned unknown
[2023-03-10 17:35:56] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-10 17:35:56] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 61 ms returned sat
[2023-03-10 17:35:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:35:57] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-10 17:35:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:35:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-10 17:35:57] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 55 ms returned sat
[2023-03-10 17:35:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:35:57] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-10 17:35:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 102 ms returned sat
[2023-03-10 17:35:58] [INFO ] Deduced a trap composed of 15 places in 250 ms of which 2 ms to minimize.
[2023-03-10 17:35:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-10 17:35:58] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 86 ms.
[2023-03-10 17:35:59] [INFO ] Deduced a trap composed of 8 places in 421 ms of which 2 ms to minimize.
[2023-03-10 17:35:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 510 ms
[2023-03-10 17:35:59] [INFO ] Added : 68 causal constraints over 14 iterations in 1593 ms. Result :sat
Minimization took 1998 ms.
[2023-03-10 17:36:01] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:36:01] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 37 ms returned sat
[2023-03-10 17:36:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:02] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-10 17:36:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:36:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:36:02] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 50 ms returned sat
[2023-03-10 17:36:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:03] [INFO ] [Nat]Absence check using state equation in 579 ms returned sat
[2023-03-10 17:36:03] [INFO ] [Nat]Added 73 Read/Feed constraints in 615 ms returned sat
[2023-03-10 17:36:03] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 104 ms.
[2023-03-10 17:36:07] [INFO ] Deduced a trap composed of 19 places in 317 ms of which 2 ms to minimize.
[2023-03-10 17:36:07] [INFO ] Deduced a trap composed of 19 places in 321 ms of which 1 ms to minimize.
[2023-03-10 17:36:08] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 2 ms to minimize.
[2023-03-10 17:36:09] [INFO ] Deduced a trap composed of 22 places in 627 ms of which 1 ms to minimize.
[2023-03-10 17:36:09] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 2 ms to minimize.
[2023-03-10 17:36:09] [INFO ] Deduced a trap composed of 20 places in 301 ms of which 1 ms to minimize.
[2023-03-10 17:36:09] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 17 ms to minimize.
[2023-03-10 17:36:10] [INFO ] Deduced a trap composed of 15 places in 204 ms of which 1 ms to minimize.
[2023-03-10 17:36:10] [INFO ] Deduced a trap composed of 19 places in 340 ms of which 1 ms to minimize.
[2023-03-10 17:36:11] [INFO ] Deduced a trap composed of 24 places in 340 ms of which 1 ms to minimize.
[2023-03-10 17:36:11] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 1 ms to minimize.
[2023-03-10 17:36:11] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4428 ms
[2023-03-10 17:36:11] [INFO ] Added : 145 causal constraints over 29 iterations in 7905 ms. Result :sat
Minimization took 1738 ms.
[2023-03-10 17:36:13] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:36:13] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-10 17:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:13] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-10 17:36:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:36:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:36:13] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 39 ms returned sat
[2023-03-10 17:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:14] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2023-03-10 17:36:14] [INFO ] [Nat]Added 73 Read/Feed constraints in 69 ms returned sat
[2023-03-10 17:36:14] [INFO ] Deduced a trap composed of 14 places in 221 ms of which 1 ms to minimize.
[2023-03-10 17:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2023-03-10 17:36:14] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 41 ms.
[2023-03-10 17:36:15] [INFO ] Added : 69 causal constraints over 14 iterations in 1200 ms. Result :sat
Minimization took 922 ms.
[2023-03-10 17:36:16] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:36:16] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 47 ms returned sat
[2023-03-10 17:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:17] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2023-03-10 17:36:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:36:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:36:17] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 39 ms returned sat
[2023-03-10 17:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:18] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2023-03-10 17:36:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 1862 ms returned sat
[2023-03-10 17:36:20] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 62 ms.
[2023-03-10 17:36:33] [INFO ] Added : 285 causal constraints over 57 iterations in 13847 ms. Result :sat
Minimization took 3004 ms.
[2023-03-10 17:36:37] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:36:37] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 40 ms returned sat
[2023-03-10 17:36:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:37] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-10 17:36:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:36:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-10 17:36:37] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 50 ms returned sat
[2023-03-10 17:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:38] [INFO ] [Nat]Absence check using state equation in 470 ms returned sat
[2023-03-10 17:36:38] [INFO ] [Nat]Added 73 Read/Feed constraints in 141 ms returned sat
[2023-03-10 17:36:38] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 60 ms.
[2023-03-10 17:36:41] [INFO ] Deduced a trap composed of 15 places in 380 ms of which 1 ms to minimize.
[2023-03-10 17:36:41] [INFO ] Deduced a trap composed of 14 places in 367 ms of which 1 ms to minimize.
[2023-03-10 17:36:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 927 ms
[2023-03-10 17:36:41] [INFO ] Added : 107 causal constraints over 23 iterations in 3486 ms. Result :sat
Minimization took 1682 ms.
[2023-03-10 17:36:43] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:36:43] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 39 ms returned sat
[2023-03-10 17:36:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:43] [INFO ] [Real]Absence check using state equation in 293 ms returned sat
[2023-03-10 17:36:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:36:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-10 17:36:44] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 54 ms returned sat
[2023-03-10 17:36:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:44] [INFO ] [Nat]Absence check using state equation in 375 ms returned sat
[2023-03-10 17:36:45] [INFO ] [Nat]Added 73 Read/Feed constraints in 562 ms returned sat
[2023-03-10 17:36:45] [INFO ] Deduced a trap composed of 15 places in 264 ms of which 1 ms to minimize.
[2023-03-10 17:36:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 388 ms
[2023-03-10 17:36:45] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 66 ms.
[2023-03-10 17:36:51] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 4 ms to minimize.
[2023-03-10 17:36:51] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 3 ms to minimize.
[2023-03-10 17:36:51] [INFO ] Deduced a trap composed of 20 places in 200 ms of which 1 ms to minimize.
[2023-03-10 17:36:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 867 ms
[2023-03-10 17:36:52] [INFO ] Added : 156 causal constraints over 32 iterations in 6587 ms. Result :sat
Minimization took 2850 ms.
[2023-03-10 17:36:55] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:36:55] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 39 ms returned sat
[2023-03-10 17:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:55] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-10 17:36:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:36:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:36:55] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 57 ms returned sat
[2023-03-10 17:36:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:36:55] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2023-03-10 17:36:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 359 ms returned sat
[2023-03-10 17:36:56] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 59 ms.
[2023-03-10 17:37:01] [INFO ] Deduced a trap composed of 16 places in 337 ms of which 1 ms to minimize.
[2023-03-10 17:37:02] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 1 ms to minimize.
[2023-03-10 17:37:02] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 1 ms to minimize.
[2023-03-10 17:37:02] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 0 ms to minimize.
[2023-03-10 17:37:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1272 ms
[2023-03-10 17:37:02] [INFO ] Added : 210 causal constraints over 43 iterations in 6550 ms. Result :sat
Minimization took 2362 ms.
[2023-03-10 17:37:05] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:37:05] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-10 17:37:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:05] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2023-03-10 17:37:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:37:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:37:06] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 53 ms returned sat
[2023-03-10 17:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:06] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2023-03-10 17:37:07] [INFO ] [Nat]Added 73 Read/Feed constraints in 1054 ms returned sat
[2023-03-10 17:37:07] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 40 ms.
[2023-03-10 17:37:11] [INFO ] Deduced a trap composed of 13 places in 387 ms of which 1 ms to minimize.
[2023-03-10 17:37:11] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 1 ms to minimize.
[2023-03-10 17:37:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 956 ms
[2023-03-10 17:37:12] [INFO ] Added : 147 causal constraints over 30 iterations in 4372 ms. Result :sat
Minimization took 1356 ms.
[2023-03-10 17:37:13] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:37:13] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 40 ms returned sat
[2023-03-10 17:37:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:14] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-10 17:37:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:37:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:37:14] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-10 17:37:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:14] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2023-03-10 17:37:14] [INFO ] [Nat]Added 73 Read/Feed constraints in 126 ms returned sat
[2023-03-10 17:37:15] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2023-03-10 17:37:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-10 17:37:15] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 41 ms.
[2023-03-10 17:37:16] [INFO ] Deduced a trap composed of 8 places in 424 ms of which 1 ms to minimize.
[2023-03-10 17:37:17] [INFO ] Deduced a trap composed of 8 places in 425 ms of which 2 ms to minimize.
[2023-03-10 17:37:17] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 2 ms to minimize.
[2023-03-10 17:37:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1464 ms
[2023-03-10 17:37:17] [INFO ] Added : 76 causal constraints over 16 iterations in 2642 ms. Result :sat
Minimization took 1471 ms.
[2023-03-10 17:37:19] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:37:19] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 41 ms returned sat
[2023-03-10 17:37:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:19] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-10 17:37:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:37:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-10 17:37:19] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 47 ms returned sat
[2023-03-10 17:37:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:20] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2023-03-10 17:37:21] [INFO ] [Nat]Added 73 Read/Feed constraints in 769 ms returned sat
[2023-03-10 17:37:21] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 107 ms.
[2023-03-10 17:37:27] [INFO ] Deduced a trap composed of 15 places in 317 ms of which 1 ms to minimize.
[2023-03-10 17:37:27] [INFO ] Deduced a trap composed of 26 places in 308 ms of which 1 ms to minimize.
[2023-03-10 17:37:28] [INFO ] Deduced a trap composed of 28 places in 299 ms of which 1 ms to minimize.
[2023-03-10 17:37:28] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 1 ms to minimize.
[2023-03-10 17:37:29] [INFO ] Deduced a trap composed of 27 places in 181 ms of which 1 ms to minimize.
[2023-03-10 17:37:29] [INFO ] Deduced a trap composed of 22 places in 235 ms of which 1 ms to minimize.
[2023-03-10 17:37:29] [INFO ] Deduced a trap composed of 23 places in 260 ms of which 1 ms to minimize.
[2023-03-10 17:37:30] [INFO ] Deduced a trap composed of 20 places in 243 ms of which 1 ms to minimize.
[2023-03-10 17:37:30] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 1 ms to minimize.
[2023-03-10 17:37:30] [INFO ] Deduced a trap composed of 40 places in 303 ms of which 1 ms to minimize.
[2023-03-10 17:37:31] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 1 ms to minimize.
[2023-03-10 17:37:31] [INFO ] Deduced a trap composed of 40 places in 212 ms of which 1 ms to minimize.
[2023-03-10 17:37:31] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
[2023-03-10 17:37:32] [INFO ] Deduced a trap composed of 24 places in 304 ms of which 1 ms to minimize.
[2023-03-10 17:37:32] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 1 ms to minimize.
[2023-03-10 17:37:33] [INFO ] Deduced a trap composed of 33 places in 171 ms of which 1 ms to minimize.
[2023-03-10 17:37:33] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 0 ms to minimize.
[2023-03-10 17:37:33] [INFO ] Deduced a trap composed of 35 places in 147 ms of which 1 ms to minimize.
[2023-03-10 17:37:33] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 1 ms to minimize.
[2023-03-10 17:37:34] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 1 ms to minimize.
[2023-03-10 17:37:34] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 0 ms to minimize.
[2023-03-10 17:37:34] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 0 ms to minimize.
[2023-03-10 17:37:35] [INFO ] Deduced a trap composed of 49 places in 170 ms of which 1 ms to minimize.
[2023-03-10 17:37:35] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 1 ms to minimize.
[2023-03-10 17:37:35] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 0 ms to minimize.
[2023-03-10 17:37:35] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 8582 ms
[2023-03-10 17:37:35] [INFO ] Added : 211 causal constraints over 43 iterations in 14591 ms. Result :sat
Minimization took 3007 ms.
[2023-03-10 17:37:38] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:37:38] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 49 ms returned sat
[2023-03-10 17:37:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:39] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2023-03-10 17:37:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:37:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:37:39] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 58 ms returned sat
[2023-03-10 17:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:37:40] [INFO ] [Nat]Absence check using state equation in 485 ms returned sat
[2023-03-10 17:37:41] [INFO ] [Nat]Added 73 Read/Feed constraints in 1327 ms returned sat
[2023-03-10 17:37:41] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2023-03-10 17:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 264 ms
[2023-03-10 17:37:41] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 61 ms.
[2023-03-10 17:37:51] [INFO ] Deduced a trap composed of 20 places in 190 ms of which 1 ms to minimize.
[2023-03-10 17:37:51] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 1 ms to minimize.
[2023-03-10 17:37:52] [INFO ] Deduced a trap composed of 25 places in 246 ms of which 1 ms to minimize.
[2023-03-10 17:37:52] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2023-03-10 17:37:52] [INFO ] Deduced a trap composed of 27 places in 249 ms of which 1 ms to minimize.
[2023-03-10 17:37:53] [INFO ] Deduced a trap composed of 28 places in 254 ms of which 1 ms to minimize.
[2023-03-10 17:37:53] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 1 ms to minimize.
[2023-03-10 17:37:54] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 1 ms to minimize.
[2023-03-10 17:37:54] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 1 ms to minimize.
[2023-03-10 17:37:54] [INFO ] Deduced a trap composed of 40 places in 243 ms of which 1 ms to minimize.
[2023-03-10 17:37:55] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 1 ms to minimize.
[2023-03-10 17:37:56] [INFO ] Deduced a trap composed of 37 places in 145 ms of which 0 ms to minimize.
[2023-03-10 17:37:56] [INFO ] Deduced a trap composed of 34 places in 160 ms of which 0 ms to minimize.
[2023-03-10 17:37:57] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 0 ms to minimize.
[2023-03-10 17:37:58] [INFO ] Deduced a trap composed of 11 places in 151 ms of which 1 ms to minimize.
[2023-03-10 17:37:58] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2023-03-10 17:37:58] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 1 ms to minimize.
[2023-03-10 17:37:59] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 1 ms to minimize.
[2023-03-10 17:37:59] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 1 ms to minimize.
[2023-03-10 17:37:59] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2023-03-10 17:38:00] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 0 ms to minimize.
[2023-03-10 17:38:00] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 1 ms to minimize.
[2023-03-10 17:38:01] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 0 ms to minimize.
[2023-03-10 17:38:01] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 1 ms to minimize.
[2023-03-10 17:38:01] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2023-03-10 17:38:01] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 10492 ms
[2023-03-10 17:38:02] [INFO ] Added : 299 causal constraints over 60 iterations in 20402 ms.(timeout) Result :sat
Minimization took 3002 ms.
[2023-03-10 17:38:05] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:38:05] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 50 ms returned sat
[2023-03-10 17:38:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:05] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2023-03-10 17:38:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:38:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:38:06] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 57 ms returned sat
[2023-03-10 17:38:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:06] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-10 17:38:07] [INFO ] [Nat]Added 73 Read/Feed constraints in 506 ms returned sat
[2023-03-10 17:38:07] [INFO ] Deduced a trap composed of 46 places in 144 ms of which 0 ms to minimize.
[2023-03-10 17:38:07] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 1 ms to minimize.
[2023-03-10 17:38:07] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 1 ms to minimize.
[2023-03-10 17:38:08] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 4 ms to minimize.
[2023-03-10 17:38:08] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 1 ms to minimize.
[2023-03-10 17:38:08] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 1 ms to minimize.
[2023-03-10 17:38:09] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 0 ms to minimize.
[2023-03-10 17:38:09] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 1 ms to minimize.
[2023-03-10 17:38:09] [INFO ] Deduced a trap composed of 20 places in 270 ms of which 1 ms to minimize.
[2023-03-10 17:38:09] [INFO ] Deduced a trap composed of 19 places in 287 ms of which 1 ms to minimize.
[2023-03-10 17:38:10] [INFO ] Deduced a trap composed of 15 places in 298 ms of which 2 ms to minimize.
[2023-03-10 17:38:10] [INFO ] Deduced a trap composed of 22 places in 208 ms of which 0 ms to minimize.
[2023-03-10 17:38:10] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 1 ms to minimize.
[2023-03-10 17:38:11] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 0 ms to minimize.
[2023-03-10 17:38:12] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 1 ms to minimize.
[2023-03-10 17:38:12] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 1 ms to minimize.
[2023-03-10 17:38:12] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 1 ms to minimize.
[2023-03-10 17:38:13] [INFO ] Deduced a trap composed of 31 places in 272 ms of which 1 ms to minimize.
[2023-03-10 17:38:13] [INFO ] Deduced a trap composed of 34 places in 253 ms of which 1 ms to minimize.
[2023-03-10 17:38:13] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
[2023-03-10 17:38:14] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 0 ms to minimize.
[2023-03-10 17:38:14] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 1 ms to minimize.
[2023-03-10 17:38:14] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 1 ms to minimize.
[2023-03-10 17:38:15] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 0 ms to minimize.
[2023-03-10 17:38:15] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 1 ms to minimize.
[2023-03-10 17:38:16] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 1 ms to minimize.
[2023-03-10 17:38:16] [INFO ] Deduced a trap composed of 18 places in 317 ms of which 1 ms to minimize.
[2023-03-10 17:38:17] [INFO ] Deduced a trap composed of 14 places in 302 ms of which 1 ms to minimize.
[2023-03-10 17:38:17] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 9972 ms
[2023-03-10 17:38:17] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 67 ms.
[2023-03-10 17:38:23] [INFO ] Deduced a trap composed of 8 places in 342 ms of which 1 ms to minimize.
[2023-03-10 17:38:24] [INFO ] Deduced a trap composed of 8 places in 364 ms of which 1 ms to minimize.
[2023-03-10 17:38:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 889 ms
[2023-03-10 17:38:24] [INFO ] Added : 177 causal constraints over 36 iterations in 7168 ms. Result :sat
Minimization took 3002 ms.
[2023-03-10 17:38:27] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:38:27] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 38 ms returned sat
[2023-03-10 17:38:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:27] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-10 17:38:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:38:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:38:27] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 46 ms returned sat
[2023-03-10 17:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:28] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2023-03-10 17:38:28] [INFO ] [Nat]Added 73 Read/Feed constraints in 61 ms returned sat
[2023-03-10 17:38:28] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 59 ms.
[2023-03-10 17:38:29] [INFO ] Added : 85 causal constraints over 17 iterations in 1624 ms. Result :sat
Minimization took 1050 ms.
[2023-03-10 17:38:31] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:38:31] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 54 ms returned sat
[2023-03-10 17:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:31] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2023-03-10 17:38:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:38:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:38:31] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 44 ms returned sat
[2023-03-10 17:38:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:32] [INFO ] [Nat]Absence check using state equation in 285 ms returned sat
[2023-03-10 17:38:32] [INFO ] [Nat]Added 73 Read/Feed constraints in 191 ms returned sat
[2023-03-10 17:38:32] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 61 ms.
[2023-03-10 17:38:33] [INFO ] Added : 61 causal constraints over 13 iterations in 974 ms. Result :sat
Minimization took 886 ms.
[2023-03-10 17:38:34] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:38:34] [INFO ] [Real]Absence check using 2 positive and 99 generalized place invariants in 48 ms returned sat
[2023-03-10 17:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:35] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2023-03-10 17:38:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:38:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:38:35] [INFO ] [Nat]Absence check using 2 positive and 99 generalized place invariants in 58 ms returned sat
[2023-03-10 17:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:38:35] [INFO ] [Nat]Absence check using state equation in 494 ms returned sat
[2023-03-10 17:38:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 1416 ms returned sat
[2023-03-10 17:38:37] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2023-03-10 17:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-10 17:38:37] [INFO ] Computed and/alt/rep : 389/2226/389 causal constraints (skipped 80 transitions) in 48 ms.
[2023-03-10 17:38:53] [INFO ] Added : 319 causal constraints over 65 iterations in 16204 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 495 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 48 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 495/495 places, 470/470 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 495/495 places, 470/470 transitions.
Applied a total of 0 rules in 43 ms. Remains 495 /495 variables (removed 0) and now considering 470/470 (removed 0) transitions.
// Phase 1: matrix 470 rows 495 cols
[2023-03-10 17:40:04] [INFO ] Computed 101 place invariants in 67 ms
[2023-03-10 17:40:05] [INFO ] Implicit Places using invariants in 1228 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1233 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 494/495 places, 470/470 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 493 transition count 469
Applied a total of 2 rules in 72 ms. Remains 493 /494 variables (removed 1) and now considering 469/470 (removed 1) transitions.
// Phase 1: matrix 469 rows 493 cols
[2023-03-10 17:40:05] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-10 17:40:06] [INFO ] Implicit Places using invariants in 1232 ms returned []
// Phase 1: matrix 469 rows 493 cols
[2023-03-10 17:40:06] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-10 17:40:07] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:40:37] [INFO ] Performed 411/493 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 17:40:43] [INFO ] Implicit Places using invariants and state equation in 37103 ms returned []
Implicit Place search using SMT with State Equation took 38353 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 493/495 places, 469/470 transitions.
Finished structural reductions, in 2 iterations. Remains : 493/495 places, 469/470 transitions.
// Phase 1: matrix 469 rows 493 cols
[2023-03-10 17:40:43] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 127604 resets, run finished after 1789 ms. (steps per millisecond=558 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84658 resets, run finished after 972 ms. (steps per millisecond=1028 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84498 resets, run finished after 1198 ms. (steps per millisecond=834 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84710 resets, run finished after 1297 ms. (steps per millisecond=771 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84949 resets, run finished after 1115 ms. (steps per millisecond=896 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85023 resets, run finished after 978 ms. (steps per millisecond=1022 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84848 resets, run finished after 985 ms. (steps per millisecond=1015 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84566 resets, run finished after 975 ms. (steps per millisecond=1025 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84965 resets, run finished after 985 ms. (steps per millisecond=1015 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84612 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84760 resets, run finished after 1154 ms. (steps per millisecond=866 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84817 resets, run finished after 1160 ms. (steps per millisecond=862 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84518 resets, run finished after 969 ms. (steps per millisecond=1031 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84799 resets, run finished after 1175 ms. (steps per millisecond=851 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84583 resets, run finished after 970 ms. (steps per millisecond=1030 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84698 resets, run finished after 1174 ms. (steps per millisecond=851 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84580 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties (out of 16) seen :0
// Phase 1: matrix 469 rows 493 cols
[2023-03-10 17:41:02] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-10 17:41:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:04] [INFO ] [Real]Absence check using state equation in 1786 ms returned sat
[2023-03-10 17:41:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:41:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:06] [INFO ] [Nat]Absence check using state equation in 1907 ms returned sat
[2023-03-10 17:41:06] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:41:09] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:41:12] [INFO ] [Nat]Added 73 Read/Feed constraints in 6018 ms returned unknown
[2023-03-10 17:41:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:13] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2023-03-10 17:41:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:41:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:13] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-10 17:41:13] [INFO ] [Nat]Added 73 Read/Feed constraints in 158 ms returned sat
[2023-03-10 17:41:14] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-10 17:41:15] [INFO ] Added : 61 causal constraints over 13 iterations in 1170 ms. Result :sat
Minimization took 1158 ms.
[2023-03-10 17:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:17] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2023-03-10 17:41:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:18] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-10 17:41:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 1242 ms returned sat
[2023-03-10 17:41:19] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 59 ms.
[2023-03-10 17:41:23] [INFO ] Deduced a trap composed of 8 places in 392 ms of which 1 ms to minimize.
[2023-03-10 17:41:23] [INFO ] Deduced a trap composed of 23 places in 253 ms of which 1 ms to minimize.
[2023-03-10 17:41:23] [INFO ] Deduced a trap composed of 15 places in 238 ms of which 1 ms to minimize.
[2023-03-10 17:41:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1129 ms
[2023-03-10 17:41:23] [INFO ] Added : 139 causal constraints over 28 iterations in 4583 ms. Result :sat
Minimization took 1971 ms.
[2023-03-10 17:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:26] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-10 17:41:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:26] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-10 17:41:26] [INFO ] [Nat]Added 73 Read/Feed constraints in 38 ms returned sat
[2023-03-10 17:41:27] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 1 ms to minimize.
[2023-03-10 17:41:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 349 ms
[2023-03-10 17:41:27] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 44 ms.
[2023-03-10 17:41:27] [INFO ] Added : 59 causal constraints over 12 iterations in 684 ms. Result :sat
Minimization took 1645 ms.
[2023-03-10 17:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:29] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-10 17:41:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:30] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2023-03-10 17:41:31] [INFO ] [Nat]Added 73 Read/Feed constraints in 1632 ms returned sat
[2023-03-10 17:41:32] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 0 ms to minimize.
[2023-03-10 17:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-03-10 17:41:32] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-10 17:41:42] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 0 ms to minimize.
[2023-03-10 17:41:42] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2023-03-10 17:41:42] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2023-03-10 17:41:43] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 1 ms to minimize.
[2023-03-10 17:41:43] [INFO ] Deduced a trap composed of 33 places in 229 ms of which 1 ms to minimize.
[2023-03-10 17:41:43] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 1 ms to minimize.
[2023-03-10 17:41:44] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 1 ms to minimize.
[2023-03-10 17:41:44] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 1 ms to minimize.
[2023-03-10 17:41:44] [INFO ] Deduced a trap composed of 34 places in 258 ms of which 1 ms to minimize.
[2023-03-10 17:41:45] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 1 ms to minimize.
[2023-03-10 17:41:45] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 1 ms to minimize.
[2023-03-10 17:41:45] [INFO ] Deduced a trap composed of 60 places in 203 ms of which 1 ms to minimize.
[2023-03-10 17:41:46] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 1 ms to minimize.
[2023-03-10 17:41:46] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 1 ms to minimize.
[2023-03-10 17:41:46] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 0 ms to minimize.
[2023-03-10 17:41:46] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 0 ms to minimize.
[2023-03-10 17:41:47] [INFO ] Deduced a trap composed of 88 places in 212 ms of which 1 ms to minimize.
[2023-03-10 17:41:47] [INFO ] Deduced a trap composed of 81 places in 217 ms of which 0 ms to minimize.
[2023-03-10 17:41:47] [INFO ] Deduced a trap composed of 95 places in 209 ms of which 1 ms to minimize.
[2023-03-10 17:41:48] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 1 ms to minimize.
[2023-03-10 17:41:48] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2023-03-10 17:41:48] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 1 ms to minimize.
[2023-03-10 17:41:49] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 0 ms to minimize.
[2023-03-10 17:41:49] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 1 ms to minimize.
[2023-03-10 17:41:49] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 0 ms to minimize.
[2023-03-10 17:41:50] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 0 ms to minimize.
[2023-03-10 17:41:50] [INFO ] Deduced a trap composed of 46 places in 118 ms of which 0 ms to minimize.
[2023-03-10 17:41:50] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2023-03-10 17:41:51] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 0 ms to minimize.
[2023-03-10 17:41:51] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2023-03-10 17:41:52] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 1 ms to minimize.
[2023-03-10 17:41:52] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 0 ms to minimize.
[2023-03-10 17:41:53] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2023-03-10 17:41:53] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 0 ms to minimize.
[2023-03-10 17:41:53] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 0 ms to minimize.
[2023-03-10 17:41:54] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 0 ms to minimize.
[2023-03-10 17:41:54] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2023-03-10 17:41:54] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 12717 ms
[2023-03-10 17:41:55] [INFO ] Added : 281 causal constraints over 57 iterations in 22971 ms. Result :sat
Minimization took 3002 ms.
[2023-03-10 17:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:58] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2023-03-10 17:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:41:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:41:59] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-10 17:42:00] [INFO ] [Nat]Added 73 Read/Feed constraints in 471 ms returned sat
[2023-03-10 17:42:00] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-10 17:42:03] [INFO ] Deduced a trap composed of 8 places in 299 ms of which 1 ms to minimize.
[2023-03-10 17:42:03] [INFO ] Deduced a trap composed of 4 places in 268 ms of which 1 ms to minimize.
[2023-03-10 17:42:04] [INFO ] Deduced a trap composed of 14 places in 324 ms of which 1 ms to minimize.
[2023-03-10 17:42:04] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 0 ms to minimize.
[2023-03-10 17:42:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1433 ms
[2023-03-10 17:42:04] [INFO ] Added : 109 causal constraints over 22 iterations in 4447 ms. Result :sat
Minimization took 1172 ms.
[2023-03-10 17:42:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:06] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-10 17:42:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:06] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2023-03-10 17:42:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 1865 ms returned sat
[2023-03-10 17:42:09] [INFO ] Deduced a trap composed of 28 places in 355 ms of which 1 ms to minimize.
[2023-03-10 17:42:09] [INFO ] Deduced a trap composed of 17 places in 313 ms of which 1 ms to minimize.
[2023-03-10 17:42:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1233 ms
[2023-03-10 17:42:09] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-10 17:42:17] [INFO ] Added : 135 causal constraints over 27 iterations in 7238 ms. Result :sat
Minimization took 974 ms.
[2023-03-10 17:42:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:18] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-03-10 17:42:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:42:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:19] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-10 17:42:19] [INFO ] [Nat]Added 73 Read/Feed constraints in 563 ms returned sat
[2023-03-10 17:42:19] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 38 ms.
[2023-03-10 17:42:27] [INFO ] Deduced a trap composed of 8 places in 211 ms of which 1 ms to minimize.
[2023-03-10 17:42:28] [INFO ] Deduced a trap composed of 18 places in 234 ms of which 1 ms to minimize.
[2023-03-10 17:42:28] [INFO ] Deduced a trap composed of 33 places in 227 ms of which 1 ms to minimize.
[2023-03-10 17:42:28] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 1 ms to minimize.
[2023-03-10 17:42:29] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 0 ms to minimize.
[2023-03-10 17:42:29] [INFO ] Deduced a trap composed of 15 places in 313 ms of which 1 ms to minimize.
[2023-03-10 17:42:29] [INFO ] Deduced a trap composed of 27 places in 200 ms of which 1 ms to minimize.
[2023-03-10 17:42:30] [INFO ] Deduced a trap composed of 28 places in 209 ms of which 0 ms to minimize.
[2023-03-10 17:42:30] [INFO ] Deduced a trap composed of 26 places in 262 ms of which 0 ms to minimize.
[2023-03-10 17:42:31] [INFO ] Deduced a trap composed of 31 places in 246 ms of which 1 ms to minimize.
[2023-03-10 17:42:31] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 1 ms to minimize.
[2023-03-10 17:42:31] [INFO ] Deduced a trap composed of 44 places in 193 ms of which 1 ms to minimize.
[2023-03-10 17:42:32] [INFO ] Deduced a trap composed of 24 places in 202 ms of which 1 ms to minimize.
[2023-03-10 17:42:32] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 1 ms to minimize.
[2023-03-10 17:42:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5107 ms
[2023-03-10 17:42:32] [INFO ] Added : 205 causal constraints over 41 iterations in 13090 ms. Result :sat
Minimization took 2218 ms.
[2023-03-10 17:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:35] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-10 17:42:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:42:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:36] [INFO ] [Nat]Absence check using state equation in 831 ms returned sat
[2023-03-10 17:42:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 1105 ms returned sat
[2023-03-10 17:42:37] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 61 ms.
[2023-03-10 17:42:41] [INFO ] Deduced a trap composed of 15 places in 333 ms of which 2 ms to minimize.
[2023-03-10 17:42:42] [INFO ] Deduced a trap composed of 14 places in 356 ms of which 1 ms to minimize.
[2023-03-10 17:42:42] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 1 ms to minimize.
[2023-03-10 17:42:42] [INFO ] Deduced a trap composed of 11 places in 340 ms of which 1 ms to minimize.
[2023-03-10 17:42:43] [INFO ] Deduced a trap composed of 19 places in 328 ms of which 0 ms to minimize.
[2023-03-10 17:42:43] [INFO ] Deduced a trap composed of 22 places in 318 ms of which 1 ms to minimize.
[2023-03-10 17:42:44] [INFO ] Deduced a trap composed of 16 places in 297 ms of which 1 ms to minimize.
[2023-03-10 17:42:44] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3014 ms
[2023-03-10 17:42:44] [INFO ] Added : 153 causal constraints over 31 iterations in 6786 ms. Result :sat
Minimization took 2688 ms.
[2023-03-10 17:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:47] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2023-03-10 17:42:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:48] [INFO ] [Nat]Absence check using state equation in 516 ms returned sat
[2023-03-10 17:42:49] [INFO ] [Nat]Added 73 Read/Feed constraints in 970 ms returned sat
[2023-03-10 17:42:49] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 0 ms to minimize.
[2023-03-10 17:42:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2023-03-10 17:42:49] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 59 ms.
[2023-03-10 17:42:53] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 1 ms to minimize.
[2023-03-10 17:42:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2023-03-10 17:42:53] [INFO ] Added : 81 causal constraints over 17 iterations in 3925 ms. Result :sat
Minimization took 2402 ms.
[2023-03-10 17:42:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:56] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2023-03-10 17:42:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:42:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:42:57] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-10 17:42:57] [INFO ] [Nat]Added 73 Read/Feed constraints in 714 ms returned sat
[2023-03-10 17:42:58] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-10 17:43:04] [INFO ] Deduced a trap composed of 13 places in 360 ms of which 4 ms to minimize.
[2023-03-10 17:43:04] [INFO ] Deduced a trap composed of 16 places in 328 ms of which 1 ms to minimize.
[2023-03-10 17:43:05] [INFO ] Deduced a trap composed of 18 places in 301 ms of which 1 ms to minimize.
[2023-03-10 17:43:05] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 1 ms to minimize.
[2023-03-10 17:43:05] [INFO ] Deduced a trap composed of 53 places in 172 ms of which 0 ms to minimize.
[2023-03-10 17:43:06] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 0 ms to minimize.
[2023-03-10 17:43:06] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2345 ms
[2023-03-10 17:43:06] [INFO ] Added : 237 causal constraints over 48 iterations in 8570 ms. Result :sat
Minimization took 1935 ms.
[2023-03-10 17:43:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:08] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-10 17:43:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:43:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:09] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2023-03-10 17:43:10] [INFO ] [Nat]Added 73 Read/Feed constraints in 1405 ms returned sat
[2023-03-10 17:43:11] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 40 ms.
[2023-03-10 17:43:24] [INFO ] Deduced a trap composed of 18 places in 196 ms of which 1 ms to minimize.
[2023-03-10 17:43:24] [INFO ] Deduced a trap composed of 23 places in 226 ms of which 1 ms to minimize.
[2023-03-10 17:43:25] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 1 ms to minimize.
[2023-03-10 17:43:25] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 1 ms to minimize.
[2023-03-10 17:43:26] [INFO ] Deduced a trap composed of 15 places in 249 ms of which 3 ms to minimize.
[2023-03-10 17:43:26] [INFO ] Deduced a trap composed of 19 places in 245 ms of which 1 ms to minimize.
[2023-03-10 17:43:26] [INFO ] Deduced a trap composed of 22 places in 232 ms of which 1 ms to minimize.
[2023-03-10 17:43:27] [INFO ] Deduced a trap composed of 20 places in 233 ms of which 1 ms to minimize.
[2023-03-10 17:43:27] [INFO ] Deduced a trap composed of 24 places in 227 ms of which 1 ms to minimize.
[2023-03-10 17:43:27] [INFO ] Deduced a trap composed of 25 places in 228 ms of which 1 ms to minimize.
[2023-03-10 17:43:28] [INFO ] Deduced a trap composed of 23 places in 215 ms of which 2 ms to minimize.
[2023-03-10 17:43:28] [INFO ] Deduced a trap composed of 41 places in 193 ms of which 2 ms to minimize.
[2023-03-10 17:43:28] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 1 ms to minimize.
[2023-03-10 17:43:29] [INFO ] Deduced a trap composed of 57 places in 203 ms of which 0 ms to minimize.
[2023-03-10 17:43:29] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 1 ms to minimize.
[2023-03-10 17:43:30] [INFO ] Deduced a trap composed of 56 places in 214 ms of which 1 ms to minimize.
[2023-03-10 17:43:30] [INFO ] Deduced a trap composed of 28 places in 227 ms of which 1 ms to minimize.
[2023-03-10 17:43:31] [INFO ] Deduced a trap composed of 61 places in 214 ms of which 1 ms to minimize.
[2023-03-10 17:43:31] [INFO ] Deduced a trap composed of 58 places in 217 ms of which 18 ms to minimize.
[2023-03-10 17:43:31] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 0 ms to minimize.
[2023-03-10 17:43:32] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2023-03-10 17:43:32] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 1 ms to minimize.
[2023-03-10 17:43:32] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 0 ms to minimize.
[2023-03-10 17:43:33] [INFO ] Deduced a trap composed of 27 places in 243 ms of which 1 ms to minimize.
[2023-03-10 17:43:33] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 1 ms to minimize.
[2023-03-10 17:43:34] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 1 ms to minimize.
[2023-03-10 17:43:34] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 10016 ms
[2023-03-10 17:43:34] [INFO ] Added : 335 causal constraints over 69 iterations in 23540 ms. Result :sat
Minimization took 2338 ms.
[2023-03-10 17:43:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:37] [INFO ] [Real]Absence check using state equation in 470 ms returned sat
[2023-03-10 17:43:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:38] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2023-03-10 17:43:38] [INFO ] [Nat]Added 73 Read/Feed constraints in 506 ms returned sat
[2023-03-10 17:43:38] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 1 ms to minimize.
[2023-03-10 17:43:39] [INFO ] Deduced a trap composed of 43 places in 197 ms of which 0 ms to minimize.
[2023-03-10 17:43:39] [INFO ] Deduced a trap composed of 41 places in 203 ms of which 1 ms to minimize.
[2023-03-10 17:43:39] [INFO ] Deduced a trap composed of 39 places in 233 ms of which 0 ms to minimize.
[2023-03-10 17:43:39] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 0 ms to minimize.
[2023-03-10 17:43:40] [INFO ] Deduced a trap composed of 33 places in 231 ms of which 0 ms to minimize.
[2023-03-10 17:43:40] [INFO ] Deduced a trap composed of 34 places in 223 ms of which 4 ms to minimize.
[2023-03-10 17:43:40] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 1 ms to minimize.
[2023-03-10 17:43:41] [INFO ] Deduced a trap composed of 31 places in 249 ms of which 0 ms to minimize.
[2023-03-10 17:43:41] [INFO ] Deduced a trap composed of 34 places in 269 ms of which 1 ms to minimize.
[2023-03-10 17:43:41] [INFO ] Deduced a trap composed of 28 places in 279 ms of which 1 ms to minimize.
[2023-03-10 17:43:42] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2023-03-10 17:43:42] [INFO ] Deduced a trap composed of 20 places in 268 ms of which 1 ms to minimize.
[2023-03-10 17:43:42] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 1 ms to minimize.
[2023-03-10 17:43:42] [INFO ] Deduced a trap composed of 19 places in 295 ms of which 1 ms to minimize.
[2023-03-10 17:43:43] [INFO ] Deduced a trap composed of 15 places in 308 ms of which 0 ms to minimize.
[2023-03-10 17:43:43] [INFO ] Deduced a trap composed of 14 places in 311 ms of which 1 ms to minimize.
[2023-03-10 17:43:43] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5039 ms
[2023-03-10 17:43:43] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 66 ms.
[2023-03-10 17:43:49] [INFO ] Added : 190 causal constraints over 38 iterations in 5873 ms. Result :sat
Minimization took 1906 ms.
[2023-03-10 17:43:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:52] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2023-03-10 17:43:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:43:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:52] [INFO ] [Nat]Absence check using state equation in 286 ms returned sat
[2023-03-10 17:43:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 116 ms returned sat
[2023-03-10 17:43:52] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 59 ms.
[2023-03-10 17:43:53] [INFO ] Added : 75 causal constraints over 15 iterations in 1220 ms. Result :sat
Minimization took 1194 ms.
[2023-03-10 17:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:55] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2023-03-10 17:43:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:43:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:55] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-03-10 17:43:56] [INFO ] [Nat]Added 73 Read/Feed constraints in 30 ms returned sat
[2023-03-10 17:43:56] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 44 ms.
[2023-03-10 17:43:57] [INFO ] Added : 60 causal constraints over 12 iterations in 1768 ms. Result :sat
Minimization took 525 ms.
[2023-03-10 17:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:58] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-10 17:43:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:43:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:43:59] [INFO ] [Nat]Absence check using state equation in 323 ms returned sat
[2023-03-10 17:43:59] [INFO ] [Nat]Added 73 Read/Feed constraints in 672 ms returned sat
[2023-03-10 17:43:59] [INFO ] Computed and/alt/rep : 388/2223/388 causal constraints (skipped 80 transitions) in 39 ms.
[2023-03-10 17:44:13] [INFO ] Deduced a trap composed of 18 places in 227 ms of which 1 ms to minimize.
[2023-03-10 17:44:13] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 2 ms to minimize.
[2023-03-10 17:44:14] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 1 ms to minimize.
[2023-03-10 17:44:14] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 1 ms to minimize.
[2023-03-10 17:44:14] [INFO ] Deduced a trap composed of 28 places in 214 ms of which 1 ms to minimize.
[2023-03-10 17:44:15] [INFO ] Deduced a trap composed of 33 places in 223 ms of which 1 ms to minimize.
[2023-03-10 17:44:15] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 1 ms to minimize.
[2023-03-10 17:44:15] [INFO ] Deduced a trap composed of 33 places in 206 ms of which 1 ms to minimize.
[2023-03-10 17:44:16] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 1 ms to minimize.
[2023-03-10 17:44:16] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 0 ms to minimize.
[2023-03-10 17:44:16] [INFO ] Deduced a trap composed of 33 places in 209 ms of which 1 ms to minimize.
[2023-03-10 17:44:17] [INFO ] Deduced a trap composed of 49 places in 215 ms of which 1 ms to minimize.
[2023-03-10 17:44:17] [INFO ] Deduced a trap composed of 47 places in 212 ms of which 1 ms to minimize.
[2023-03-10 17:44:18] [INFO ] Deduced a trap composed of 56 places in 170 ms of which 1 ms to minimize.
[2023-03-10 17:44:18] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 1 ms to minimize.
[2023-03-10 17:44:21] [INFO ] Trap strengthening (SAT) tested/added 15/15 trap constraints in 8036 ms
[2023-03-10 17:44:44] [INFO ] Deduced a trap composed of 3 places in 430 ms of which 1 ms to minimize.
[2023-03-10 17:44:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 493 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 493/493 places, 469/469 transitions.
Applied a total of 0 rules in 18 ms. Remains 493 /493 variables (removed 0) and now considering 469/469 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 493/493 places, 469/469 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 493/493 places, 469/469 transitions.
Applied a total of 0 rules in 24 ms. Remains 493 /493 variables (removed 0) and now considering 469/469 (removed 0) transitions.
// Phase 1: matrix 469 rows 493 cols
[2023-03-10 17:47:04] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 17:47:05] [INFO ] Implicit Places using invariants in 1121 ms returned []
// Phase 1: matrix 469 rows 493 cols
[2023-03-10 17:47:05] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-10 17:47:06] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:47:28] [INFO ] Implicit Places using invariants and state equation in 22763 ms returned [191, 212, 225, 240, 245, 296, 301, 323, 328, 350, 355, 377, 383, 404, 406, 430, 458, 485, 491]
Discarding 19 places :
Implicit Place search using SMT with State Equation took 23901 ms to find 19 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 474/493 places, 469/469 transitions.
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 474 transition count 464
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 10 place count 469 transition count 464
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 469 transition count 464
Applied a total of 19 rules in 72 ms. Remains 469 /474 variables (removed 5) and now considering 464/469 (removed 5) transitions.
// Phase 1: matrix 464 rows 469 cols
[2023-03-10 17:47:28] [INFO ] Computed 81 place invariants in 63 ms
[2023-03-10 17:47:29] [INFO ] Implicit Places using invariants in 910 ms returned []
// Phase 1: matrix 464 rows 469 cols
[2023-03-10 17:47:29] [INFO ] Computed 81 place invariants in 54 ms
[2023-03-10 17:47:29] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:47:55] [INFO ] Implicit Places using invariants and state equation in 25738 ms returned [268, 391, 416, 442, 446]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 26660 ms to find 5 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 464/493 places, 464/469 transitions.
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 464 transition count 460
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 8 place count 460 transition count 460
Applied a total of 8 rules in 30 ms. Remains 460 /464 variables (removed 4) and now considering 460/464 (removed 4) transitions.
// Phase 1: matrix 460 rows 460 cols
[2023-03-10 17:47:55] [INFO ] Computed 76 place invariants in 70 ms
[2023-03-10 17:47:56] [INFO ] Implicit Places using invariants in 1021 ms returned []
// Phase 1: matrix 460 rows 460 cols
[2023-03-10 17:47:56] [INFO ] Computed 76 place invariants in 70 ms
[2023-03-10 17:47:56] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:48:20] [INFO ] Implicit Places using invariants and state equation in 24540 ms returned [106]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 25580 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 459/493 places, 460/469 transitions.
Applied a total of 0 rules in 26 ms. Remains 459 /459 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions, in 4 iterations. Remains : 459/493 places, 460/469 transitions.
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:48:21] [INFO ] Computed 75 place invariants in 106 ms
Incomplete random walk after 1000000 steps, including 129020 resets, run finished after 1827 ms. (steps per millisecond=547 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85165 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85097 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85347 resets, run finished after 961 ms. (steps per millisecond=1040 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84919 resets, run finished after 1226 ms. (steps per millisecond=815 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84934 resets, run finished after 1095 ms. (steps per millisecond=913 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85151 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85292 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85522 resets, run finished after 1035 ms. (steps per millisecond=966 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85082 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85235 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84996 resets, run finished after 952 ms. (steps per millisecond=1050 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85226 resets, run finished after 987 ms. (steps per millisecond=1013 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85305 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85218 resets, run finished after 954 ms. (steps per millisecond=1048 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85124 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85292 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 16) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:48:38] [INFO ] Computed 75 place invariants in 69 ms
[2023-03-10 17:48:38] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:48:39] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 49 ms returned sat
[2023-03-10 17:48:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:39] [INFO ] [Real]Absence check using state equation in 924 ms returned sat
[2023-03-10 17:48:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:48:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:48:40] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 33 ms returned sat
[2023-03-10 17:48:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:48:40] [INFO ] [Nat]Absence check using state equation in 752 ms returned sat
[2023-03-10 17:48:40] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:48:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:48:44] [INFO ] [Nat]Added 73 Read/Feed constraints in 3336 ms returned sat
[2023-03-10 17:48:44] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 1 ms to minimize.
[2023-03-10 17:48:44] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 1 ms to minimize.
[2023-03-10 17:48:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 694 ms
[2023-03-10 17:48:44] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 56 ms.
[2023-03-10 17:48:59] [INFO ] Added : 240 causal constraints over 48 iterations in 14474 ms. Result :sat
Minimization took 2194 ms.
[2023-03-10 17:49:01] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:49:01] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 30 ms returned sat
[2023-03-10 17:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:02] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2023-03-10 17:49:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:49:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:49:02] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-10 17:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:02] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2023-03-10 17:49:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 131 ms returned sat
[2023-03-10 17:49:02] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 32 ms.
[2023-03-10 17:49:03] [INFO ] Added : 65 causal constraints over 13 iterations in 664 ms. Result :sat
Minimization took 796 ms.
[2023-03-10 17:49:04] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:49:04] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 17:49:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:05] [INFO ] [Real]Absence check using state equation in 1252 ms returned sat
[2023-03-10 17:49:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:49:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:49:05] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 53 ms returned sat
[2023-03-10 17:49:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:06] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2023-03-10 17:49:08] [INFO ] [Nat]Added 73 Read/Feed constraints in 1920 ms returned sat
[2023-03-10 17:49:08] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 0 ms to minimize.
[2023-03-10 17:49:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2023-03-10 17:49:08] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 38 ms.
[2023-03-10 17:49:12] [INFO ] Deduced a trap composed of 8 places in 337 ms of which 1 ms to minimize.
[2023-03-10 17:49:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 428 ms
[2023-03-10 17:49:12] [INFO ] Added : 134 causal constraints over 27 iterations in 4023 ms. Result :sat
Minimization took 1416 ms.
[2023-03-10 17:49:14] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:49:14] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 47 ms returned sat
[2023-03-10 17:49:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:14] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2023-03-10 17:49:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:49:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:49:14] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-10 17:49:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:15] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-03-10 17:49:15] [INFO ] [Nat]Added 73 Read/Feed constraints in 46 ms returned sat
[2023-03-10 17:49:15] [INFO ] Deduced a trap composed of 14 places in 313 ms of which 0 ms to minimize.
[2023-03-10 17:49:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 380 ms
[2023-03-10 17:49:15] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 59 ms.
[2023-03-10 17:49:16] [INFO ] Added : 55 causal constraints over 11 iterations in 763 ms. Result :sat
Minimization took 1312 ms.
[2023-03-10 17:49:17] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:49:17] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-10 17:49:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:18] [INFO ] [Real]Absence check using state equation in 477 ms returned sat
[2023-03-10 17:49:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:49:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:49:18] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 17:49:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:19] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2023-03-10 17:49:20] [INFO ] [Nat]Added 73 Read/Feed constraints in 1830 ms returned sat
[2023-03-10 17:49:21] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 0 ms to minimize.
[2023-03-10 17:49:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-10 17:49:21] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 38 ms.
[2023-03-10 17:49:34] [INFO ] Deduced a trap composed of 8 places in 223 ms of which 1 ms to minimize.
[2023-03-10 17:49:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 513 ms
[2023-03-10 17:49:34] [INFO ] Added : 323 causal constraints over 65 iterations in 13557 ms. Result :sat
Minimization took 3001 ms.
[2023-03-10 17:49:37] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 17:49:37] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-10 17:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:38] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2023-03-10 17:49:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:49:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:49:38] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 44 ms returned sat
[2023-03-10 17:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:39] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2023-03-10 17:49:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 777 ms returned sat
[2023-03-10 17:49:40] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 37 ms.
[2023-03-10 17:49:48] [INFO ] Deduced a trap composed of 8 places in 341 ms of which 1 ms to minimize.
[2023-03-10 17:49:48] [INFO ] Deduced a trap composed of 15 places in 279 ms of which 1 ms to minimize.
[2023-03-10 17:49:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 891 ms
[2023-03-10 17:49:48] [INFO ] Added : 147 causal constraints over 30 iterations in 8963 ms. Result :sat
Minimization took 1116 ms.
[2023-03-10 17:49:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 17:49:50] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 17:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:50] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-03-10 17:49:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:49:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:49:50] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 29 ms returned sat
[2023-03-10 17:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:49:51] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-10 17:49:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 1399 ms returned sat
[2023-03-10 17:49:52] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 1 ms to minimize.
[2023-03-10 17:49:53] [INFO ] Deduced a trap composed of 10 places in 293 ms of which 1 ms to minimize.
[2023-03-10 17:49:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 614 ms
[2023-03-10 17:49:53] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 58 ms.
[2023-03-10 17:49:59] [INFO ] Deduced a trap composed of 12 places in 336 ms of which 1 ms to minimize.
[2023-03-10 17:50:00] [INFO ] Deduced a trap composed of 8 places in 339 ms of which 1 ms to minimize.
[2023-03-10 17:50:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 865 ms
[2023-03-10 17:50:00] [INFO ] Added : 164 causal constraints over 35 iterations in 7439 ms. Result :sat
Minimization took 1898 ms.
[2023-03-10 17:50:02] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:50:02] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-10 17:50:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:02] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-10 17:50:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:50:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:50:03] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 48 ms returned sat
[2023-03-10 17:50:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:03] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2023-03-10 17:50:04] [INFO ] [Nat]Added 73 Read/Feed constraints in 648 ms returned sat
[2023-03-10 17:50:04] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 37 ms.
[2023-03-10 17:50:15] [INFO ] Deduced a trap composed of 25 places in 194 ms of which 0 ms to minimize.
[2023-03-10 17:50:15] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 1 ms to minimize.
[2023-03-10 17:50:16] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 0 ms to minimize.
[2023-03-10 17:50:16] [INFO ] Deduced a trap composed of 22 places in 156 ms of which 1 ms to minimize.
[2023-03-10 17:50:16] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2023-03-10 17:50:16] [INFO ] Deduced a trap composed of 25 places in 156 ms of which 1 ms to minimize.
[2023-03-10 17:50:17] [INFO ] Deduced a trap composed of 39 places in 258 ms of which 1 ms to minimize.
[2023-03-10 17:50:17] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 1 ms to minimize.
[2023-03-10 17:50:17] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 1 ms to minimize.
[2023-03-10 17:50:17] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2535 ms
[2023-03-10 17:50:18] [INFO ] Added : 228 causal constraints over 46 iterations in 13609 ms. Result :sat
Minimization took 1954 ms.
[2023-03-10 17:50:20] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 17:50:20] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 17:50:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:20] [INFO ] [Real]Absence check using state equation in 392 ms returned sat
[2023-03-10 17:50:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:50:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:50:20] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 33 ms returned sat
[2023-03-10 17:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:21] [INFO ] [Nat]Absence check using state equation in 492 ms returned sat
[2023-03-10 17:50:22] [INFO ] [Nat]Added 73 Read/Feed constraints in 1203 ms returned sat
[2023-03-10 17:50:22] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 39 ms.
[2023-03-10 17:50:28] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2023-03-10 17:50:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-10 17:50:28] [INFO ] Added : 179 causal constraints over 36 iterations in 6102 ms. Result :sat
Minimization took 3002 ms.
[2023-03-10 17:50:31] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 17:50:31] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 17:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:32] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2023-03-10 17:50:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:50:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:50:32] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 45 ms returned sat
[2023-03-10 17:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:32] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2023-03-10 17:50:33] [INFO ] [Nat]Added 73 Read/Feed constraints in 937 ms returned sat
[2023-03-10 17:50:33] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 37 ms.
[2023-03-10 17:50:34] [INFO ] Added : 75 causal constraints over 15 iterations in 1060 ms. Result :sat
Minimization took 1684 ms.
[2023-03-10 17:50:36] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 17:50:36] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 17:50:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:37] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2023-03-10 17:50:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:50:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:50:37] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 43 ms returned sat
[2023-03-10 17:50:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:38] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2023-03-10 17:50:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 728 ms returned sat
[2023-03-10 17:50:39] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-10 17:50:51] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 0 ms to minimize.
[2023-03-10 17:50:51] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 1 ms to minimize.
[2023-03-10 17:50:51] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 1 ms to minimize.
[2023-03-10 17:50:52] [INFO ] Deduced a trap composed of 15 places in 274 ms of which 1 ms to minimize.
[2023-03-10 17:50:52] [INFO ] Deduced a trap composed of 49 places in 213 ms of which 1 ms to minimize.
[2023-03-10 17:50:52] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 1 ms to minimize.
[2023-03-10 17:50:53] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 1 ms to minimize.
[2023-03-10 17:50:53] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 0 ms to minimize.
[2023-03-10 17:50:53] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 0 ms to minimize.
[2023-03-10 17:50:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2824 ms
[2023-03-10 17:50:53] [INFO ] Added : 256 causal constraints over 52 iterations in 14470 ms. Result :sat
Minimization took 3005 ms.
[2023-03-10 17:50:57] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:50:57] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 17:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:57] [INFO ] [Real]Absence check using state equation in 461 ms returned sat
[2023-03-10 17:50:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:50:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 17:50:57] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-10 17:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:50:58] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2023-03-10 17:51:01] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:51:02] [INFO ] [Nat]Added 73 Read/Feed constraints in 3588 ms returned sat
[2023-03-10 17:51:02] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-10 17:51:13] [INFO ] Deduced a trap composed of 15 places in 222 ms of which 0 ms to minimize.
[2023-03-10 17:51:14] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
[2023-03-10 17:51:14] [INFO ] Deduced a trap composed of 33 places in 224 ms of which 0 ms to minimize.
[2023-03-10 17:51:14] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 1 ms to minimize.
[2023-03-10 17:51:15] [INFO ] Deduced a trap composed of 43 places in 260 ms of which 1 ms to minimize.
[2023-03-10 17:51:15] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 0 ms to minimize.
[2023-03-10 17:51:16] [INFO ] Deduced a trap composed of 42 places in 221 ms of which 1 ms to minimize.
[2023-03-10 17:51:16] [INFO ] Deduced a trap composed of 28 places in 233 ms of which 1 ms to minimize.
[2023-03-10 17:51:16] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 1 ms to minimize.
[2023-03-10 17:51:17] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 0 ms to minimize.
[2023-03-10 17:51:17] [INFO ] Deduced a trap composed of 20 places in 240 ms of which 1 ms to minimize.
[2023-03-10 17:51:17] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 0 ms to minimize.
[2023-03-10 17:51:18] [INFO ] Deduced a trap composed of 58 places in 129 ms of which 1 ms to minimize.
[2023-03-10 17:51:18] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 1 ms to minimize.
[2023-03-10 17:51:19] [INFO ] Deduced a trap composed of 59 places in 129 ms of which 0 ms to minimize.
[2023-03-10 17:51:19] [INFO ] Deduced a trap composed of 66 places in 207 ms of which 2 ms to minimize.
[2023-03-10 17:51:20] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 0 ms to minimize.
[2023-03-10 17:51:20] [INFO ] Deduced a trap composed of 68 places in 69 ms of which 0 ms to minimize.
[2023-03-10 17:51:21] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2023-03-10 17:51:21] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 0 ms to minimize.
[2023-03-10 17:51:21] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 1 ms to minimize.
[2023-03-10 17:51:21] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2023-03-10 17:51:21] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 8049 ms
[2023-03-10 17:51:22] [INFO ] Added : 247 causal constraints over 51 iterations in 19958 ms. Result :sat
Minimization took 3002 ms.
[2023-03-10 17:51:25] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 17:51:25] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 42 ms returned sat
[2023-03-10 17:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:25] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2023-03-10 17:51:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:51:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:51:25] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 44 ms returned sat
[2023-03-10 17:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:26] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2023-03-10 17:51:27] [INFO ] [Nat]Added 73 Read/Feed constraints in 956 ms returned sat
[2023-03-10 17:51:27] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2023-03-10 17:51:27] [INFO ] Deduced a trap composed of 39 places in 148 ms of which 0 ms to minimize.
[2023-03-10 17:51:28] [INFO ] Deduced a trap composed of 39 places in 211 ms of which 0 ms to minimize.
[2023-03-10 17:51:28] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 1 ms to minimize.
[2023-03-10 17:51:28] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 0 ms to minimize.
[2023-03-10 17:51:28] [INFO ] Deduced a trap composed of 33 places in 221 ms of which 1 ms to minimize.
[2023-03-10 17:51:29] [INFO ] Deduced a trap composed of 30 places in 231 ms of which 0 ms to minimize.
[2023-03-10 17:51:29] [INFO ] Deduced a trap composed of 26 places in 231 ms of which 1 ms to minimize.
[2023-03-10 17:51:29] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2023-03-10 17:51:30] [INFO ] Deduced a trap composed of 27 places in 242 ms of which 1 ms to minimize.
[2023-03-10 17:51:30] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 1 ms to minimize.
[2023-03-10 17:51:30] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 1 ms to minimize.
[2023-03-10 17:51:31] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 1 ms to minimize.
[2023-03-10 17:51:31] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 1 ms to minimize.
[2023-03-10 17:51:31] [INFO ] Deduced a trap composed of 14 places in 255 ms of which 1 ms to minimize.
[2023-03-10 17:51:31] [INFO ] Deduced a trap composed of 18 places in 276 ms of which 1 ms to minimize.
[2023-03-10 17:51:32] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 1 ms to minimize.
[2023-03-10 17:51:32] [INFO ] Deduced a trap composed of 20 places in 234 ms of which 1 ms to minimize.
[2023-03-10 17:51:32] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 1 ms to minimize.
[2023-03-10 17:51:33] [INFO ] Deduced a trap composed of 31 places in 211 ms of which 1 ms to minimize.
[2023-03-10 17:51:33] [INFO ] Deduced a trap composed of 29 places in 227 ms of which 1 ms to minimize.
[2023-03-10 17:51:33] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 0 ms to minimize.
[2023-03-10 17:51:34] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 1 ms to minimize.
[2023-03-10 17:51:34] [INFO ] Deduced a trap composed of 43 places in 211 ms of which 1 ms to minimize.
[2023-03-10 17:51:34] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 1 ms to minimize.
[2023-03-10 17:51:34] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 1 ms to minimize.
[2023-03-10 17:51:35] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 1 ms to minimize.
[2023-03-10 17:51:35] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 0 ms to minimize.
[2023-03-10 17:51:36] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8636 ms
[2023-03-10 17:51:36] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 34 ms.
[2023-03-10 17:51:43] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2023-03-10 17:51:43] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2023-03-10 17:51:43] [INFO ] Deduced a trap composed of 18 places in 247 ms of which 1 ms to minimize.
[2023-03-10 17:51:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 969 ms
[2023-03-10 17:51:44] [INFO ] Added : 213 causal constraints over 43 iterations in 7813 ms. Result :sat
Minimization took 3001 ms.
[2023-03-10 17:51:47] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:51:47] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 17:51:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:47] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-10 17:51:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:51:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:51:47] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 33 ms returned sat
[2023-03-10 17:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:47] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2023-03-10 17:51:47] [INFO ] [Nat]Added 73 Read/Feed constraints in 55 ms returned sat
[2023-03-10 17:51:47] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 43 ms.
[2023-03-10 17:51:50] [INFO ] Added : 82 causal constraints over 17 iterations in 2499 ms. Result :sat
Minimization took 1298 ms.
[2023-03-10 17:51:51] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:51:51] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 17:51:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:52] [INFO ] [Real]Absence check using state equation in 312 ms returned sat
[2023-03-10 17:51:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:51:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:51:52] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-10 17:51:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:52] [INFO ] [Nat]Absence check using state equation in 300 ms returned sat
[2023-03-10 17:51:52] [INFO ] [Nat]Added 73 Read/Feed constraints in 38 ms returned sat
[2023-03-10 17:51:52] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 49 ms.
[2023-03-10 17:51:54] [INFO ] Added : 63 causal constraints over 13 iterations in 1804 ms. Result :sat
Minimization took 886 ms.
[2023-03-10 17:51:55] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:51:55] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 17:51:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:56] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2023-03-10 17:51:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:51:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 17:51:56] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 47 ms returned sat
[2023-03-10 17:51:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:51:57] [INFO ] [Nat]Absence check using state equation in 670 ms returned sat
[2023-03-10 17:52:00] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:52:00] [INFO ] [Nat]Added 73 Read/Feed constraints in 3368 ms returned sat
[2023-03-10 17:52:00] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2023-03-10 17:52:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-10 17:52:00] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-10 17:52:16] [INFO ] Deduced a trap composed of 7 places in 242 ms of which 1 ms to minimize.
[2023-03-10 17:52:16] [INFO ] Deduced a trap composed of 12 places in 240 ms of which 0 ms to minimize.
[2023-03-10 17:52:17] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
[2023-03-10 17:52:17] [INFO ] Deduced a trap composed of 7 places in 248 ms of which 1 ms to minimize.
[2023-03-10 17:52:17] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 0 ms to minimize.
[2023-03-10 17:52:18] [INFO ] Deduced a trap composed of 6 places in 231 ms of which 1 ms to minimize.
[2023-03-10 17:52:18] [INFO ] Deduced a trap composed of 18 places in 235 ms of which 1 ms to minimize.
[2023-03-10 17:52:18] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 0 ms to minimize.
[2023-03-10 17:52:19] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2023-03-10 17:52:19] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 1 ms to minimize.
[2023-03-10 17:52:19] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 1 ms to minimize.
[2023-03-10 17:52:20] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 0 ms to minimize.
[2023-03-10 17:52:20] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 0 ms to minimize.
[2023-03-10 17:52:20] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 1 ms to minimize.
[2023-03-10 17:52:21] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 1 ms to minimize.
[2023-03-10 17:52:21] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 0 ms to minimize.
[2023-03-10 17:52:21] [INFO ] Deduced a trap composed of 46 places in 183 ms of which 0 ms to minimize.
[2023-03-10 17:52:21] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 1 ms to minimize.
[2023-03-10 17:52:22] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
[2023-03-10 17:52:22] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 0 ms to minimize.
[2023-03-10 17:52:22] [INFO ] Deduced a trap composed of 45 places in 141 ms of which 0 ms to minimize.
[2023-03-10 17:52:22] [INFO ] Deduced a trap composed of 51 places in 127 ms of which 1 ms to minimize.
[2023-03-10 17:52:23] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 0 ms to minimize.
[2023-03-10 17:52:23] [INFO ] Deduced a trap composed of 49 places in 199 ms of which 0 ms to minimize.
[2023-03-10 17:52:23] [INFO ] Deduced a trap composed of 33 places in 203 ms of which 1 ms to minimize.
[2023-03-10 17:52:24] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 1 ms to minimize.
[2023-03-10 17:52:24] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 1 ms to minimize.
[2023-03-10 17:52:24] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 0 ms to minimize.
[2023-03-10 17:52:24] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 0 ms to minimize.
[2023-03-10 17:52:25] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 1 ms to minimize.
[2023-03-10 17:52:25] [INFO ] Deduced a trap composed of 56 places in 203 ms of which 0 ms to minimize.
[2023-03-10 17:52:26] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 1 ms to minimize.
[2023-03-10 17:52:26] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 1 ms to minimize.
[2023-03-10 17:52:26] [INFO ] Deduced a trap composed of 57 places in 193 ms of which 1 ms to minimize.
[2023-03-10 17:52:27] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 1 ms to minimize.
[2023-03-10 17:52:27] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 1 ms to minimize.
[2023-03-10 17:52:27] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 1 ms to minimize.
[2023-03-10 17:52:27] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 0 ms to minimize.
[2023-03-10 17:52:28] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2023-03-10 17:52:28] [INFO ] Deduced a trap composed of 87 places in 198 ms of which 1 ms to minimize.
[2023-03-10 17:52:28] [INFO ] Deduced a trap composed of 77 places in 203 ms of which 1 ms to minimize.
[2023-03-10 17:52:29] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 1 ms to minimize.
[2023-03-10 17:52:29] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 0 ms to minimize.
[2023-03-10 17:52:29] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 1 ms to minimize.
[2023-03-10 17:52:30] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 1 ms to minimize.
[2023-03-10 17:52:30] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 0 ms to minimize.
[2023-03-10 17:52:30] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 14213 ms
[2023-03-10 17:52:30] [INFO ] Added : 298 causal constraints over 61 iterations in 29845 ms.(timeout) Result :sat
Minimization took 3008 ms.
Current structural bounds on expressions (after SMT) : [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Applied a total of 0 rules in 15 ms. Remains 459 /459 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 459/459 places, 460/460 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Applied a total of 0 rules in 13 ms. Remains 459 /459 variables (removed 0) and now considering 460/460 (removed 0) transitions.
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:54:06] [INFO ] Computed 75 place invariants in 69 ms
[2023-03-10 17:54:07] [INFO ] Implicit Places using invariants in 1027 ms returned []
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:54:07] [INFO ] Computed 75 place invariants in 102 ms
[2023-03-10 17:54:08] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:54:17] [INFO ] Implicit Places using invariants and state equation in 10136 ms returned []
Implicit Place search using SMT with State Equation took 11179 ms to find 0 implicit places.
[2023-03-10 17:54:17] [INFO ] Redundant transitions in 40 ms returned []
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:54:17] [INFO ] Computed 75 place invariants in 108 ms
[2023-03-10 17:54:18] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 459/459 places, 460/460 transitions.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-00
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:54:18] [INFO ] Computed 75 place invariants in 115 ms
Incomplete random walk after 10000 steps, including 1309 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 865 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:54:18] [INFO ] Computed 75 place invariants in 115 ms
[2023-03-10 17:54:18] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:54:19] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 17:54:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:54:20] [INFO ] [Real]Absence check using state equation in 1008 ms returned sat
[2023-03-10 17:54:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:54:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:54:20] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-10 17:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:54:20] [INFO ] [Nat]Absence check using state equation in 775 ms returned sat
[2023-03-10 17:54:20] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:54:23] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:54:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 3202 ms returned sat
[2023-03-10 17:54:24] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 0 ms to minimize.
[2023-03-10 17:54:24] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2023-03-10 17:54:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 663 ms
[2023-03-10 17:54:24] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 56 ms.
[2023-03-10 17:54:25] [INFO ] Added : 5 causal constraints over 1 iterations in 247 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 448 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 448 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 450
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 447 transition count 445
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 33 place count 442 transition count 445
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 39 place count 442 transition count 445
Applied a total of 39 rules in 122 ms. Remains 442 /459 variables (removed 17) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 442 cols
[2023-03-10 17:54:25] [INFO ] Computed 75 place invariants in 68 ms
Incomplete random walk after 1000000 steps, including 128966 resets, run finished after 1483 ms. (steps per millisecond=674 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84869 resets, run finished after 789 ms. (steps per millisecond=1267 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 442 cols
[2023-03-10 17:54:27] [INFO ] Computed 75 place invariants in 42 ms
[2023-03-10 17:54:27] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 17:54:27] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 31 ms returned sat
[2023-03-10 17:54:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:54:28] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2023-03-10 17:54:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:54:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 17:54:28] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 36 ms returned sat
[2023-03-10 17:54:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:54:29] [INFO ] [Nat]Absence check using state equation in 1109 ms returned sat
[2023-03-10 17:54:29] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 17:54:32] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:54:34] [INFO ] [Nat]Added 80 Read/Feed constraints in 4164 ms returned sat
[2023-03-10 17:54:34] [INFO ] Computed and/alt/rep : 340/2183/340 causal constraints (skipped 104 transitions) in 35 ms.
[2023-03-10 17:54:47] [INFO ] Added : 245 causal constraints over 49 iterations in 13654 ms. Result :sat
Minimization took 2910 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 13 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/442 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 12 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 442 cols
[2023-03-10 17:54:50] [INFO ] Computed 75 place invariants in 42 ms
[2023-03-10 17:54:51] [INFO ] Implicit Places using invariants in 1257 ms returned [46, 52, 72, 77, 102, 122, 128, 149, 154, 155, 175, 204, 249]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1267 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 429/442 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 436
Applied a total of 18 rules in 28 ms. Remains 420 /429 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-10 17:54:51] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 17:54:52] [INFO ] Implicit Places using invariants in 478 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-10 17:54:52] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-10 17:54:52] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 17:55:06] [INFO ] Implicit Places using invariants and state equation in 14214 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 14707 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/442 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 22 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 17:55:06] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 17:55:07] [INFO ] Implicit Places using invariants in 583 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 17:55:07] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 17:55:07] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 17:55:31] [INFO ] Implicit Places using invariants and state equation in 24524 ms returned []
Implicit Place search using SMT with State Equation took 25108 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 417/442 places, 434/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 417/442 places, 434/445 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 17:55:31] [INFO ] Invariants computation overflowed in 39 ms
Incomplete random walk after 1000000 steps, including 143620 resets, run finished after 1351 ms. (steps per millisecond=740 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91373 resets, run finished after 717 ms. (steps per millisecond=1394 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 17:55:33] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 17:55:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:55:34] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2023-03-10 17:55:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:55:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:55:34] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2023-03-10 17:55:34] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 17:55:37] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 17:55:40] [INFO ] [Nat]Added 80 Read/Feed constraints in 5735 ms returned sat
[2023-03-10 17:55:40] [INFO ] Deduced a trap composed of 118 places in 282 ms of which 1 ms to minimize.
[2023-03-10 17:55:41] [INFO ] Deduced a trap composed of 16 places in 354 ms of which 0 ms to minimize.
[2023-03-10 17:55:41] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2023-03-10 17:55:42] [INFO ] Deduced a trap composed of 10 places in 443 ms of which 1 ms to minimize.
[2023-03-10 17:55:42] [INFO ] Deduced a trap composed of 133 places in 419 ms of which 1 ms to minimize.
[2023-03-10 17:55:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2128 ms
[2023-03-10 17:55:42] [INFO ] Computed and/alt/rep : 326/2143/326 causal constraints (skipped 107 transitions) in 53 ms.
[2023-03-10 17:55:52] [INFO ] Added : 120 causal constraints over 24 iterations in 9540 ms. Result :sat
Minimization took 2285 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 12 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 17:56:24] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-10 17:56:25] [INFO ] Implicit Places using invariants in 450 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 17:56:25] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 17:56:25] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 17:56:53] [INFO ] Implicit Places using invariants and state equation in 28400 ms returned []
Implicit Place search using SMT with State Equation took 28863 ms to find 0 implicit places.
[2023-03-10 17:56:53] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 17:56:53] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 17:56:53] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-00 in 155339 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-01
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:56:53] [INFO ] Computed 75 place invariants in 69 ms
Incomplete random walk after 10000 steps, including 1299 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:56:54] [INFO ] Computed 75 place invariants in 69 ms
[2023-03-10 17:56:54] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:56:54] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 30 ms returned sat
[2023-03-10 17:56:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:56:54] [INFO ] [Real]Absence check using state equation in 513 ms returned sat
[2023-03-10 17:56:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:56:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:56:54] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 44 ms returned sat
[2023-03-10 17:56:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:56:55] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2023-03-10 17:56:55] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:56:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 177 ms returned sat
[2023-03-10 17:56:55] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 47 ms.
[2023-03-10 17:56:56] [INFO ] Added : 65 causal constraints over 13 iterations in 900 ms. Result :sat
Minimization took 914 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
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 9 place count 454 transition count 455
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 441 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 132 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 17:56:57] [INFO ] Computed 75 place invariants in 45 ms
Incomplete random walk after 1000000 steps, including 129220 resets, run finished after 1290 ms. (steps per millisecond=775 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85533 resets, run finished after 782 ms. (steps per millisecond=1278 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 17:56:59] [INFO ] Computed 75 place invariants in 45 ms
[2023-03-10 17:56:59] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 17:57:00] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 37 ms returned sat
[2023-03-10 17:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:57:00] [INFO ] [Real]Absence check using state equation in 265 ms returned sat
[2023-03-10 17:57:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:57:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 17:57:00] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 50 ms returned sat
[2023-03-10 17:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:57:00] [INFO ] [Nat]Absence check using state equation in 269 ms returned sat
[2023-03-10 17:57:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 17:57:01] [INFO ] [Nat]Added 84 Read/Feed constraints in 418 ms returned sat
[2023-03-10 17:57:01] [INFO ] Computed and/alt/rep : 339/2205/339 causal constraints (skipped 105 transitions) in 59 ms.
[2023-03-10 17:57:03] [INFO ] Deduced a trap composed of 9 places in 510 ms of which 1 ms to minimize.
[2023-03-10 17:57:03] [INFO ] Deduced a trap composed of 12 places in 497 ms of which 1 ms to minimize.
[2023-03-10 17:57:04] [INFO ] Deduced a trap composed of 12 places in 449 ms of which 0 ms to minimize.
[2023-03-10 17:57:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1647 ms
[2023-03-10 17:57:04] [INFO ] Added : 77 causal constraints over 17 iterations in 3150 ms. Result :sat
Minimization took 728 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 18 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 19 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 17:57:05] [INFO ] Computed 75 place invariants in 76 ms
[2023-03-10 17:57:07] [INFO ] Implicit Places using invariants in 1793 ms returned [45, 51, 71, 76, 102, 122, 128, 149, 154, 155, 175, 204, 249]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1806 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 35 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 17:57:07] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-10 17:57:07] [INFO ] Implicit Places using invariants in 667 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 17:57:08] [INFO ] Invariants computation overflowed in 128 ms
[2023-03-10 17:57:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 17:57:35] [INFO ] Implicit Places using invariants and state equation in 27430 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 28112 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/441 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 22 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 17:57:35] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 17:57:35] [INFO ] Implicit Places using invariants in 457 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 17:57:35] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-10 17:57:36] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 17:58:05] [INFO ] Implicit Places using invariants and state equation in 30113 ms returned []
Implicit Place search using SMT with State Equation took 30585 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 17:58:05] [INFO ] Invariants computation overflowed in 36 ms
Incomplete random walk after 1000000 steps, including 144469 resets, run finished after 1237 ms. (steps per millisecond=808 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91410 resets, run finished after 720 ms. (steps per millisecond=1388 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 17:58:07] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 17:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:58:08] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2023-03-10 17:58:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:58:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:58:09] [INFO ] [Nat]Absence check using state equation in 990 ms returned sat
[2023-03-10 17:58:09] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 17:58:09] [INFO ] [Nat]Added 84 Read/Feed constraints in 166 ms returned sat
[2023-03-10 17:58:09] [INFO ] Computed and/alt/rep : 325/2163/325 causal constraints (skipped 108 transitions) in 37 ms.
[2023-03-10 17:58:24] [INFO ] Added : 240 causal constraints over 48 iterations in 14627 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 24 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 17:58:27] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 17:58:28] [INFO ] Implicit Places using invariants in 615 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 17:58:28] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-10 17:58:28] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 17:58:58] [INFO ] Performed 348/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 17:59:02] [INFO ] Implicit Places using invariants and state equation in 34629 ms returned []
Implicit Place search using SMT with State Equation took 35257 ms to find 0 implicit places.
[2023-03-10 17:59:02] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 17:59:02] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 17:59:03] [INFO ] Dead Transitions using invariants and state equation in 368 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-01 in 129206 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-02
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:59:03] [INFO ] Computed 75 place invariants in 80 ms
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 17:59:03] [INFO ] Computed 75 place invariants in 95 ms
[2023-03-10 17:59:03] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:59:03] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 37 ms returned sat
[2023-03-10 17:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:59:04] [INFO ] [Real]Absence check using state equation in 895 ms returned sat
[2023-03-10 17:59:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:59:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 17:59:04] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 48 ms returned sat
[2023-03-10 17:59:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:59:05] [INFO ] [Nat]Absence check using state equation in 638 ms returned sat
[2023-03-10 17:59:05] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 17:59:07] [INFO ] [Nat]Added 73 Read/Feed constraints in 1837 ms returned sat
[2023-03-10 17:59:07] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2023-03-10 17:59:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-10 17:59:07] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 48 ms.
1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
[2023-03-10 17:59:09] [INFO ] Deduced a trap composed of 3 places in 401 ms of which 1 ms to minimize.
[2023-03-10 17:59:09] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 446 transition count 450
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 446 transition count 445
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 441 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 116 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 17:59:10] [INFO ] Computed 75 place invariants in 88 ms
Incomplete random walk after 1000000 steps, including 129390 resets, run finished after 1454 ms. (steps per millisecond=687 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85159 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 17:59:12] [INFO ] Computed 75 place invariants in 52 ms
[2023-03-10 17:59:12] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:59:12] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 41 ms returned sat
[2023-03-10 17:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 17:59:12] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-03-10 17:59:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 17:59:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 17:59:13] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 17:59:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 17:59:13] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2023-03-10 17:59:13] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 17:59:13] [INFO ] [Nat]Added 84 Read/Feed constraints in 362 ms returned sat
[2023-03-10 17:59:13] [INFO ] Computed and/alt/rep : 341/2214/341 causal constraints (skipped 103 transitions) in 37 ms.
[2023-03-10 17:59:17] [INFO ] Added : 147 causal constraints over 30 iterations in 4074 ms. Result :sat
Minimization took 1043 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 17:59:20] [INFO ] Computed 75 place invariants in 53 ms
[2023-03-10 17:59:21] [INFO ] Implicit Places using invariants in 1250 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 204, 249]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1259 ms to find 12 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 429/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 429 transition count 437
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 421 transition count 437
Applied a total of 16 rules in 23 ms. Remains 421 /429 variables (removed 8) and now considering 437/445 (removed 8) transitions.
// Phase 1: matrix 437 rows 421 cols
[2023-03-10 17:59:21] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-10 17:59:22] [INFO ] Implicit Places using invariants in 584 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2023-03-10 17:59:22] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-10 17:59:22] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 17:59:44] [INFO ] Implicit Places using invariants and state equation in 21782 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 22368 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 420/441 places, 437/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 420 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 418 transition count 435
Applied a total of 4 rules in 21 ms. Remains 418 /420 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 17:59:44] [INFO ] Invariants computation overflowed in 89 ms
[2023-03-10 17:59:45] [INFO ] Implicit Places using invariants in 728 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 17:59:45] [INFO ] Invariants computation overflowed in 89 ms
[2023-03-10 17:59:45] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:00:13] [INFO ] Implicit Places using invariants and state equation in 28043 ms returned []
Implicit Place search using SMT with State Equation took 28785 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 418/441 places, 435/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 418/441 places, 435/445 transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:00:13] [INFO ] Invariants computation overflowed in 67 ms
Incomplete random walk after 1000000 steps, including 144198 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91323 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:00:15] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-10 18:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:00:15] [INFO ] [Real]Absence check using state equation in 563 ms returned sat
[2023-03-10 18:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:00:16] [INFO ] [Nat]Absence check using state equation in 568 ms returned sat
[2023-03-10 18:00:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:00:16] [INFO ] [Nat]Added 84 Read/Feed constraints in 446 ms returned sat
[2023-03-10 18:00:17] [INFO ] Deduced a trap composed of 105 places in 277 ms of which 1 ms to minimize.
[2023-03-10 18:00:17] [INFO ] Deduced a trap composed of 112 places in 438 ms of which 1 ms to minimize.
[2023-03-10 18:00:18] [INFO ] Deduced a trap composed of 116 places in 497 ms of which 1 ms to minimize.
[2023-03-10 18:00:18] [INFO ] Deduced a trap composed of 109 places in 492 ms of which 1 ms to minimize.
[2023-03-10 18:00:19] [INFO ] Deduced a trap composed of 110 places in 496 ms of which 1 ms to minimize.
[2023-03-10 18:00:20] [INFO ] Deduced a trap composed of 113 places in 501 ms of which 1 ms to minimize.
[2023-03-10 18:00:20] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 1 ms to minimize.
[2023-03-10 18:00:21] [INFO ] Deduced a trap composed of 12 places in 481 ms of which 1 ms to minimize.
[2023-03-10 18:00:21] [INFO ] Deduced a trap composed of 120 places in 489 ms of which 1 ms to minimize.
[2023-03-10 18:00:22] [INFO ] Deduced a trap composed of 130 places in 488 ms of which 1 ms to minimize.
[2023-03-10 18:00:22] [INFO ] Deduced a trap composed of 117 places in 486 ms of which 1 ms to minimize.
[2023-03-10 18:00:25] [INFO ] Deduced a trap composed of 117 places in 444 ms of which 1 ms to minimize.
[2023-03-10 18:00:25] [INFO ] Deduced a trap composed of 120 places in 445 ms of which 1 ms to minimize.
[2023-03-10 18:00:26] [INFO ] Deduced a trap composed of 133 places in 418 ms of which 1 ms to minimize.
[2023-03-10 18:00:26] [INFO ] Deduced a trap composed of 109 places in 429 ms of which 1 ms to minimize.
[2023-03-10 18:00:27] [INFO ] Deduced a trap composed of 113 places in 418 ms of which 1 ms to minimize.
[2023-03-10 18:00:27] [INFO ] Deduced a trap composed of 125 places in 459 ms of which 1 ms to minimize.
[2023-03-10 18:00:28] [INFO ] Deduced a trap composed of 119 places in 476 ms of which 1 ms to minimize.
[2023-03-10 18:00:28] [INFO ] Deduced a trap composed of 120 places in 446 ms of which 1 ms to minimize.
[2023-03-10 18:00:29] [INFO ] Deduced a trap composed of 113 places in 413 ms of which 1 ms to minimize.
[2023-03-10 18:00:29] [INFO ] Deduced a trap composed of 116 places in 421 ms of which 1 ms to minimize.
[2023-03-10 18:00:30] [INFO ] Deduced a trap composed of 14 places in 372 ms of which 1 ms to minimize.
[2023-03-10 18:00:30] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 1 ms to minimize.
[2023-03-10 18:00:30] [INFO ] Deduced a trap composed of 127 places in 379 ms of which 1 ms to minimize.
[2023-03-10 18:00:31] [INFO ] Deduced a trap composed of 126 places in 356 ms of which 1 ms to minimize.
[2023-03-10 18:00:31] [INFO ] Deduced a trap composed of 16 places in 346 ms of which 1 ms to minimize.
[2023-03-10 18:00:32] [INFO ] Deduced a trap composed of 136 places in 297 ms of which 1 ms to minimize.
[2023-03-10 18:00:33] [INFO ] Deduced a trap composed of 138 places in 419 ms of which 1 ms to minimize.
[2023-03-10 18:00:34] [INFO ] Deduced a trap composed of 129 places in 391 ms of which 1 ms to minimize.
[2023-03-10 18:00:35] [INFO ] Deduced a trap composed of 129 places in 445 ms of which 1 ms to minimize.
[2023-03-10 18:00:35] [INFO ] Deduced a trap composed of 134 places in 418 ms of which 1 ms to minimize.
[2023-03-10 18:00:36] [INFO ] Deduced a trap composed of 133 places in 406 ms of which 1 ms to minimize.
[2023-03-10 18:00:36] [INFO ] Deduced a trap composed of 16 places in 398 ms of which 1 ms to minimize.
[2023-03-10 18:00:38] [INFO ] Deduced a trap composed of 127 places in 257 ms of which 0 ms to minimize.
[2023-03-10 18:00:38] [INFO ] Deduced a trap composed of 122 places in 297 ms of which 1 ms to minimize.
[2023-03-10 18:00:38] [INFO ] Deduced a trap composed of 128 places in 495 ms of which 1 ms to minimize.
[2023-03-10 18:00:39] [INFO ] Deduced a trap composed of 124 places in 481 ms of which 1 ms to minimize.
[2023-03-10 18:00:40] [INFO ] Deduced a trap composed of 129 places in 488 ms of which 1 ms to minimize.
[2023-03-10 18:00:41] [INFO ] Deduced a trap composed of 123 places in 507 ms of which 1 ms to minimize.
[2023-03-10 18:00:41] [INFO ] Deduced a trap composed of 131 places in 435 ms of which 1 ms to minimize.
[2023-03-10 18:00:41] [INFO ] Deduced a trap composed of 126 places in 364 ms of which 1 ms to minimize.
[2023-03-10 18:00:42] [INFO ] Deduced a trap composed of 128 places in 486 ms of which 1 ms to minimize.
[2023-03-10 18:00:42] [INFO ] Deduced a trap composed of 120 places in 438 ms of which 1 ms to minimize.
[2023-03-10 18:00:43] [INFO ] Deduced a trap composed of 134 places in 469 ms of which 1 ms to minimize.
[2023-03-10 18:00:43] [INFO ] Deduced a trap composed of 126 places in 488 ms of which 1 ms to minimize.
[2023-03-10 18:00:44] [INFO ] Deduced a trap composed of 15 places in 468 ms of which 1 ms to minimize.
[2023-03-10 18:00:46] [INFO ] Deduced a trap composed of 121 places in 314 ms of which 1 ms to minimize.
[2023-03-10 18:00:47] [INFO ] Deduced a trap composed of 132 places in 430 ms of which 1 ms to minimize.
[2023-03-10 18:00:47] [INFO ] Deduced a trap composed of 125 places in 309 ms of which 0 ms to minimize.
[2023-03-10 18:00:48] [INFO ] Deduced a trap composed of 130 places in 433 ms of which 1 ms to minimize.
[2023-03-10 18:00:48] [INFO ] Deduced a trap composed of 125 places in 436 ms of which 1 ms to minimize.
[2023-03-10 18:00:49] [INFO ] Deduced a trap composed of 126 places in 434 ms of which 1 ms to minimize.
[2023-03-10 18:00:49] [INFO ] Deduced a trap composed of 122 places in 435 ms of which 1 ms to minimize.
[2023-03-10 18:00:50] [INFO ] Deduced a trap composed of 117 places in 437 ms of which 1 ms to minimize.
[2023-03-10 18:00:50] [INFO ] Deduced a trap composed of 127 places in 466 ms of which 1 ms to minimize.
[2023-03-10 18:00:51] [INFO ] Deduced a trap composed of 127 places in 475 ms of which 1 ms to minimize.
[2023-03-10 18:00:51] [INFO ] Deduced a trap composed of 123 places in 461 ms of which 1 ms to minimize.
[2023-03-10 18:00:52] [INFO ] Deduced a trap composed of 122 places in 445 ms of which 1 ms to minimize.
[2023-03-10 18:00:52] [INFO ] Deduced a trap composed of 128 places in 446 ms of which 1 ms to minimize.
[2023-03-10 18:00:53] [INFO ] Deduced a trap composed of 122 places in 415 ms of which 1 ms to minimize.
[2023-03-10 18:00:53] [INFO ] Deduced a trap composed of 127 places in 447 ms of which 1 ms to minimize.
[2023-03-10 18:00:54] [INFO ] Deduced a trap composed of 121 places in 463 ms of which 1 ms to minimize.
[2023-03-10 18:00:54] [INFO ] Deduced a trap composed of 134 places in 421 ms of which 2 ms to minimize.
[2023-03-10 18:00:54] [INFO ] Deduced a trap composed of 139 places in 382 ms of which 1 ms to minimize.
[2023-03-10 18:00:55] [INFO ] Deduced a trap composed of 19 places in 382 ms of which 1 ms to minimize.
[2023-03-10 18:00:58] [INFO ] Trap strengthening (SAT) tested/added 65/65 trap constraints in 41453 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 16 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 15 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:00:58] [INFO ] Invariants computation overflowed in 67 ms
[2023-03-10 18:00:59] [INFO ] Implicit Places using invariants in 769 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:00:59] [INFO ] Invariants computation overflowed in 106 ms
[2023-03-10 18:01:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:01:29] [INFO ] Implicit Places using invariants and state equation in 29974 ms returned []
Implicit Place search using SMT with State Equation took 30746 ms to find 0 implicit places.
[2023-03-10 18:01:29] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:01:29] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-10 18:01:30] [INFO ] Dead Transitions using invariants and state equation in 595 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-02 in 147129 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-03
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:01:30] [INFO ] Computed 75 place invariants in 137 ms
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 871 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:01:30] [INFO ] Computed 75 place invariants in 133 ms
[2023-03-10 18:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:01:30] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 48 ms returned sat
[2023-03-10 18:01:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:01:31] [INFO ] [Real]Absence check using state equation in 329 ms returned sat
[2023-03-10 18:01:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:01:31] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 51 ms returned sat
[2023-03-10 18:01:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:01:31] [INFO ] [Nat]Absence check using state equation in 318 ms returned sat
[2023-03-10 18:01:31] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:01:31] [INFO ] [Nat]Added 73 Read/Feed constraints in 68 ms returned sat
[2023-03-10 18:01:32] [INFO ] Deduced a trap composed of 14 places in 323 ms of which 1 ms to minimize.
[2023-03-10 18:01:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 403 ms
[2023-03-10 18:01:32] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 64 ms.
[2023-03-10 18:01:32] [INFO ] Added : 55 causal constraints over 11 iterations in 765 ms. Result :sat
Minimization took 1498 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions 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 4 place count 457 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 456 transition count 456
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 7 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 441 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 67 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:01:34] [INFO ] Computed 75 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 129368 resets, run finished after 1283 ms. (steps per millisecond=779 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85488 resets, run finished after 777 ms. (steps per millisecond=1287 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:01:36] [INFO ] Computed 75 place invariants in 55 ms
[2023-03-10 18:01:36] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-10 18:01:36] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 48 ms returned sat
[2023-03-10 18:01:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:01:37] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-10 18:01:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:01:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-10 18:01:37] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 46 ms returned sat
[2023-03-10 18:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:01:37] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2023-03-10 18:01:37] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-10 18:01:38] [INFO ] [Nat]Added 83 Read/Feed constraints in 159 ms returned sat
[2023-03-10 18:01:38] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 1 ms to minimize.
[2023-03-10 18:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 451 ms
[2023-03-10 18:01:38] [INFO ] Computed and/alt/rep : 338/2210/338 causal constraints (skipped 106 transitions) in 46 ms.
[2023-03-10 18:01:39] [INFO ] Added : 68 causal constraints over 14 iterations in 808 ms. Result :sat
Minimization took 864 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 18 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 18 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:01:40] [INFO ] Computed 75 place invariants in 91 ms
[2023-03-10 18:01:42] [INFO ] Implicit Places using invariants in 1695 ms returned [45, 51, 72, 77, 102, 122, 128, 149, 154, 155, 175, 204, 249]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1705 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 22 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:01:42] [INFO ] Invariants computation overflowed in 85 ms
[2023-03-10 18:01:42] [INFO ] Implicit Places using invariants in 753 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:01:42] [INFO ] Invariants computation overflowed in 92 ms
[2023-03-10 18:01:43] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-10 18:02:13] [INFO ] Performed 418/419 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-10 18:02:13] [INFO ] Implicit Places using invariants and state equation in 30756 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31514 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/441 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 19 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:02:13] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-10 18:02:14] [INFO ] Implicit Places using invariants in 651 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:02:14] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-10 18:02:14] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-10 18:02:42] [INFO ] Implicit Places using invariants and state equation in 28317 ms returned []
Implicit Place search using SMT with State Equation took 28970 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:02:42] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 144211 resets, run finished after 1338 ms. (steps per millisecond=747 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91314 resets, run finished after 899 ms. (steps per millisecond=1112 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:02:44] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-10 18:02:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:02:45] [INFO ] [Real]Absence check using state equation in 906 ms returned sat
[2023-03-10 18:02:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:02:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:02:46] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2023-03-10 18:02:46] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-10 18:02:47] [INFO ] [Nat]Added 83 Read/Feed constraints in 647 ms returned sat
[2023-03-10 18:02:47] [INFO ] Computed and/alt/rep : 324/2168/324 causal constraints (skipped 109 transitions) in 68 ms.
[2023-03-10 18:02:48] [INFO ] Deduced a trap composed of 8 places in 322 ms of which 1 ms to minimize.
[2023-03-10 18:02:48] [INFO ] Deduced a trap composed of 10 places in 332 ms of which 1 ms to minimize.
[2023-03-10 18:02:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 770 ms
[2023-03-10 18:02:48] [INFO ] Added : 48 causal constraints over 10 iterations in 1280 ms. Result :sat
Minimization took 1378 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 13 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 14 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:02:50] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-10 18:02:51] [INFO ] Implicit Places using invariants in 712 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:02:51] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-10 18:02:51] [INFO ] State equation strengthened by 83 read => feed constraints.
[2023-03-10 18:03:21] [INFO ] Implicit Places using invariants and state equation in 30005 ms returned []
Implicit Place search using SMT with State Equation took 30728 ms to find 0 implicit places.
[2023-03-10 18:03:21] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:03:21] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-10 18:03:21] [INFO ] Dead Transitions using invariants and state equation in 408 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-03 in 111234 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-04
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:03:21] [INFO ] Computed 75 place invariants in 123 ms
Incomplete random walk after 10000 steps, including 1306 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 841 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:03:21] [INFO ] Computed 75 place invariants in 123 ms
[2023-03-10 18:03:21] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 18:03:21] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 18:03:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:03:22] [INFO ] [Real]Absence check using state equation in 543 ms returned sat
[2023-03-10 18:03:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:03:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:03:22] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 30 ms returned sat
[2023-03-10 18:03:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:03:23] [INFO ] [Nat]Absence check using state equation in 596 ms returned sat
[2023-03-10 18:03:23] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:03:24] [INFO ] [Nat]Added 73 Read/Feed constraints in 1747 ms returned sat
[2023-03-10 18:03:25] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2023-03-10 18:03:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2023-03-10 18:03:25] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-10 18:03:27] [INFO ] Added : 80 causal constraints over 16 iterations in 2432 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 454 transition count 455
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 441 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 106 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:03:27] [INFO ] Computed 75 place invariants in 74 ms
Incomplete random walk after 1000000 steps, including 129575 resets, run finished after 1291 ms. (steps per millisecond=774 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85184 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:03:29] [INFO ] Computed 75 place invariants in 80 ms
[2023-03-10 18:03:30] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 18:03:30] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 45 ms returned sat
[2023-03-10 18:03:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:03:30] [INFO ] [Real]Absence check using state equation in 621 ms returned sat
[2023-03-10 18:03:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:03:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 18:03:30] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 44 ms returned sat
[2023-03-10 18:03:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:03:31] [INFO ] [Nat]Absence check using state equation in 618 ms returned sat
[2023-03-10 18:03:31] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:03:32] [INFO ] [Nat]Added 84 Read/Feed constraints in 748 ms returned sat
[2023-03-10 18:03:32] [INFO ] Computed and/alt/rep : 338/2195/338 causal constraints (skipped 106 transitions) in 53 ms.
[2023-03-10 18:03:43] [INFO ] Deduced a trap composed of 13 places in 297 ms of which 15 ms to minimize.
[2023-03-10 18:03:43] [INFO ] Deduced a trap composed of 12 places in 382 ms of which 1 ms to minimize.
[2023-03-10 18:03:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 895 ms
[2023-03-10 18:03:44] [INFO ] Added : 247 causal constraints over 50 iterations in 11916 ms. Result :sat
Minimization took 2421 ms.
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:04:16] [INFO ] Computed 75 place invariants in 48 ms
[2023-03-10 18:04:18] [INFO ] Implicit Places using invariants in 1525 ms returned [46, 52, 72, 77, 102, 122, 128, 149, 154, 155, 175, 204, 249]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1530 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 31 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:04:18] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-10 18:04:18] [INFO ] Implicit Places using invariants in 732 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:04:19] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-10 18:04:19] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:04:49] [INFO ] Performed 416/419 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-10 18:04:49] [INFO ] Implicit Places using invariants and state equation in 30622 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31368 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/441 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 19 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:04:49] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-10 18:04:50] [INFO ] Implicit Places using invariants in 531 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:04:50] [INFO ] Invariants computation overflowed in 43 ms
[2023-03-10 18:04:50] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:05:20] [INFO ] Implicit Places using invariants and state equation in 30215 ms returned []
Implicit Place search using SMT with State Equation took 30748 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:05:20] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 144507 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91382 resets, run finished after 716 ms. (steps per millisecond=1396 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:05:22] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 18:05:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:05:22] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-10 18:05:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:05:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:05:23] [INFO ] [Nat]Absence check using state equation in 601 ms returned sat
[2023-03-10 18:05:23] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:05:24] [INFO ] [Nat]Added 84 Read/Feed constraints in 857 ms returned sat
[2023-03-10 18:05:24] [INFO ] Computed and/alt/rep : 324/2153/324 causal constraints (skipped 109 transitions) in 33 ms.
[2023-03-10 18:05:34] [INFO ] Added : 255 causal constraints over 51 iterations in 10043 ms. Result :sat
Minimization took 2633 ms.
Current structural bounds on expressions (after SMT) : [2] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:05:53] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 18:05:53] [INFO ] Implicit Places using invariants in 486 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:05:53] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-10 18:05:54] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:06:20] [INFO ] Implicit Places using invariants and state equation in 27076 ms returned []
Implicit Place search using SMT with State Equation took 27572 ms to find 0 implicit places.
[2023-03-10 18:06:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:06:20] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-10 18:06:21] [INFO ] Dead Transitions using invariants and state equation in 325 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-04 in 179789 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-05
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:06:21] [INFO ] Computed 75 place invariants in 125 ms
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 831 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:06:21] [INFO ] Computed 75 place invariants in 133 ms
[2023-03-10 18:06:21] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:06:21] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 47 ms returned sat
[2023-03-10 18:06:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:06:22] [INFO ] [Real]Absence check using state equation in 547 ms returned sat
[2023-03-10 18:06:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:06:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:06:22] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 18:06:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:06:22] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2023-03-10 18:06:22] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:06:23] [INFO ] [Nat]Added 73 Read/Feed constraints in 864 ms returned sat
[2023-03-10 18:06:23] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-10 18:06:27] [INFO ] Added : 95 causal constraints over 19 iterations in 3464 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 446 transition count 450
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 30 place count 446 transition count 445
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 441 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 106 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:06:27] [INFO ] Computed 75 place invariants in 81 ms
Incomplete random walk after 1000000 steps, including 129532 resets, run finished after 1398 ms. (steps per millisecond=715 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84981 resets, run finished after 797 ms. (steps per millisecond=1254 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:06:30] [INFO ] Computed 75 place invariants in 52 ms
[2023-03-10 18:06:30] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 18:06:30] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 30 ms returned sat
[2023-03-10 18:06:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:06:30] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2023-03-10 18:06:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:06:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 18:06:30] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 46 ms returned sat
[2023-03-10 18:06:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:06:31] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-03-10 18:06:31] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:06:31] [INFO ] [Nat]Added 84 Read/Feed constraints in 111 ms returned sat
[2023-03-10 18:06:31] [INFO ] Computed and/alt/rep : 341/2214/341 causal constraints (skipped 103 transitions) in 35 ms.
[2023-03-10 18:06:33] [INFO ] Deduced a trap composed of 8 places in 456 ms of which 1 ms to minimize.
[2023-03-10 18:06:33] [INFO ] Deduced a trap composed of 15 places in 428 ms of which 1 ms to minimize.
[2023-03-10 18:06:34] [INFO ] Deduced a trap composed of 8 places in 481 ms of which 1 ms to minimize.
[2023-03-10 18:06:34] [INFO ] Deduced a trap composed of 129 places in 445 ms of which 1 ms to minimize.
[2023-03-10 18:06:35] [INFO ] Deduced a trap composed of 18 places in 350 ms of which 1 ms to minimize.
[2023-03-10 18:06:35] [INFO ] Deduced a trap composed of 117 places in 518 ms of which 1 ms to minimize.
[2023-03-10 18:06:36] [INFO ] Deduced a trap composed of 20 places in 324 ms of which 1 ms to minimize.
[2023-03-10 18:06:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3472 ms
[2023-03-10 18:06:36] [INFO ] Added : 109 causal constraints over 22 iterations in 4864 ms. Result :sat
Minimization took 927 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 10 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:06:38] [INFO ] Computed 75 place invariants in 59 ms
[2023-03-10 18:06:39] [INFO ] Implicit Places using invariants in 1698 ms returned [45, 51, 71, 76, 101, 128, 149, 154, 155, 175, 204, 249]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1699 ms to find 12 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 429/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 429 transition count 437
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 421 transition count 437
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 421 transition count 437
Applied a total of 17 rules in 45 ms. Remains 421 /429 variables (removed 8) and now considering 437/445 (removed 8) transitions.
// Phase 1: matrix 437 rows 421 cols
[2023-03-10 18:06:39] [INFO ] Invariants computation overflowed in 45 ms
[2023-03-10 18:06:40] [INFO ] Implicit Places using invariants in 782 ms returned []
// Phase 1: matrix 437 rows 421 cols
[2023-03-10 18:06:40] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-10 18:06:41] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:06:55] [INFO ] Implicit Places using invariants and state equation in 14641 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 15424 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 420/441 places, 437/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 420 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 418 transition count 435
Applied a total of 4 rules in 19 ms. Remains 418 /420 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:06:55] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-10 18:06:55] [INFO ] Implicit Places using invariants in 640 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:06:55] [INFO ] Invariants computation overflowed in 46 ms
[2023-03-10 18:06:56] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:07:25] [INFO ] Implicit Places using invariants and state equation in 29713 ms returned []
Implicit Place search using SMT with State Equation took 30354 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 418/441 places, 435/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 418/441 places, 435/445 transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:07:25] [INFO ] Invariants computation overflowed in 40 ms
Incomplete random walk after 1000000 steps, including 144121 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91150 resets, run finished after 906 ms. (steps per millisecond=1103 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:07:27] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-10 18:07:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:07:28] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2023-03-10 18:07:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:07:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:07:28] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2023-03-10 18:07:28] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:07:29] [INFO ] [Nat]Added 84 Read/Feed constraints in 344 ms returned sat
[2023-03-10 18:07:29] [INFO ] Deduced a trap composed of 134 places in 499 ms of which 1 ms to minimize.
[2023-03-10 18:07:30] [INFO ] Deduced a trap composed of 97 places in 263 ms of which 1 ms to minimize.
[2023-03-10 18:07:31] [INFO ] Deduced a trap composed of 110 places in 323 ms of which 1 ms to minimize.
[2023-03-10 18:07:31] [INFO ] Deduced a trap composed of 112 places in 434 ms of which 1 ms to minimize.
[2023-03-10 18:07:32] [INFO ] Deduced a trap composed of 123 places in 489 ms of which 1 ms to minimize.
[2023-03-10 18:07:33] [INFO ] Deduced a trap composed of 13 places in 445 ms of which 0 ms to minimize.
[2023-03-10 18:07:33] [INFO ] Deduced a trap composed of 9 places in 413 ms of which 1 ms to minimize.
[2023-03-10 18:07:34] [INFO ] Deduced a trap composed of 122 places in 366 ms of which 1 ms to minimize.
[2023-03-10 18:07:37] [INFO ] Trap strengthening (SAT) tested/added 8/8 trap constraints in 7998 ms
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 8 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:07:37] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-10 18:07:37] [INFO ] Implicit Places using invariants in 453 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:07:37] [INFO ] Invariants computation overflowed in 28 ms
[2023-03-10 18:07:37] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:08:08] [INFO ] Performed 410/418 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 18:08:08] [INFO ] Implicit Places using invariants and state equation in 30824 ms returned []
Implicit Place search using SMT with State Equation took 31301 ms to find 0 implicit places.
[2023-03-10 18:08:08] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:08:08] [INFO ] Invariants computation overflowed in 27 ms
[2023-03-10 18:08:08] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-05 in 107564 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-06
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:08:08] [INFO ] Computed 75 place invariants in 79 ms
Incomplete random walk after 10000 steps, including 1292 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 851 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:08:09] [INFO ] Computed 75 place invariants in 79 ms
[2023-03-10 18:08:09] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:08:09] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 32 ms returned sat
[2023-03-10 18:08:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:08:09] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2023-03-10 18:08:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:08:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:08:09] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 44 ms returned sat
[2023-03-10 18:08:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:08:10] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2023-03-10 18:08:10] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:08:11] [INFO ] [Nat]Added 73 Read/Feed constraints in 1515 ms returned sat
[2023-03-10 18:08:11] [INFO ] Deduced a trap composed of 17 places in 178 ms of which 0 ms to minimize.
[2023-03-10 18:08:12] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 1 ms to minimize.
[2023-03-10 18:08:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 483 ms
[2023-03-10 18:08:12] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 35 ms.
[2023-03-10 18:08:14] [INFO ] Added : 70 causal constraints over 14 iterations in 2361 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 448 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 448 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 447 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 441 transition count 444
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 39 place count 441 transition count 444
Applied a total of 39 rules in 114 ms. Remains 441 /459 variables (removed 18) and now considering 444/460 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 444/460 transitions.
// Phase 1: matrix 444 rows 441 cols
[2023-03-10 18:08:14] [INFO ] Computed 75 place invariants in 90 ms
Incomplete random walk after 1000000 steps, including 129465 resets, run finished after 1203 ms. (steps per millisecond=831 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85106 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 441 cols
[2023-03-10 18:08:17] [INFO ] Computed 75 place invariants in 53 ms
[2023-03-10 18:08:17] [INFO ] [Real]Absence check using 9 positive place invariants in 11 ms returned sat
[2023-03-10 18:08:17] [INFO ] [Real]Absence check using 9 positive and 66 generalized place invariants in 36 ms returned sat
[2023-03-10 18:08:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:08:17] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2023-03-10 18:08:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:08:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 13 ms returned sat
[2023-03-10 18:08:17] [INFO ] [Nat]Absence check using 9 positive and 66 generalized place invariants in 40 ms returned sat
[2023-03-10 18:08:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:08:17] [INFO ] [Nat]Absence check using state equation in 443 ms returned sat
[2023-03-10 18:08:17] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 18:08:18] [INFO ] [Nat]Added 80 Read/Feed constraints in 643 ms returned sat
[2023-03-10 18:08:18] [INFO ] Computed and/alt/rep : 344/2209/344 causal constraints (skipped 99 transitions) in 34 ms.
[2023-03-10 18:08:24] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 1 ms to minimize.
[2023-03-10 18:08:24] [INFO ] Deduced a trap composed of 21 places in 246 ms of which 1 ms to minimize.
[2023-03-10 18:08:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 679 ms
[2023-03-10 18:08:24] [INFO ] Added : 153 causal constraints over 31 iterations in 5973 ms. Result :sat
Minimization took 1876 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 444/444 transitions.
Applied a total of 0 rules in 16 ms. Remains 441 /441 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 444/444 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 444/444 transitions.
Applied a total of 0 rules in 16 ms. Remains 441 /441 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 441 cols
[2023-03-10 18:08:34] [INFO ] Computed 75 place invariants in 93 ms
[2023-03-10 18:08:35] [INFO ] Implicit Places using invariants in 1764 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 174, 203, 249]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1768 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 428/441 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 428 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 420 transition count 436
Applied a total of 16 rules in 34 ms. Remains 420 /428 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 420 cols
[2023-03-10 18:08:36] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-10 18:08:36] [INFO ] Implicit Places using invariants in 725 ms returned []
// Phase 1: matrix 436 rows 420 cols
[2023-03-10 18:08:36] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-10 18:08:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 18:09:05] [INFO ] Implicit Places using invariants and state equation in 29297 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30035 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/441 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 434
Applied a total of 4 rules in 19 ms. Remains 417 /419 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:09:06] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-10 18:09:06] [INFO ] Implicit Places using invariants in 528 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:09:06] [INFO ] Invariants computation overflowed in 128 ms
[2023-03-10 18:09:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 18:09:27] [INFO ] Implicit Places using invariants and state equation in 21193 ms returned []
Implicit Place search using SMT with State Equation took 21738 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 417/441 places, 434/444 transitions.
Finished structural reductions, in 3 iterations. Remains : 417/441 places, 434/444 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:09:27] [INFO ] Invariants computation overflowed in 89 ms
Incomplete random walk after 1000000 steps, including 144269 resets, run finished after 1563 ms. (steps per millisecond=639 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91462 resets, run finished after 747 ms. (steps per millisecond=1338 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:09:30] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-10 18:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:09:30] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-10 18:09:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:09:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:09:30] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-10 18:09:30] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 18:09:32] [INFO ] [Nat]Added 80 Read/Feed constraints in 1382 ms returned sat
[2023-03-10 18:09:32] [INFO ] Deduced a trap composed of 12 places in 242 ms of which 0 ms to minimize.
[2023-03-10 18:09:32] [INFO ] Deduced a trap composed of 109 places in 336 ms of which 1 ms to minimize.
[2023-03-10 18:09:33] [INFO ] Deduced a trap composed of 112 places in 342 ms of which 1 ms to minimize.
[2023-03-10 18:09:33] [INFO ] Deduced a trap composed of 16 places in 406 ms of which 1 ms to minimize.
[2023-03-10 18:09:34] [INFO ] Deduced a trap composed of 117 places in 465 ms of which 1 ms to minimize.
[2023-03-10 18:09:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1955 ms
[2023-03-10 18:09:34] [INFO ] Computed and/alt/rep : 332/2179/332 causal constraints (skipped 101 transitions) in 55 ms.
[2023-03-10 18:09:42] [INFO ] Deduced a trap composed of 121 places in 426 ms of which 1 ms to minimize.
[2023-03-10 18:09:43] [INFO ] Deduced a trap composed of 13 places in 469 ms of which 1 ms to minimize.
[2023-03-10 18:09:43] [INFO ] Deduced a trap composed of 129 places in 440 ms of which 1 ms to minimize.
[2023-03-10 18:09:44] [INFO ] Deduced a trap composed of 130 places in 426 ms of which 1 ms to minimize.
[2023-03-10 18:09:44] [INFO ] Deduced a trap composed of 127 places in 428 ms of which 0 ms to minimize.
[2023-03-10 18:09:45] [INFO ] Deduced a trap composed of 123 places in 422 ms of which 1 ms to minimize.
[2023-03-10 18:09:45] [INFO ] Deduced a trap composed of 15 places in 426 ms of which 0 ms to minimize.
[2023-03-10 18:09:46] [INFO ] Deduced a trap composed of 16 places in 450 ms of which 1 ms to minimize.
[2023-03-10 18:09:46] [INFO ] Deduced a trap composed of 19 places in 492 ms of which 1 ms to minimize.
[2023-03-10 18:09:47] [INFO ] Deduced a trap composed of 134 places in 488 ms of which 1 ms to minimize.
[2023-03-10 18:09:47] [INFO ] Deduced a trap composed of 127 places in 471 ms of which 1 ms to minimize.
[2023-03-10 18:09:48] [INFO ] Deduced a trap composed of 24 places in 436 ms of which 1 ms to minimize.
[2023-03-10 18:09:48] [INFO ] Deduced a trap composed of 102 places in 414 ms of which 1 ms to minimize.
[2023-03-10 18:09:49] [INFO ] Deduced a trap composed of 128 places in 285 ms of which 1 ms to minimize.
[2023-03-10 18:09:50] [INFO ] Deduced a trap composed of 135 places in 289 ms of which 0 ms to minimize.
[2023-03-10 18:09:50] [INFO ] Deduced a trap composed of 134 places in 275 ms of which 1 ms to minimize.
[2023-03-10 18:09:50] [INFO ] Deduced a trap composed of 138 places in 279 ms of which 1 ms to minimize.
[2023-03-10 18:09:51] [INFO ] Deduced a trap composed of 138 places in 286 ms of which 0 ms to minimize.
[2023-03-10 18:09:51] [INFO ] Deduced a trap composed of 133 places in 391 ms of which 1 ms to minimize.
[2023-03-10 18:09:52] [INFO ] Deduced a trap composed of 131 places in 387 ms of which 1 ms to minimize.
[2023-03-10 18:09:52] [INFO ] Deduced a trap composed of 127 places in 379 ms of which 1 ms to minimize.
[2023-03-10 18:09:53] [INFO ] Deduced a trap composed of 136 places in 453 ms of which 1 ms to minimize.
[2023-03-10 18:09:53] [INFO ] Deduced a trap composed of 139 places in 487 ms of which 1 ms to minimize.
[2023-03-10 18:09:54] [INFO ] Deduced a trap composed of 133 places in 446 ms of which 1 ms to minimize.
[2023-03-10 18:09:54] [INFO ] Deduced a trap composed of 123 places in 428 ms of which 1 ms to minimize.
[2023-03-10 18:09:55] [INFO ] Deduced a trap composed of 121 places in 469 ms of which 0 ms to minimize.
[2023-03-10 18:09:55] [INFO ] Deduced a trap composed of 123 places in 443 ms of which 1 ms to minimize.
[2023-03-10 18:09:56] [INFO ] Deduced a trap composed of 131 places in 429 ms of which 1 ms to minimize.
[2023-03-10 18:09:56] [INFO ] Deduced a trap composed of 134 places in 437 ms of which 1 ms to minimize.
[2023-03-10 18:09:57] [INFO ] Deduced a trap composed of 127 places in 439 ms of which 1 ms to minimize.
[2023-03-10 18:09:57] [INFO ] Deduced a trap composed of 125 places in 461 ms of which 0 ms to minimize.
[2023-03-10 18:09:58] [INFO ] Deduced a trap composed of 125 places in 462 ms of which 1 ms to minimize.
[2023-03-10 18:09:58] [INFO ] Deduced a trap composed of 133 places in 436 ms of which 1 ms to minimize.
[2023-03-10 18:09:59] [INFO ] Deduced a trap composed of 130 places in 412 ms of which 0 ms to minimize.
[2023-03-10 18:09:59] [INFO ] Deduced a trap composed of 127 places in 411 ms of which 0 ms to minimize.
[2023-03-10 18:10:00] [INFO ] Deduced a trap composed of 145 places in 379 ms of which 1 ms to minimize.
[2023-03-10 18:10:00] [INFO ] Deduced a trap composed of 143 places in 412 ms of which 0 ms to minimize.
[2023-03-10 18:10:01] [INFO ] Deduced a trap composed of 128 places in 458 ms of which 1 ms to minimize.
[2023-03-10 18:10:01] [INFO ] Deduced a trap composed of 99 places in 450 ms of which 1 ms to minimize.
[2023-03-10 18:10:02] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 1 ms to minimize.
[2023-03-10 18:10:02] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 20605 ms
[2023-03-10 18:10:02] [INFO ] Added : 156 causal constraints over 33 iterations in 28591 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:10:06] [INFO ] Invariants computation overflowed in 79 ms
[2023-03-10 18:10:06] [INFO ] Implicit Places using invariants in 610 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:10:06] [INFO ] Invariants computation overflowed in 75 ms
[2023-03-10 18:10:06] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-10 18:10:34] [INFO ] Implicit Places using invariants and state equation in 28375 ms returned []
Implicit Place search using SMT with State Equation took 28998 ms to find 0 implicit places.
[2023-03-10 18:10:34] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:10:34] [INFO ] Invariants computation overflowed in 68 ms
[2023-03-10 18:10:35] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-06 in 146474 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-07
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:10:35] [INFO ] Computed 75 place invariants in 92 ms
Incomplete random walk after 10000 steps, including 1304 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:10:35] [INFO ] Computed 75 place invariants in 90 ms
[2023-03-10 18:10:35] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:10:35] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-10 18:10:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:10:36] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2023-03-10 18:10:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:10:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 18:10:36] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 39 ms returned sat
[2023-03-10 18:10:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:10:36] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-03-10 18:10:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:10:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 698 ms returned sat
[2023-03-10 18:10:37] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 40 ms.
[2023-03-10 18:10:41] [INFO ] Deduced a trap composed of 3 places in 435 ms of which 1 ms to minimize.
[2023-03-10 18:10:41] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions 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 4 place count 457 transition count 457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 456 transition count 456
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 15 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 28 place count 447 transition count 446
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 33 place count 442 transition count 446
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 40 place count 442 transition count 446
Applied a total of 40 rules in 138 ms. Remains 442 /459 variables (removed 17) and now considering 446/460 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/459 places, 446/460 transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-10 18:10:41] [INFO ] Computed 75 place invariants in 89 ms
Incomplete random walk after 1000000 steps, including 129251 resets, run finished after 1443 ms. (steps per millisecond=693 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85246 resets, run finished after 771 ms. (steps per millisecond=1297 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 442 cols
[2023-03-10 18:10:44] [INFO ] Computed 75 place invariants in 52 ms
[2023-03-10 18:10:44] [INFO ] [Real]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-10 18:10:44] [INFO ] [Real]Absence check using 7 positive and 68 generalized place invariants in 38 ms returned sat
[2023-03-10 18:10:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:10:44] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-03-10 18:10:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:10:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-10 18:10:44] [INFO ] [Nat]Absence check using 7 positive and 68 generalized place invariants in 43 ms returned sat
[2023-03-10 18:10:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:10:45] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2023-03-10 18:10:45] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:10:45] [INFO ] [Nat]Added 84 Read/Feed constraints in 560 ms returned sat
[2023-03-10 18:10:45] [INFO ] Computed and/alt/rep : 339/2208/339 causal constraints (skipped 106 transitions) in 53 ms.
[2023-03-10 18:10:51] [INFO ] Deduced a trap composed of 8 places in 267 ms of which 1 ms to minimize.
[2023-03-10 18:10:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 356 ms
[2023-03-10 18:10:51] [INFO ] Added : 173 causal constraints over 35 iterations in 5526 ms. Result :sat
Minimization took 1301 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/442 places, 446/446 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 10 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-10 18:11:22] [INFO ] Computed 75 place invariants in 52 ms
[2023-03-10 18:11:24] [INFO ] Implicit Places using invariants in 1714 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 174, 203, 248]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1720 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 429/442 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 437
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 437
Applied a total of 18 rules in 35 ms. Remains 420 /429 variables (removed 9) and now considering 437/446 (removed 9) transitions.
// Phase 1: matrix 437 rows 420 cols
[2023-03-10 18:11:24] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-10 18:11:25] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 437 rows 420 cols
[2023-03-10 18:11:25] [INFO ] Invariants computation overflowed in 59 ms
[2023-03-10 18:11:25] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:11:56] [INFO ] Performed 418/420 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-10 18:11:56] [INFO ] Implicit Places using invariants and state equation in 31051 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31782 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/442 places, 437/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 435
Applied a total of 4 rules in 28 ms. Remains 417 /419 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:11:56] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:11:56] [INFO ] Implicit Places using invariants in 463 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:11:56] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:11:56] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:12:26] [INFO ] Implicit Places using invariants and state equation in 29791 ms returned []
Implicit Place search using SMT with State Equation took 30271 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 417/442 places, 435/446 transitions.
Finished structural reductions, in 3 iterations. Remains : 417/442 places, 435/446 transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:12:26] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144249 resets, run finished after 1054 ms. (steps per millisecond=948 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91616 resets, run finished after 855 ms. (steps per millisecond=1169 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:12:28] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:12:28] [INFO ] [Real]Absence check using state equation in 335 ms returned sat
[2023-03-10 18:12:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:12:29] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2023-03-10 18:12:29] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:12:30] [INFO ] [Nat]Added 84 Read/Feed constraints in 764 ms returned sat
[2023-03-10 18:12:30] [INFO ] Computed and/alt/rep : 325/2166/325 causal constraints (skipped 109 transitions) in 35 ms.
[2023-03-10 18:12:34] [INFO ] Added : 172 causal constraints over 35 iterations in 4189 ms. Result :sat
Minimization took 2553 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 10 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:13:07] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-10 18:13:07] [INFO ] Implicit Places using invariants in 564 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:13:07] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-10 18:13:07] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:13:34] [INFO ] Implicit Places using invariants and state equation in 27316 ms returned []
Implicit Place search using SMT with State Equation took 27897 ms to find 0 implicit places.
[2023-03-10 18:13:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:13:34] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:13:35] [INFO ] Dead Transitions using invariants and state equation in 339 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-07 in 179910 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-08
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:13:35] [INFO ] Computed 75 place invariants in 81 ms
Incomplete random walk after 10000 steps, including 1319 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 867 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:13:35] [INFO ] Computed 75 place invariants in 84 ms
[2023-03-10 18:13:35] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:13:35] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 31 ms returned sat
[2023-03-10 18:13:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:13:35] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2023-03-10 18:13:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:13:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:13:36] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 49 ms returned sat
[2023-03-10 18:13:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:13:36] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-10 18:13:36] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:13:37] [INFO ] [Nat]Added 73 Read/Feed constraints in 948 ms returned sat
[2023-03-10 18:13:37] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 37 ms.
[2023-03-10 18:13:41] [INFO ] Added : 150 causal constraints over 30 iterations in 3225 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
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 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 35 place count 441 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 55 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:13:45] [INFO ] Computed 75 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 129409 resets, run finished after 1166 ms. (steps per millisecond=857 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85080 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:13:47] [INFO ] Computed 75 place invariants in 55 ms
[2023-03-10 18:13:47] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 18:13:47] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 41 ms returned sat
[2023-03-10 18:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:13:47] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-03-10 18:13:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:13:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2023-03-10 18:13:47] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 41 ms returned sat
[2023-03-10 18:13:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:13:48] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2023-03-10 18:13:48] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:13:48] [INFO ] [Nat]Added 84 Read/Feed constraints in 490 ms returned sat
[2023-03-10 18:13:48] [INFO ] Computed and/alt/rep : 338/2203/338 causal constraints (skipped 106 transitions) in 51 ms.
[2023-03-10 18:13:52] [INFO ] Deduced a trap composed of 20 places in 312 ms of which 1 ms to minimize.
[2023-03-10 18:13:53] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 1 ms to minimize.
[2023-03-10 18:13:53] [INFO ] Deduced a trap composed of 18 places in 308 ms of which 0 ms to minimize.
[2023-03-10 18:13:54] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 1 ms to minimize.
[2023-03-10 18:13:54] [INFO ] Deduced a trap composed of 28 places in 354 ms of which 1 ms to minimize.
[2023-03-10 18:13:54] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 1 ms to minimize.
[2023-03-10 18:13:55] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 0 ms to minimize.
[2023-03-10 18:13:55] [INFO ] Deduced a trap composed of 34 places in 286 ms of which 1 ms to minimize.
[2023-03-10 18:13:55] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 1 ms to minimize.
[2023-03-10 18:13:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3516 ms
[2023-03-10 18:13:56] [INFO ] Added : 139 causal constraints over 28 iterations in 7384 ms. Result :sat
Minimization took 1118 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 21 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:14:02] [INFO ] Computed 75 place invariants in 88 ms
[2023-03-10 18:14:04] [INFO ] Implicit Places using invariants in 1897 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 174, 204, 249]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1918 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 30 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:14:04] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-10 18:14:04] [INFO ] Implicit Places using invariants in 663 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:14:04] [INFO ] Invariants computation overflowed in 50 ms
[2023-03-10 18:14:05] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:14:34] [INFO ] Implicit Places using invariants and state equation in 29309 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29987 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/441 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 20 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:14:34] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-10 18:14:34] [INFO ] Implicit Places using invariants in 740 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:14:34] [INFO ] Invariants computation overflowed in 60 ms
[2023-03-10 18:14:35] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:15:05] [INFO ] Performed 414/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 18:15:05] [INFO ] Implicit Places using invariants and state equation in 30681 ms returned []
Implicit Place search using SMT with State Equation took 31423 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:15:05] [INFO ] Invariants computation overflowed in 37 ms
Incomplete random walk after 1000000 steps, including 144398 resets, run finished after 1183 ms. (steps per millisecond=845 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91452 resets, run finished after 753 ms. (steps per millisecond=1328 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:15:07] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-10 18:15:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:15:08] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2023-03-10 18:15:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:15:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:15:09] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2023-03-10 18:15:09] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:15:09] [INFO ] [Nat]Added 84 Read/Feed constraints in 346 ms returned sat
[2023-03-10 18:15:09] [INFO ] Computed and/alt/rep : 324/2161/324 causal constraints (skipped 109 transitions) in 35 ms.
[2023-03-10 18:15:14] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 1 ms to minimize.
[2023-03-10 18:15:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-10 18:15:14] [INFO ] Added : 142 causal constraints over 29 iterations in 5272 ms. Result :sat
Minimization took 952 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 10 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:15:23] [INFO ] Invariants computation overflowed in 38 ms
[2023-03-10 18:15:23] [INFO ] Implicit Places using invariants in 709 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:15:23] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 18:15:24] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:15:52] [INFO ] Implicit Places using invariants and state equation in 28758 ms returned []
Implicit Place search using SMT with State Equation took 29480 ms to find 0 implicit places.
[2023-03-10 18:15:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:15:52] [INFO ] Invariants computation overflowed in 37 ms
[2023-03-10 18:15:52] [INFO ] Dead Transitions using invariants and state equation in 377 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-08 in 137686 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-09
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:15:53] [INFO ] Computed 75 place invariants in 125 ms
Incomplete random walk after 10000 steps, including 1295 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 818 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:15:53] [INFO ] Computed 75 place invariants in 123 ms
[2023-03-10 18:15:53] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:15:53] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 43 ms returned sat
[2023-03-10 18:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:15:54] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2023-03-10 18:15:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:15:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 18:15:54] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 38 ms returned sat
[2023-03-10 18:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:15:54] [INFO ] [Nat]Absence check using state equation in 529 ms returned sat
[2023-03-10 18:15:54] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:15:55] [INFO ] [Nat]Added 73 Read/Feed constraints in 930 ms returned sat
[2023-03-10 18:15:55] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 36 ms.
[2023-03-10 18:15:57] [INFO ] Added : 75 causal constraints over 15 iterations in 1197 ms. Result :sat
Minimization took 1737 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
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 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 440 transition count 444
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 42 place count 440 transition count 444
Applied a total of 42 rules in 68 ms. Remains 440 /459 variables (removed 19) and now considering 444/460 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/459 places, 444/460 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-10 18:15:59] [INFO ] Computed 75 place invariants in 63 ms
Incomplete random walk after 1000000 steps, including 129238 resets, run finished after 1394 ms. (steps per millisecond=717 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85102 resets, run finished after 783 ms. (steps per millisecond=1277 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 440 cols
[2023-03-10 18:16:01] [INFO ] Computed 75 place invariants in 63 ms
[2023-03-10 18:16:01] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 18:16:01] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-10 18:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:16:01] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-10 18:16:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:16:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 18:16:01] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 35 ms returned sat
[2023-03-10 18:16:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:16:02] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-03-10 18:16:02] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:16:02] [INFO ] [Nat]Added 84 Read/Feed constraints in 106 ms returned sat
[2023-03-10 18:16:02] [INFO ] Computed and/alt/rep : 339/2211/339 causal constraints (skipped 104 transitions) in 53 ms.
[2023-03-10 18:16:10] [INFO ] Added : 88 causal constraints over 20 iterations in 8250 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 10 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 9 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-10 18:16:10] [INFO ] Computed 75 place invariants in 66 ms
[2023-03-10 18:16:12] [INFO ] Implicit Places using invariants in 1860 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 174, 203, 248]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1868 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 427 transition count 436
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 419 transition count 436
Applied a total of 16 rules in 33 ms. Remains 419 /427 variables (removed 8) and now considering 436/444 (removed 8) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:16:12] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-10 18:16:13] [INFO ] Implicit Places using invariants in 960 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:16:13] [INFO ] Invariants computation overflowed in 92 ms
[2023-03-10 18:16:14] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:16:23] [INFO ] Implicit Places using invariants and state equation in 9945 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 10910 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/440 places, 436/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 20 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:16:23] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-10 18:16:24] [INFO ] Implicit Places using invariants in 580 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:16:24] [INFO ] Invariants computation overflowed in 83 ms
[2023-03-10 18:16:24] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:16:54] [INFO ] Performed 404/416 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 18:16:55] [INFO ] Implicit Places using invariants and state equation in 31135 ms returned []
Implicit Place search using SMT with State Equation took 31727 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 416/440 places, 434/444 transitions.
Finished structural reductions, in 3 iterations. Remains : 416/440 places, 434/444 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:16:55] [INFO ] Invariants computation overflowed in 54 ms
Incomplete random walk after 1000000 steps, including 144263 resets, run finished after 1160 ms. (steps per millisecond=862 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91377 resets, run finished after 734 ms. (steps per millisecond=1362 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:16:57] [INFO ] Invariants computation overflowed in 48 ms
[2023-03-10 18:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:16:57] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-10 18:16:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:16:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:16:58] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2023-03-10 18:16:58] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:16:58] [INFO ] [Nat]Added 84 Read/Feed constraints in 295 ms returned sat
[2023-03-10 18:16:58] [INFO ] Computed and/alt/rep : 327/2181/327 causal constraints (skipped 106 transitions) in 57 ms.
[2023-03-10 18:17:00] [INFO ] Deduced a trap composed of 20 places in 522 ms of which 1 ms to minimize.
[2023-03-10 18:17:01] [INFO ] Deduced a trap composed of 8 places in 420 ms of which 1 ms to minimize.
[2023-03-10 18:17:01] [INFO ] Deduced a trap composed of 133 places in 495 ms of which 1 ms to minimize.
[2023-03-10 18:17:02] [INFO ] Deduced a trap composed of 118 places in 507 ms of which 1 ms to minimize.
[2023-03-10 18:17:02] [INFO ] Deduced a trap composed of 16 places in 405 ms of which 1 ms to minimize.
[2023-03-10 18:17:03] [INFO ] Deduced a trap composed of 15 places in 403 ms of which 1 ms to minimize.
[2023-03-10 18:17:03] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3215 ms
[2023-03-10 18:17:03] [INFO ] Added : 85 causal constraints over 19 iterations in 4830 ms. Result :sat
Minimization took 1435 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:17:05] [INFO ] Invariants computation overflowed in 47 ms
[2023-03-10 18:17:05] [INFO ] Implicit Places using invariants in 560 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:17:05] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-10 18:17:06] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:17:35] [INFO ] Implicit Places using invariants and state equation in 29810 ms returned []
Implicit Place search using SMT with State Equation took 30393 ms to find 0 implicit places.
[2023-03-10 18:17:35] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:17:35] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-10 18:17:36] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-09 in 103187 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-10
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:17:36] [INFO ] Computed 75 place invariants in 122 ms
Incomplete random walk after 10000 steps, including 1293 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 875 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:17:36] [INFO ] Computed 75 place invariants in 131 ms
[2023-03-10 18:17:36] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:17:36] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 47 ms returned sat
[2023-03-10 18:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:17:37] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2023-03-10 18:17:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:17:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:17:37] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 29 ms returned sat
[2023-03-10 18:17:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:17:38] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2023-03-10 18:17:38] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:17:39] [INFO ] [Nat]Added 73 Read/Feed constraints in 867 ms returned sat
[2023-03-10 18:17:39] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 51 ms.
[2023-03-10 18:17:42] [INFO ] Added : 155 causal constraints over 31 iterations in 3114 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
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 9 place count 454 transition count 455
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 21 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 35 place count 441 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 70 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:18:12] [INFO ] Computed 75 place invariants in 55 ms
Incomplete random walk after 1000000 steps, including 129496 resets, run finished after 1342 ms. (steps per millisecond=745 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85102 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:18:14] [INFO ] Computed 75 place invariants in 92 ms
[2023-03-10 18:18:15] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2023-03-10 18:18:15] [INFO ] [Real]Absence check using 7 positive and 68 generalized place invariants in 64 ms returned sat
[2023-03-10 18:18:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:18:15] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-10 18:18:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:18:15] [INFO ] [Nat]Absence check using 7 positive place invariants in 14 ms returned sat
[2023-03-10 18:18:15] [INFO ] [Nat]Absence check using 7 positive and 68 generalized place invariants in 55 ms returned sat
[2023-03-10 18:18:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:18:16] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2023-03-10 18:18:16] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:18:16] [INFO ] [Nat]Added 84 Read/Feed constraints in 326 ms returned sat
[2023-03-10 18:18:16] [INFO ] Computed and/alt/rep : 339/2204/339 causal constraints (skipped 105 transitions) in 55 ms.
[2023-03-10 18:18:23] [INFO ] Deduced a trap composed of 40 places in 180 ms of which 1 ms to minimize.
[2023-03-10 18:18:24] [INFO ] Deduced a trap composed of 70 places in 225 ms of which 1 ms to minimize.
[2023-03-10 18:18:24] [INFO ] Deduced a trap composed of 26 places in 238 ms of which 0 ms to minimize.
[2023-03-10 18:18:24] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 1 ms to minimize.
[2023-03-10 18:18:25] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 0 ms to minimize.
[2023-03-10 18:18:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1509 ms
[2023-03-10 18:18:25] [INFO ] Added : 203 causal constraints over 42 iterations in 8774 ms. Result :sat
Minimization took 2487 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 18 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:18:57] [INFO ] Computed 75 place invariants in 85 ms
[2023-03-10 18:18:59] [INFO ] Implicit Places using invariants in 1782 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 174, 203, 248]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1786 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 428/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 428 transition count 436
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 419 transition count 436
Applied a total of 18 rules in 20 ms. Remains 419 /428 variables (removed 9) and now considering 436/445 (removed 9) transitions.
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:18:59] [INFO ] Invariants computation overflowed in 29 ms
[2023-03-10 18:19:00] [INFO ] Implicit Places using invariants in 823 ms returned []
// Phase 1: matrix 436 rows 419 cols
[2023-03-10 18:19:00] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-10 18:19:01] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:19:30] [INFO ] Implicit Places using invariants and state equation in 30241 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 31066 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/441 places, 436/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 418 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 416 transition count 434
Applied a total of 4 rules in 23 ms. Remains 416 /418 variables (removed 2) and now considering 434/436 (removed 2) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:19:30] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 18:19:31] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:19:31] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-10 18:19:31] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:19:53] [INFO ] Implicit Places using invariants and state equation in 21779 ms returned []
Implicit Place search using SMT with State Equation took 22258 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 416/441 places, 434/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 416/441 places, 434/445 transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:19:53] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 144185 resets, run finished after 1420 ms. (steps per millisecond=704 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91435 resets, run finished after 723 ms. (steps per millisecond=1383 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:19:55] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 18:19:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:19:56] [INFO ] [Real]Absence check using state equation in 701 ms returned sat
[2023-03-10 18:19:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:19:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:19:56] [INFO ] [Nat]Absence check using state equation in 648 ms returned sat
[2023-03-10 18:19:56] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:19:59] [INFO ] [Nat]Added 84 Read/Feed constraints in 2618 ms returned sat
[2023-03-10 18:19:59] [INFO ] Computed and/alt/rep : 325/2162/325 causal constraints (skipped 108 transitions) in 34 ms.
[2023-03-10 18:20:05] [INFO ] Deduced a trap composed of 8 places in 320 ms of which 1 ms to minimize.
[2023-03-10 18:20:05] [INFO ] Deduced a trap composed of 16 places in 248 ms of which 1 ms to minimize.
[2023-03-10 18:20:06] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 0 ms to minimize.
[2023-03-10 18:20:06] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2023-03-10 18:20:06] [INFO ] Deduced a trap composed of 17 places in 239 ms of which 1 ms to minimize.
[2023-03-10 18:20:07] [INFO ] Deduced a trap composed of 15 places in 267 ms of which 1 ms to minimize.
[2023-03-10 18:20:07] [INFO ] Deduced a trap composed of 19 places in 281 ms of which 1 ms to minimize.
[2023-03-10 18:20:08] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2023-03-10 18:20:08] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 1 ms to minimize.
[2023-03-10 18:20:09] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 1 ms to minimize.
[2023-03-10 18:20:09] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 1 ms to minimize.
[2023-03-10 18:20:09] [INFO ] Deduced a trap composed of 28 places in 228 ms of which 1 ms to minimize.
[2023-03-10 18:20:10] [INFO ] Deduced a trap composed of 28 places in 235 ms of which 1 ms to minimize.
[2023-03-10 18:20:10] [INFO ] Deduced a trap composed of 21 places in 231 ms of which 1 ms to minimize.
[2023-03-10 18:20:10] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 0 ms to minimize.
[2023-03-10 18:20:11] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 0 ms to minimize.
[2023-03-10 18:20:11] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 1 ms to minimize.
[2023-03-10 18:20:11] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 1 ms to minimize.
[2023-03-10 18:20:12] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 0 ms to minimize.
[2023-03-10 18:20:12] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 1 ms to minimize.
[2023-03-10 18:20:12] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 0 ms to minimize.
[2023-03-10 18:20:13] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 0 ms to minimize.
[2023-03-10 18:20:13] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 1 ms to minimize.
[2023-03-10 18:20:13] [INFO ] Deduced a trap composed of 43 places in 205 ms of which 1 ms to minimize.
[2023-03-10 18:20:14] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 1 ms to minimize.
[2023-03-10 18:20:14] [INFO ] Deduced a trap composed of 36 places in 188 ms of which 1 ms to minimize.
[2023-03-10 18:20:14] [INFO ] Deduced a trap composed of 42 places in 216 ms of which 1 ms to minimize.
[2023-03-10 18:20:15] [INFO ] Deduced a trap composed of 43 places in 208 ms of which 1 ms to minimize.
[2023-03-10 18:20:15] [INFO ] Deduced a trap composed of 45 places in 206 ms of which 1 ms to minimize.
[2023-03-10 18:20:15] [INFO ] Deduced a trap composed of 59 places in 215 ms of which 1 ms to minimize.
[2023-03-10 18:20:16] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 1 ms to minimize.
[2023-03-10 18:20:16] [INFO ] Trap strengthening (SAT) tested/added 32/31 trap constraints in 11295 ms
[2023-03-10 18:20:16] [INFO ] Added : 174 causal constraints over 35 iterations in 16908 ms. Result :sat
Minimization took 3003 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 416 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 416/416 places, 434/434 transitions.
Applied a total of 0 rules in 16 ms. Remains 416 /416 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:20:19] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-10 18:20:20] [INFO ] Implicit Places using invariants in 808 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:20:20] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-10 18:20:20] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:20:52] [INFO ] Performed 284/416 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2023-03-10 18:21:01] [INFO ] Implicit Places using invariants and state equation in 41081 ms returned []
Implicit Place search using SMT with State Equation took 41896 ms to find 0 implicit places.
[2023-03-10 18:21:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 434 rows 416 cols
[2023-03-10 18:21:01] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:21:01] [INFO ] Dead Transitions using invariants and state equation in 457 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 416/416 places, 434/434 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-10 in 205740 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-11
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:21:01] [INFO ] Computed 75 place invariants in 81 ms
Incomplete random walk after 10000 steps, including 1270 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 867 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:21:02] [INFO ] Computed 75 place invariants in 139 ms
[2023-03-10 18:21:02] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 18:21:02] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-10 18:21:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:21:02] [INFO ] [Real]Absence check using state equation in 733 ms returned sat
[2023-03-10 18:21:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:21:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:21:03] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 49 ms returned sat
[2023-03-10 18:21:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:21:03] [INFO ] [Nat]Absence check using state equation in 606 ms returned sat
[2023-03-10 18:21:03] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:21:06] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:21:06] [INFO ] [Nat]Added 73 Read/Feed constraints in 3142 ms returned sat
[2023-03-10 18:21:06] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 37 ms.
[2023-03-10 18:21:08] [INFO ] Added : 25 causal constraints over 5 iterations in 1065 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 458 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 removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 458 transition count 457
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 456 transition count 457
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 456 transition count 456
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 8 place count 455 transition count 456
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 451 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 448 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 448 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 447 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 447 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 36 place count 441 transition count 445
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 42 place count 441 transition count 445
Applied a total of 42 rules in 63 ms. Remains 441 /459 variables (removed 18) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:21:38] [INFO ] Computed 75 place invariants in 48 ms
Incomplete random walk after 1000000 steps, including 129457 resets, run finished after 1280 ms. (steps per millisecond=781 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85212 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:21:40] [INFO ] Computed 75 place invariants in 49 ms
[2023-03-10 18:21:40] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-10 18:21:40] [INFO ] [Real]Absence check using 3 positive and 72 generalized place invariants in 52 ms returned sat
[2023-03-10 18:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:21:41] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2023-03-10 18:21:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:21:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 18:21:41] [INFO ] [Nat]Absence check using 3 positive and 72 generalized place invariants in 46 ms returned sat
[2023-03-10 18:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:21:42] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2023-03-10 18:21:42] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:21:45] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-10 18:21:45] [INFO ] [Nat]Added 84 Read/Feed constraints in 3352 ms returned sat
[2023-03-10 18:21:45] [INFO ] Computed and/alt/rep : 339/2217/339 causal constraints (skipped 105 transitions) in 36 ms.
[2023-03-10 18:21:55] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 1 ms to minimize.
[2023-03-10 18:21:55] [INFO ] Deduced a trap composed of 33 places in 190 ms of which 1 ms to minimize.
[2023-03-10 18:21:55] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 3 ms to minimize.
[2023-03-10 18:21:56] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 1 ms to minimize.
[2023-03-10 18:21:56] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 1 ms to minimize.
[2023-03-10 18:21:56] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 0 ms to minimize.
[2023-03-10 18:21:57] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 0 ms to minimize.
[2023-03-10 18:21:57] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 1 ms to minimize.
[2023-03-10 18:21:58] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 0 ms to minimize.
[2023-03-10 18:21:58] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 1 ms to minimize.
[2023-03-10 18:21:58] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 1 ms to minimize.
[2023-03-10 18:21:58] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 0 ms to minimize.
[2023-03-10 18:21:59] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 0 ms to minimize.
[2023-03-10 18:21:59] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 0 ms to minimize.
[2023-03-10 18:21:59] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 0 ms to minimize.
[2023-03-10 18:21:59] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 0 ms to minimize.
[2023-03-10 18:22:00] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 1 ms to minimize.
[2023-03-10 18:22:00] [INFO ] Deduced a trap composed of 51 places in 124 ms of which 1 ms to minimize.
[2023-03-10 18:22:00] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 1 ms to minimize.
[2023-03-10 18:22:00] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 1 ms to minimize.
[2023-03-10 18:22:01] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 1 ms to minimize.
[2023-03-10 18:22:01] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 1 ms to minimize.
[2023-03-10 18:22:02] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2023-03-10 18:22:02] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 0 ms to minimize.
[2023-03-10 18:22:03] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2023-03-10 18:22:04] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 0 ms to minimize.
[2023-03-10 18:22:04] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2023-03-10 18:22:04] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 9717 ms
[2023-03-10 18:22:05] [INFO ] Added : 258 causal constraints over 52 iterations in 19652 ms. Result :sat
Minimization took 3010 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 441 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 24 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 441/441 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 441/441 places, 445/445 transitions.
Applied a total of 0 rules in 17 ms. Remains 441 /441 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:22:08] [INFO ] Computed 75 place invariants in 91 ms
[2023-03-10 18:22:09] [INFO ] Implicit Places using invariants in 1259 ms returned []
// Phase 1: matrix 445 rows 441 cols
[2023-03-10 18:22:09] [INFO ] Computed 75 place invariants in 82 ms
[2023-03-10 18:22:10] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:22:40] [INFO ] Performed 414/441 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-10 18:22:42] [INFO ] Implicit Places using invariants and state equation in 32941 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 34201 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 440/441 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 440 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 438 transition count 443
Applied a total of 4 rules in 21 ms. Remains 438 /440 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 438 cols
[2023-03-10 18:22:42] [INFO ] Computed 74 place invariants in 84 ms
[2023-03-10 18:22:43] [INFO ] Implicit Places using invariants in 888 ms returned []
// Phase 1: matrix 443 rows 438 cols
[2023-03-10 18:22:43] [INFO ] Computed 74 place invariants in 137 ms
[2023-03-10 18:22:43] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:23:13] [INFO ] Implicit Places using invariants and state equation in 29801 ms returned [43]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 30711 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 437/441 places, 443/445 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 443
Applied a total of 1 rules in 20 ms. Remains 437 /437 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 437 cols
[2023-03-10 18:23:13] [INFO ] Computed 73 place invariants in 79 ms
[2023-03-10 18:23:14] [INFO ] Implicit Places using invariants in 987 ms returned []
// Phase 1: matrix 443 rows 437 cols
[2023-03-10 18:23:14] [INFO ] Computed 73 place invariants in 127 ms
[2023-03-10 18:23:14] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:23:44] [INFO ] Performed 324/437 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2023-03-10 18:23:53] [INFO ] Implicit Places using invariants and state equation in 39377 ms returned []
Implicit Place search using SMT with State Equation took 40370 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 437/441 places, 443/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 437/441 places, 443/445 transitions.
// Phase 1: matrix 443 rows 437 cols
[2023-03-10 18:23:53] [INFO ] Computed 73 place invariants in 76 ms
Incomplete random walk after 1000000 steps, including 129295 resets, run finished after 1174 ms. (steps per millisecond=851 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85048 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 1) seen :0
// Phase 1: matrix 443 rows 437 cols
[2023-03-10 18:23:55] [INFO ] Computed 73 place invariants in 72 ms
[2023-03-10 18:23:55] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-10 18:23:55] [INFO ] [Real]Absence check using 2 positive and 71 generalized place invariants in 46 ms returned sat
[2023-03-10 18:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:23:56] [INFO ] [Real]Absence check using state equation in 850 ms returned sat
[2023-03-10 18:23:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:23:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:23:56] [INFO ] [Nat]Absence check using 2 positive and 71 generalized place invariants in 47 ms returned sat
[2023-03-10 18:23:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:23:57] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2023-03-10 18:23:57] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:24:00] [INFO ] [Nat]Added 84 Read/Feed constraints in 2711 ms returned sat
[2023-03-10 18:24:00] [INFO ] Computed and/alt/rep : 336/2197/336 causal constraints (skipped 106 transitions) in 35 ms.
[2023-03-10 18:24:13] [INFO ] Added : 235 causal constraints over 47 iterations in 13256 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 437 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 437/437 places, 443/443 transitions.
Applied a total of 0 rules in 11 ms. Remains 437 /437 variables (removed 0) and now considering 443/443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 437/437 places, 443/443 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 437/437 places, 443/443 transitions.
Applied a total of 0 rules in 10 ms. Remains 437 /437 variables (removed 0) and now considering 443/443 (removed 0) transitions.
// Phase 1: matrix 443 rows 437 cols
[2023-03-10 18:24:13] [INFO ] Computed 73 place invariants in 73 ms
[2023-03-10 18:24:14] [INFO ] Implicit Places using invariants in 1029 ms returned []
// Phase 1: matrix 443 rows 437 cols
[2023-03-10 18:24:14] [INFO ] Computed 73 place invariants in 123 ms
[2023-03-10 18:24:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:24:32] [INFO ] Implicit Places using invariants and state equation in 17427 ms returned [48, 68, 73, 98, 118, 124, 145, 150, 151, 171, 200]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 18458 ms to find 11 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 426/437 places, 443/443 transitions.
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 426 transition count 435
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 16 place count 418 transition count 435
Applied a total of 16 rules in 20 ms. Remains 418 /426 variables (removed 8) and now considering 435/443 (removed 8) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:24:32] [INFO ] Invariants computation overflowed in 30 ms
[2023-03-10 18:24:32] [INFO ] Implicit Places using invariants in 631 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:24:32] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-10 18:24:33] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:24:49] [INFO ] Implicit Places using invariants and state equation in 16710 ms returned []
Implicit Place search using SMT with State Equation took 17368 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 418/437 places, 435/443 transitions.
Finished structural reductions, in 2 iterations. Remains : 418/437 places, 435/443 transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:24:49] [INFO ] Invariants computation overflowed in 33 ms
Incomplete random walk after 1000000 steps, including 144491 resets, run finished after 1242 ms. (steps per millisecond=805 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91416 resets, run finished after 744 ms. (steps per millisecond=1344 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:24:51] [INFO ] Invariants computation overflowed in 32 ms
[2023-03-10 18:24:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:24:52] [INFO ] [Real]Absence check using state equation in 553 ms returned sat
[2023-03-10 18:24:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:24:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:24:52] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2023-03-10 18:24:52] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:24:54] [INFO ] [Nat]Added 84 Read/Feed constraints in 2088 ms returned sat
[2023-03-10 18:24:55] [INFO ] Computed and/alt/rep : 327/2187/327 causal constraints (skipped 107 transitions) in 34 ms.
[2023-03-10 18:25:02] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2023-03-10 18:25:03] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 0 ms to minimize.
[2023-03-10 18:25:03] [INFO ] Deduced a trap composed of 18 places in 219 ms of which 1 ms to minimize.
[2023-03-10 18:25:03] [INFO ] Deduced a trap composed of 16 places in 216 ms of which 1 ms to minimize.
[2023-03-10 18:25:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1356 ms
[2023-03-10 18:25:04] [INFO ] Added : 223 causal constraints over 46 iterations in 9219 ms. Result :sat
Minimization took 3001 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 15 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 435/435 transitions.
Applied a total of 0 rules in 11 ms. Remains 418 /418 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:25:07] [INFO ] Invariants computation overflowed in 31 ms
[2023-03-10 18:25:07] [INFO ] Implicit Places using invariants in 688 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:25:07] [INFO ] Invariants computation overflowed in 65 ms
[2023-03-10 18:25:08] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:25:35] [INFO ] Implicit Places using invariants and state equation in 27662 ms returned []
Implicit Place search using SMT with State Equation took 28359 ms to find 0 implicit places.
[2023-03-10 18:25:35] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:25:35] [INFO ] Invariants computation overflowed in 36 ms
[2023-03-10 18:25:36] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-11 in 274283 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-12
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:25:36] [INFO ] Computed 75 place invariants in 129 ms
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 848 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:25:36] [INFO ] Computed 75 place invariants in 124 ms
[2023-03-10 18:25:36] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:25:36] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 18:25:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:25:37] [INFO ] [Real]Absence check using state equation in 565 ms returned sat
[2023-03-10 18:25:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:25:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-10 18:25:37] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 32 ms returned sat
[2023-03-10 18:25:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:25:37] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-10 18:25:37] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:25:38] [INFO ] [Nat]Added 73 Read/Feed constraints in 974 ms returned sat
[2023-03-10 18:25:38] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 1 ms to minimize.
[2023-03-10 18:25:39] [INFO ] Deduced a trap composed of 39 places in 115 ms of which 1 ms to minimize.
[2023-03-10 18:25:39] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 1 ms to minimize.
[2023-03-10 18:25:39] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 1 ms to minimize.
[2023-03-10 18:25:39] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 1 ms to minimize.
[2023-03-10 18:25:40] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 1 ms to minimize.
[2023-03-10 18:25:40] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2023-03-10 18:25:40] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2023-03-10 18:25:40] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 0 ms to minimize.
[2023-03-10 18:25:41] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 1 ms to minimize.
[2023-03-10 18:25:41] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 0 ms to minimize.
[2023-03-10 18:25:41] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 1 ms to minimize.
[2023-03-10 18:25:42] [INFO ] Deduced a trap composed of 15 places in 285 ms of which 1 ms to minimize.
[2023-03-10 18:25:42] [INFO ] Deduced a trap composed of 3 places in 462 ms of which 1 ms to minimize.
[2023-03-10 18:25:42] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
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:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 3 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 446 transition count 450
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 29 place count 446 transition count 446
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 33 place count 442 transition count 446
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 40 place count 442 transition count 446
Applied a total of 40 rules in 107 ms. Remains 442 /459 variables (removed 17) and now considering 446/460 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/459 places, 446/460 transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-10 18:25:42] [INFO ] Computed 75 place invariants in 90 ms
Incomplete random walk after 1000000 steps, including 129202 resets, run finished after 1530 ms. (steps per millisecond=653 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85296 resets, run finished after 1026 ms. (steps per millisecond=974 ) properties (out of 1) seen :0
// Phase 1: matrix 446 rows 442 cols
[2023-03-10 18:25:45] [INFO ] Computed 75 place invariants in 91 ms
[2023-03-10 18:25:45] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-10 18:25:45] [INFO ] [Real]Absence check using 7 positive and 68 generalized place invariants in 34 ms returned sat
[2023-03-10 18:25:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:25:46] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2023-03-10 18:25:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:25:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 16 ms returned sat
[2023-03-10 18:25:46] [INFO ] [Nat]Absence check using 7 positive and 68 generalized place invariants in 60 ms returned sat
[2023-03-10 18:25:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:25:46] [INFO ] [Nat]Absence check using state equation in 542 ms returned sat
[2023-03-10 18:25:46] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:25:47] [INFO ] [Nat]Added 84 Read/Feed constraints in 371 ms returned sat
[2023-03-10 18:25:47] [INFO ] Computed and/alt/rep : 339/2204/339 causal constraints (skipped 106 transitions) in 52 ms.
[2023-03-10 18:25:52] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 1 ms to minimize.
[2023-03-10 18:25:53] [INFO ] Deduced a trap composed of 28 places in 169 ms of which 1 ms to minimize.
[2023-03-10 18:25:53] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2023-03-10 18:25:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1085 ms
[2023-03-10 18:25:54] [INFO ] Added : 198 causal constraints over 40 iterations in 6755 ms. Result :sat
Minimization took 3002 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 16 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/442 places, 446/446 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 446/446 transitions.
Applied a total of 0 rules in 16 ms. Remains 442 /442 variables (removed 0) and now considering 446/446 (removed 0) transitions.
// Phase 1: matrix 446 rows 442 cols
[2023-03-10 18:25:57] [INFO ] Computed 75 place invariants in 84 ms
[2023-03-10 18:25:59] [INFO ] Implicit Places using invariants in 1944 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 174, 203, 248]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1948 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 429/442 places, 446/446 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 429 transition count 437
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 420 transition count 437
Applied a total of 18 rules in 33 ms. Remains 420 /429 variables (removed 9) and now considering 437/446 (removed 9) transitions.
// Phase 1: matrix 437 rows 420 cols
[2023-03-10 18:25:59] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-10 18:25:59] [INFO ] Implicit Places using invariants in 829 ms returned []
// Phase 1: matrix 437 rows 420 cols
[2023-03-10 18:25:59] [INFO ] Invariants computation overflowed in 57 ms
[2023-03-10 18:26:00] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:26:30] [INFO ] Performed 408/420 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-10 18:26:31] [INFO ] Implicit Places using invariants and state equation in 31522 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 32355 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 419/442 places, 437/446 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 419 transition count 435
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 417 transition count 435
Applied a total of 4 rules in 19 ms. Remains 417 /419 variables (removed 2) and now considering 435/437 (removed 2) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:26:31] [INFO ] Invariants computation overflowed in 62 ms
[2023-03-10 18:26:32] [INFO ] Implicit Places using invariants in 721 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:26:32] [INFO ] Invariants computation overflowed in 56 ms
[2023-03-10 18:26:32] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:26:53] [INFO ] Implicit Places using invariants and state equation in 21272 ms returned []
Implicit Place search using SMT with State Equation took 22000 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 417/442 places, 435/446 transitions.
Finished structural reductions, in 3 iterations. Remains : 417/442 places, 435/446 transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:26:53] [INFO ] Invariants computation overflowed in 62 ms
Incomplete random walk after 1000000 steps, including 144241 resets, run finished after 1543 ms. (steps per millisecond=648 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91911 resets, run finished after 765 ms. (steps per millisecond=1307 ) properties (out of 1) seen :0
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:26:55] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-10 18:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:26:56] [INFO ] [Real]Absence check using state equation in 537 ms returned sat
[2023-03-10 18:26:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:26:56] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2023-03-10 18:26:56] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:26:57] [INFO ] [Nat]Added 84 Read/Feed constraints in 561 ms returned sat
[2023-03-10 18:26:57] [INFO ] Deduced a trap composed of 119 places in 385 ms of which 1 ms to minimize.
[2023-03-10 18:26:58] [INFO ] Deduced a trap composed of 115 places in 456 ms of which 1 ms to minimize.
[2023-03-10 18:26:59] [INFO ] Deduced a trap composed of 114 places in 432 ms of which 1 ms to minimize.
[2023-03-10 18:26:59] [INFO ] Deduced a trap composed of 128 places in 436 ms of which 1 ms to minimize.
[2023-03-10 18:27:00] [INFO ] Deduced a trap composed of 124 places in 436 ms of which 1 ms to minimize.
[2023-03-10 18:27:00] [INFO ] Deduced a trap composed of 110 places in 451 ms of which 1 ms to minimize.
[2023-03-10 18:27:01] [INFO ] Deduced a trap composed of 119 places in 443 ms of which 1 ms to minimize.
[2023-03-10 18:27:01] [INFO ] Deduced a trap composed of 110 places in 392 ms of which 1 ms to minimize.
[2023-03-10 18:27:02] [INFO ] Deduced a trap composed of 122 places in 421 ms of which 1 ms to minimize.
[2023-03-10 18:27:02] [INFO ] Deduced a trap composed of 112 places in 402 ms of which 1 ms to minimize.
[2023-03-10 18:27:03] [INFO ] Deduced a trap composed of 111 places in 403 ms of which 1 ms to minimize.
[2023-03-10 18:27:03] [INFO ] Deduced a trap composed of 116 places in 375 ms of which 1 ms to minimize.
[2023-03-10 18:27:04] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 1 ms to minimize.
[2023-03-10 18:27:04] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 0 ms to minimize.
[2023-03-10 18:27:05] [INFO ] Deduced a trap composed of 116 places in 496 ms of which 2 ms to minimize.
[2023-03-10 18:27:05] [INFO ] Deduced a trap composed of 16 places in 360 ms of which 1 ms to minimize.
[2023-03-10 18:27:06] [INFO ] Deduced a trap composed of 113 places in 400 ms of which 1 ms to minimize.
[2023-03-10 18:27:06] [INFO ] Deduced a trap composed of 125 places in 359 ms of which 1 ms to minimize.
[2023-03-10 18:27:07] [INFO ] Deduced a trap composed of 3 places in 500 ms of which 1 ms to minimize.
[2023-03-10 18:27:07] [INFO ] Deduced a trap composed of 111 places in 368 ms of which 1 ms to minimize.
[2023-03-10 18:27:08] [INFO ] Deduced a trap composed of 129 places in 497 ms of which 1 ms to minimize.
[2023-03-10 18:27:08] [INFO ] Deduced a trap composed of 116 places in 394 ms of which 1 ms to minimize.
[2023-03-10 18:27:09] [INFO ] Deduced a trap composed of 11 places in 354 ms of which 0 ms to minimize.
[2023-03-10 18:27:09] [INFO ] Deduced a trap composed of 125 places in 497 ms of which 1 ms to minimize.
[2023-03-10 18:27:10] [INFO ] Deduced a trap composed of 112 places in 493 ms of which 1 ms to minimize.
[2023-03-10 18:27:11] [INFO ] Deduced a trap composed of 119 places in 507 ms of which 1 ms to minimize.
[2023-03-10 18:27:11] [INFO ] Deduced a trap composed of 126 places in 499 ms of which 1 ms to minimize.
[2023-03-10 18:27:11] [INFO ] Deduced a trap composed of 113 places in 394 ms of which 1 ms to minimize.
[2023-03-10 18:27:12] [INFO ] Deduced a trap composed of 121 places in 510 ms of which 1 ms to minimize.
[2023-03-10 18:27:13] [INFO ] Deduced a trap composed of 127 places in 501 ms of which 1 ms to minimize.
[2023-03-10 18:27:13] [INFO ] Deduced a trap composed of 117 places in 345 ms of which 0 ms to minimize.
[2023-03-10 18:27:14] [INFO ] Deduced a trap composed of 130 places in 488 ms of which 1 ms to minimize.
[2023-03-10 18:27:14] [INFO ] Deduced a trap composed of 22 places in 486 ms of which 1 ms to minimize.
[2023-03-10 18:27:15] [INFO ] Deduced a trap composed of 116 places in 504 ms of which 1 ms to minimize.
[2023-03-10 18:27:15] [INFO ] Deduced a trap composed of 142 places in 352 ms of which 0 ms to minimize.
[2023-03-10 18:27:16] [INFO ] Deduced a trap composed of 25 places in 505 ms of which 1 ms to minimize.
[2023-03-10 18:27:16] [INFO ] Deduced a trap composed of 125 places in 390 ms of which 1 ms to minimize.
[2023-03-10 18:27:17] [INFO ] Deduced a trap composed of 131 places in 508 ms of which 1 ms to minimize.
[2023-03-10 18:27:17] [INFO ] Deduced a trap composed of 125 places in 379 ms of which 1 ms to minimize.
[2023-03-10 18:27:18] [INFO ] Deduced a trap composed of 127 places in 483 ms of which 1 ms to minimize.
[2023-03-10 18:27:18] [INFO ] Deduced a trap composed of 124 places in 408 ms of which 1 ms to minimize.
[2023-03-10 18:27:19] [INFO ] Deduced a trap composed of 131 places in 508 ms of which 2 ms to minimize.
[2023-03-10 18:27:19] [INFO ] Deduced a trap composed of 126 places in 492 ms of which 1 ms to minimize.
[2023-03-10 18:27:20] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 1 ms to minimize.
[2023-03-10 18:27:20] [INFO ] Deduced a trap composed of 124 places in 384 ms of which 0 ms to minimize.
[2023-03-10 18:27:21] [INFO ] Deduced a trap composed of 124 places in 490 ms of which 1 ms to minimize.
[2023-03-10 18:27:21] [INFO ] Deduced a trap composed of 135 places in 477 ms of which 1 ms to minimize.
[2023-03-10 18:27:22] [INFO ] Deduced a trap composed of 126 places in 491 ms of which 2 ms to minimize.
[2023-03-10 18:27:23] [INFO ] Deduced a trap composed of 119 places in 251 ms of which 0 ms to minimize.
[2023-03-10 18:27:23] [INFO ] Deduced a trap composed of 120 places in 303 ms of which 1 ms to minimize.
[2023-03-10 18:27:23] [INFO ] Deduced a trap composed of 123 places in 296 ms of which 1 ms to minimize.
[2023-03-10 18:27:24] [INFO ] Deduced a trap composed of 25 places in 289 ms of which 1 ms to minimize.
[2023-03-10 18:27:24] [INFO ] Deduced a trap composed of 22 places in 251 ms of which 1 ms to minimize.
[2023-03-10 18:27:24] [INFO ] Deduced a trap composed of 129 places in 248 ms of which 0 ms to minimize.
[2023-03-10 18:27:25] [INFO ] Deduced a trap composed of 28 places in 341 ms of which 1 ms to minimize.
[2023-03-10 18:27:25] [INFO ] Deduced a trap composed of 119 places in 329 ms of which 1 ms to minimize.
[2023-03-10 18:27:26] [INFO ] Deduced a trap composed of 115 places in 444 ms of which 1 ms to minimize.
[2023-03-10 18:27:26] [INFO ] Deduced a trap composed of 120 places in 415 ms of which 0 ms to minimize.
[2023-03-10 18:27:27] [INFO ] Deduced a trap composed of 117 places in 394 ms of which 1 ms to minimize.
[2023-03-10 18:27:27] [INFO ] Deduced a trap composed of 113 places in 317 ms of which 1 ms to minimize.
[2023-03-10 18:27:28] [INFO ] Deduced a trap composed of 114 places in 329 ms of which 1 ms to minimize.
[2023-03-10 18:27:28] [INFO ] Deduced a trap composed of 114 places in 340 ms of which 1 ms to minimize.
[2023-03-10 18:27:28] [INFO ] Deduced a trap composed of 117 places in 336 ms of which 1 ms to minimize.
[2023-03-10 18:27:29] [INFO ] Deduced a trap composed of 117 places in 390 ms of which 1 ms to minimize.
[2023-03-10 18:27:29] [INFO ] Deduced a trap composed of 118 places in 468 ms of which 1 ms to minimize.
[2023-03-10 18:27:30] [INFO ] Deduced a trap composed of 119 places in 427 ms of which 1 ms to minimize.
[2023-03-10 18:27:30] [INFO ] Deduced a trap composed of 118 places in 417 ms of which 0 ms to minimize.
[2023-03-10 18:27:31] [INFO ] Deduced a trap composed of 120 places in 419 ms of which 1 ms to minimize.
[2023-03-10 18:27:31] [INFO ] Deduced a trap composed of 115 places in 398 ms of which 1 ms to minimize.
[2023-03-10 18:27:32] [INFO ] Deduced a trap composed of 119 places in 377 ms of which 1 ms to minimize.
[2023-03-10 18:27:32] [INFO ] Deduced a trap composed of 28 places in 385 ms of which 1 ms to minimize.
[2023-03-10 18:27:33] [INFO ] Deduced a trap composed of 122 places in 378 ms of which 1 ms to minimize.
[2023-03-10 18:27:33] [INFO ] Deduced a trap composed of 120 places in 359 ms of which 1 ms to minimize.
[2023-03-10 18:27:33] [INFO ] Deduced a trap composed of 34 places in 325 ms of which 1 ms to minimize.
[2023-03-10 18:27:34] [INFO ] Deduced a trap composed of 11 places in 379 ms of which 1 ms to minimize.
[2023-03-10 18:27:34] [INFO ] Deduced a trap composed of 125 places in 363 ms of which 1 ms to minimize.
[2023-03-10 18:27:35] [INFO ] Deduced a trap composed of 132 places in 322 ms of which 0 ms to minimize.
[2023-03-10 18:27:35] [INFO ] Deduced a trap composed of 124 places in 338 ms of which 1 ms to minimize.
[2023-03-10 18:27:35] [INFO ] Deduced a trap composed of 135 places in 332 ms of which 1 ms to minimize.
[2023-03-10 18:27:36] [INFO ] Deduced a trap composed of 122 places in 319 ms of which 1 ms to minimize.
[2023-03-10 18:27:36] [INFO ] Deduced a trap composed of 30 places in 263 ms of which 1 ms to minimize.
[2023-03-10 18:27:37] [INFO ] Deduced a trap composed of 30 places in 463 ms of which 1 ms to minimize.
[2023-03-10 18:27:37] [INFO ] Deduced a trap composed of 27 places in 455 ms of which 0 ms to minimize.
[2023-03-10 18:27:39] [INFO ] Deduced a trap composed of 117 places in 319 ms of which 1 ms to minimize.
[2023-03-10 18:27:40] [INFO ] Deduced a trap composed of 128 places in 453 ms of which 0 ms to minimize.
[2023-03-10 18:27:40] [INFO ] Deduced a trap composed of 133 places in 426 ms of which 1 ms to minimize.
[2023-03-10 18:27:41] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 43987 ms
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 15 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 435/435 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 435/435 transitions.
Applied a total of 0 rules in 14 ms. Remains 417 /417 variables (removed 0) and now considering 435/435 (removed 0) transitions.
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:28:04] [INFO ] Invariants computation overflowed in 51 ms
[2023-03-10 18:28:05] [INFO ] Implicit Places using invariants in 771 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:28:05] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-10 18:28:05] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:28:28] [INFO ] Implicit Places using invariants and state equation in 23232 ms returned []
Implicit Place search using SMT with State Equation took 24018 ms to find 0 implicit places.
[2023-03-10 18:28:28] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 435 rows 417 cols
[2023-03-10 18:28:28] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-10 18:28:29] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 435/435 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-12 in 172925 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-13
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:28:29] [INFO ] Computed 75 place invariants in 149 ms
Incomplete random walk after 10000 steps, including 1296 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 862 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:28:29] [INFO ] Computed 75 place invariants in 144 ms
[2023-03-10 18:28:29] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:28:29] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 51 ms returned sat
[2023-03-10 18:28:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:28:29] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2023-03-10 18:28:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:28:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:28:30] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 18:28:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:28:30] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2023-03-10 18:28:30] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:28:30] [INFO ] [Nat]Added 73 Read/Feed constraints in 70 ms returned sat
[2023-03-10 18:28:30] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 57 ms.
[2023-03-10 18:28:33] [INFO ] Added : 82 causal constraints over 17 iterations in 2858 ms. Result :sat
Minimization took 1155 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 454 transition count 455
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 450 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 447 transition count 451
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 447 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 446 transition count 450
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 31 place count 446 transition count 444
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 37 place count 440 transition count 444
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 44 place count 440 transition count 444
Applied a total of 44 rules in 121 ms. Remains 440 /459 variables (removed 19) and now considering 444/460 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/459 places, 444/460 transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-10 18:28:35] [INFO ] Computed 75 place invariants in 97 ms
Incomplete random walk after 1000000 steps, including 129297 resets, run finished after 1514 ms. (steps per millisecond=660 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85140 resets, run finished after 968 ms. (steps per millisecond=1033 ) properties (out of 1) seen :0
// Phase 1: matrix 444 rows 440 cols
[2023-03-10 18:28:37] [INFO ] Computed 75 place invariants in 51 ms
[2023-03-10 18:28:37] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2023-03-10 18:28:37] [INFO ] [Real]Absence check using 7 positive and 68 generalized place invariants in 37 ms returned sat
[2023-03-10 18:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:28:38] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-10 18:28:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:28:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 11 ms returned sat
[2023-03-10 18:28:38] [INFO ] [Nat]Absence check using 7 positive and 68 generalized place invariants in 37 ms returned sat
[2023-03-10 18:28:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:28:38] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-10 18:28:38] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:28:38] [INFO ] [Nat]Added 84 Read/Feed constraints in 60 ms returned sat
[2023-03-10 18:28:38] [INFO ] Computed and/alt/rep : 337/2202/337 causal constraints (skipped 106 transitions) in 35 ms.
[2023-03-10 18:28:40] [INFO ] Deduced a trap composed of 14 places in 520 ms of which 2 ms to minimize.
[2023-03-10 18:28:40] [INFO ] Deduced a trap composed of 12 places in 467 ms of which 1 ms to minimize.
[2023-03-10 18:28:41] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 1 ms to minimize.
[2023-03-10 18:28:41] [INFO ] Deduced a trap composed of 11 places in 429 ms of which 1 ms to minimize.
[2023-03-10 18:28:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2119 ms
[2023-03-10 18:28:41] [INFO ] Added : 70 causal constraints over 14 iterations in 3233 ms. Result :sat
Minimization took 547 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 440 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 15 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 440/440 places, 444/444 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 440/440 places, 444/444 transitions.
Applied a total of 0 rules in 16 ms. Remains 440 /440 variables (removed 0) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 440 cols
[2023-03-10 18:28:42] [INFO ] Computed 75 place invariants in 84 ms
[2023-03-10 18:28:44] [INFO ] Implicit Places using invariants in 1735 ms returned [45, 51, 71, 76, 101, 121, 127, 148, 153, 154, 174, 203, 248]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1737 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 427/440 places, 444/444 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 427 transition count 435
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 418 transition count 435
Applied a total of 18 rules in 27 ms. Remains 418 /427 variables (removed 9) and now considering 435/444 (removed 9) transitions.
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:28:44] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-10 18:28:45] [INFO ] Implicit Places using invariants in 607 ms returned []
// Phase 1: matrix 435 rows 418 cols
[2023-03-10 18:28:45] [INFO ] Invariants computation overflowed in 49 ms
[2023-03-10 18:28:45] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:29:14] [INFO ] Implicit Places using invariants and state equation in 29334 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 29943 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 417/440 places, 435/444 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 417 transition count 433
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 415 transition count 433
Applied a total of 4 rules in 19 ms. Remains 415 /417 variables (removed 2) and now considering 433/435 (removed 2) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-10 18:29:14] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:29:14] [INFO ] Implicit Places using invariants in 506 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-10 18:29:15] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:29:15] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:29:43] [INFO ] Implicit Places using invariants and state equation in 28125 ms returned []
Implicit Place search using SMT with State Equation took 28633 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 415/440 places, 433/444 transitions.
Finished structural reductions, in 3 iterations. Remains : 415/440 places, 433/444 transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-10 18:29:43] [INFO ] Invariants computation overflowed in 35 ms
Incomplete random walk after 1000000 steps, including 144438 resets, run finished after 1394 ms. (steps per millisecond=717 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91487 resets, run finished after 853 ms. (steps per millisecond=1172 ) properties (out of 1) seen :0
// Phase 1: matrix 433 rows 415 cols
[2023-03-10 18:29:45] [INFO ] Invariants computation overflowed in 35 ms
[2023-03-10 18:29:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:29:45] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2023-03-10 18:29:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:29:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:29:46] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-10 18:29:46] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:29:46] [INFO ] [Nat]Added 84 Read/Feed constraints in 55 ms returned sat
[2023-03-10 18:29:46] [INFO ] Computed and/alt/rep : 323/2160/323 causal constraints (skipped 109 transitions) in 41 ms.
[2023-03-10 18:29:48] [INFO ] Added : 73 causal constraints over 16 iterations in 2511 ms. Result :sat
Minimization took 2808 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 433/433 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 415/415 places, 433/433 transitions.
Applied a total of 0 rules in 10 ms. Remains 415 /415 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 415 cols
[2023-03-10 18:29:51] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-10 18:29:52] [INFO ] Implicit Places using invariants in 444 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-10 18:29:52] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:29:52] [INFO ] State equation strengthened by 84 read => feed constraints.
[2023-03-10 18:30:14] [INFO ] Implicit Places using invariants and state equation in 22149 ms returned []
Implicit Place search using SMT with State Equation took 22604 ms to find 0 implicit places.
[2023-03-10 18:30:14] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 433 rows 415 cols
[2023-03-10 18:30:14] [INFO ] Invariants computation overflowed in 34 ms
[2023-03-10 18:30:15] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 415/415 places, 433/433 transitions.
Ending property specific reduction for DoubleExponent-PT-020-UpperBounds-13 in 106042 ms.
Starting property specific reduction for DoubleExponent-PT-020-UpperBounds-14
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:30:15] [INFO ] Computed 75 place invariants in 135 ms
Incomplete random walk after 10000 steps, including 1301 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 854 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
// Phase 1: matrix 460 rows 459 cols
[2023-03-10 18:30:15] [INFO ] Computed 75 place invariants in 81 ms
[2023-03-10 18:30:15] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-10 18:30:15] [INFO ] [Real]Absence check using 2 positive and 73 generalized place invariants in 46 ms returned sat
[2023-03-10 18:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:30:15] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-10 18:30:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:30:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-10 18:30:15] [INFO ] [Nat]Absence check using 2 positive and 73 generalized place invariants in 36 ms returned sat
[2023-03-10 18:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:30:16] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2023-03-10 18:30:16] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-10 18:30:16] [INFO ] [Nat]Added 73 Read/Feed constraints in 44 ms returned sat
[2023-03-10 18:30:16] [INFO ] Computed and/alt/rep : 374/2222/374 causal constraints (skipped 85 transitions) in 42 ms.
[2023-03-10 18:30:18] [INFO ] Added : 63 causal constraints over 13 iterations in 2122 ms. Result :sat
Minimization took 918 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 459 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 459/459 places, 460/460 transitions.
Graph (complete) has 3236 edges and 459 vertex of which 457 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 457 transition count 456
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 455 transition count 456
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 455 transition count 455
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 9 place count 454 transition count 455
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 451 transition count 452
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 449 transition count 452
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 449 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 448 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 27 place count 448 transition count 445
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 33 place count 442 transition count 445
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 40 place count 442 transition count 445
Applied a total of 40 rules in 80 ms. Remains 442 /459 variables (removed 17) and now considering 445/460 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/459 places, 445/460 transitions.
// Phase 1: matrix 445 rows 442 cols
[2023-03-10 18:30:19] [INFO ] Invariants computation overflowed in 41 ms
Incomplete random walk after 1000000 steps, including 129340 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 85042 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 1) seen :0
// Phase 1: matrix 445 rows 442 cols
[2023-03-10 18:30:21] [INFO ] Invariants computation overflowed in 39 ms
[2023-03-10 18:30:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:30:22] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2023-03-10 18:30:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:30:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:30:22] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-10 18:30:22] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-10 18:30:23] [INFO ] [Nat]Added 82 Read/Feed constraints in 339 ms returned sat
[2023-03-10 18:30:23] [INFO ] Computed and/alt/rep : 342/2201/342 causal constraints (skipped 102 transitions) in 38 ms.
[2023-03-10 18:30:27] [INFO ] Deduced a trap composed of 8 places in 585 ms of which 1 ms to minimize.
[2023-03-10 18:30:27] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 1 ms to minimize.
[2023-03-10 18:30:28] [INFO ] Deduced a trap composed of 115 places in 501 ms of which 1 ms to minimize.
[2023-03-10 18:30:28] [INFO ] Deduced a trap composed of 136 places in 558 ms of which 1 ms to minimize.
[2023-03-10 18:30:29] [INFO ] Deduced a trap composed of 121 places in 443 ms of which 1 ms to minimize.
[2023-03-10 18:30:30] [INFO ] Deduced a trap composed of 4 places in 329 ms of which 0 ms to minimize.
[2023-03-10 18:30:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3972 ms
[2023-03-10 18:30:30] [INFO ] Added : 86 causal constraints over 19 iterations in 7667 ms. Result :sat
Minimization took 2277 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 442 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 12 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 442/442 places, 445/445 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 442/442 places, 445/445 transitions.
Applied a total of 0 rules in 11 ms. Remains 442 /442 variables (removed 0) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 442 cols
[2023-03-10 18:30:33] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-10 18:30:33] [INFO ] Implicit Places using invariants in 574 ms returned []
// Phase 1: matrix 445 rows 442 cols
[2023-03-10 18:30:33] [INFO ] Invariants computation overflowed in 41 ms
[2023-03-10 18:30:34] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-10 18:31:04] [INFO ] Performed 397/442 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2023-03-10 18:31:07] [INFO ] Implicit Places using invariants and state equation in 33604 ms returned [13]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 34181 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 441/442 places, 445/445 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 441 transition count 443
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 439 transition count 443
Applied a total of 4 rules in 22 ms. Remains 439 /441 variables (removed 2) and now considering 443/445 (removed 2) transitions.
// Phase 1: matrix 443 rows 439 cols
[2023-03-10 18:31:07] [INFO ] Computed 74 place invariants in 77 ms
[2023-03-10 18:31:08] [INFO ] Implicit Places using invariants in 1270 ms returned [42, 48, 70, 75, 100, 120, 126, 147, 152, 153, 173, 202, 247]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 1271 ms to find 13 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 426/442 places, 443/445 transitions.
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 9 place count 426 transition count 434
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 18 place count 417 transition count 434
Applied a total of 18 rules in 20 ms. Remains 417 /426 variables (removed 9) and now considering 434/443 (removed 9) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:31:08] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-10 18:31:09] [INFO ] Implicit Places using invariants in 586 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:31:09] [INFO ] Invariants computation overflowed in 61 ms
[2023-03-10 18:31:09] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-10 18:31:34] [INFO ] Implicit Places using invariants and state equation in 25753 ms returned []
Implicit Place search using SMT with State Equation took 26340 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 417/442 places, 434/445 transitions.
Finished structural reductions, in 3 iterations. Remains : 417/442 places, 434/445 transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:31:34] [INFO ] Invariants computation overflowed in 34 ms
Incomplete random walk after 1000000 steps, including 144284 resets, run finished after 1081 ms. (steps per millisecond=925 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91457 resets, run finished after 745 ms. (steps per millisecond=1342 ) properties (out of 1) seen :0
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:31:36] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:31:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:37] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-03-10 18:31:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 18:31:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 18:31:37] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2023-03-10 18:31:37] [INFO ] State equation strengthened by 82 read => feed constraints.
[2023-03-10 18:31:38] [INFO ] [Nat]Added 82 Read/Feed constraints in 392 ms returned sat
[2023-03-10 18:31:38] [INFO ] Computed and/alt/rep : 331/2191/331 causal constraints (skipped 102 transitions) in 53 ms.
[2023-03-10 18:31:44] [INFO ] Deduced a trap composed of 117 places in 337 ms of which 0 ms to minimize.
[2023-03-10 18:31:45] [INFO ] Deduced a trap composed of 114 places in 497 ms of which 1 ms to minimize.
[2023-03-10 18:31:45] [INFO ] Deduced a trap composed of 121 places in 356 ms of which 1 ms to minimize.
[2023-03-10 18:31:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1370 ms
[2023-03-10 18:31:45] [INFO ] Added : 129 causal constraints over 26 iterations in 7655 ms. Result :sat
Minimization took 1201 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 434/434 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 417/417 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 417 /417 variables (removed 0) and now considering 434/434 (removed 0) transitions.
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:31:47] [INFO ] Invariants computation overflowed in 33 ms
[2023-03-10 18:31:47] [INFO ] Implicit Places using invariants in 570 ms returned []
// Phase 1: matrix 434 rows 417 cols
[2023-03-10 18:31:47] [INFO ] Invariants computation overflowed in 55 ms
[2023-03-10 18:31:48] [INFO ] State equation strengthened by 82 read => feed constraints.

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DoubleExponent-PT-020"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is DoubleExponent-PT-020, 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 r159-smll-167819445200061"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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