MCC'2024- Execution of r464-smll-171620117700053

About the Execution of LTSMin+red for ASLink-PT-03b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1099.628	635070.00	763059.00	1441.00	1 1 1 1 1 1 ? 1 1 1 1 1 1 1 1 1	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1004K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 544K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-03b-UpperBounds-00
FORMULA_NAME ASLink-PT-03b-UpperBounds-01
FORMULA_NAME ASLink-PT-03b-UpperBounds-02
FORMULA_NAME ASLink-PT-03b-UpperBounds-03
FORMULA_NAME ASLink-PT-03b-UpperBounds-04
FORMULA_NAME ASLink-PT-03b-UpperBounds-05
FORMULA_NAME ASLink-PT-03b-UpperBounds-06
FORMULA_NAME ASLink-PT-03b-UpperBounds-07
FORMULA_NAME ASLink-PT-03b-UpperBounds-08
FORMULA_NAME ASLink-PT-03b-UpperBounds-09
FORMULA_NAME ASLink-PT-03b-UpperBounds-10
FORMULA_NAME ASLink-PT-03b-UpperBounds-11
FORMULA_NAME ASLink-PT-03b-UpperBounds-12
FORMULA_NAME ASLink-PT-03b-UpperBounds-13
FORMULA_NAME ASLink-PT-03b-UpperBounds-14
FORMULA_NAME ASLink-PT-03b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717190888704

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:28:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:28:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:28:11] [INFO ] Load time of PNML (sax parser for PT used): 460 ms
[2024-05-31 21:28:12] [INFO ] Transformed 1638 places.
[2024-05-31 21:28:12] [INFO ] Transformed 2094 transitions.
[2024-05-31 21:28:12] [INFO ] Found NUPN structural information;
[2024-05-31 21:28:12] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 841 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 22 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 2094 rows 1638 cols
[2024-05-31 21:28:12] [INFO ] Computed 160 invariants in 286 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (28 resets) in 106 ms. (93 steps per ms)
FORMULA ASLink-PT-03b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60006 steps (24 resets) in 209 ms. (285 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2024-05-31 21:28:13] [INFO ] Invariant cache hit.
[2024-05-31 21:28:14] [INFO ] [Real]Absence check using 37 positive place invariants in 98 ms returned sat
[2024-05-31 21:28:14] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 108 ms returned sat
[2024-05-31 21:28:16] [INFO ] [Real]Absence check using state equation in 2430 ms returned sat
[2024-05-31 21:28:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:17] [INFO ] [Nat]Absence check using 37 positive place invariants in 52 ms returned sat
[2024-05-31 21:28:17] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 73 ms returned sat
[2024-05-31 21:28:20] [INFO ] [Nat]Absence check using state equation in 2947 ms returned sat
[2024-05-31 21:28:22] [INFO ] Deduced a trap composed of 21 places in 1548 ms of which 221 ms to minimize.
[2024-05-31 21:28:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:28:23] [INFO ] [Real]Absence check using 37 positive place invariants in 50 ms returned sat
[2024-05-31 21:28:23] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 74 ms returned sat
[2024-05-31 21:28:25] [INFO ] [Real]Absence check using state equation in 2073 ms returned sat
[2024-05-31 21:28:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:26] [INFO ] [Nat]Absence check using 37 positive place invariants in 80 ms returned sat
[2024-05-31 21:28:26] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 100 ms returned sat
[2024-05-31 21:28:29] [INFO ] [Nat]Absence check using state equation in 2716 ms returned sat
[2024-05-31 21:28:30] [INFO ] Deduced a trap composed of 18 places in 1346 ms of which 10 ms to minimize.
[2024-05-31 21:28:32] [INFO ] Deduced a trap composed of 22 places in 2312 ms of which 29 ms to minimize.
[2024-05-31 21:28:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:28:33] [INFO ] [Real]Absence check using 37 positive place invariants in 78 ms returned sat
[2024-05-31 21:28:33] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 112 ms returned sat
[2024-05-31 21:28:35] [INFO ] [Real]Absence check using state equation in 2236 ms returned sat
[2024-05-31 21:28:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:36] [INFO ] [Nat]Absence check using 37 positive place invariants in 81 ms returned sat
[2024-05-31 21:28:36] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 98 ms returned sat
[2024-05-31 21:28:38] [INFO ] [Nat]Absence check using state equation in 1971 ms returned sat
[2024-05-31 21:28:39] [INFO ] Deduced a trap composed of 34 places in 744 ms of which 10 ms to minimize.
[2024-05-31 21:28:40] [INFO ] Deduced a trap composed of 21 places in 762 ms of which 9 ms to minimize.
[2024-05-31 21:28:41] [INFO ] Deduced a trap composed of 53 places in 632 ms of which 8 ms to minimize.
[2024-05-31 21:28: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 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:28:41] [INFO ] [Real]Absence check using 37 positive place invariants in 67 ms returned sat
[2024-05-31 21:28:41] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 96 ms returned sat
[2024-05-31 21:28:43] [INFO ] [Real]Absence check using state equation in 1645 ms returned sat
[2024-05-31 21:28:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:44] [INFO ] [Nat]Absence check using 37 positive place invariants in 81 ms returned sat
[2024-05-31 21:28:44] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 107 ms returned sat
[2024-05-31 21:28:46] [INFO ] [Nat]Absence check using state equation in 2269 ms returned sat
[2024-05-31 21:28:48] [INFO ] Deduced a trap composed of 24 places in 1230 ms of which 17 ms to minimize.
[2024-05-31 21:28:49] [INFO ] Deduced a trap composed of 131 places in 1204 ms of which 10 ms to minimize.
[2024-05-31 21:28: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 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-31 21:28:49] [INFO ] [Real]Absence check using 37 positive place invariants in 77 ms returned sat
[2024-05-31 21:28:50] [INFO ] [Real]Absence check using 37 positive and 123 generalized place invariants in 114 ms returned sat
[2024-05-31 21:28:52] [INFO ] [Real]Absence check using state equation in 2064 ms returned sat
[2024-05-31 21:28:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:28:52] [INFO ] [Nat]Absence check using 37 positive place invariants in 77 ms returned sat
[2024-05-31 21:28:53] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 101 ms returned sat
[2024-05-31 21:28:54] [INFO ] [Nat]Absence check using state equation in 1666 ms returned sat
[2024-05-31 21:28:55] [INFO ] Deduced a trap composed of 23 places in 1032 ms of which 13 ms to minimize.
[2024-05-31 21:28:56] [INFO ] Deduced a trap composed of 42 places in 879 ms of which 12 ms to minimize.
[2024-05-31 21:28:57] [INFO ] Deduced a trap composed of 53 places in 767 ms of which 8 ms to minimize.
[2024-05-31 21:28:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:868)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 367 transitions
Trivial Post-agglo rules discarded 367 transitions
Performed 367 trivial Post agglomeration. Transition count delta: 367
Iterating post reduction 0 with 367 rules applied. Total rules applied 367 place count 1638 transition count 1727
Reduce places removed 367 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 385 rules applied. Total rules applied 752 place count 1271 transition count 1709
Reduce places removed 5 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 9 rules applied. Total rules applied 761 place count 1266 transition count 1705
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 765 place count 1262 transition count 1705
Performed 375 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 375 Pre rules applied. Total rules applied 765 place count 1262 transition count 1330
Deduced a syphon composed of 375 places in 10 ms
Ensure Unique test removed 33 places
Reduce places removed 408 places and 0 transitions.
Iterating global reduction 4 with 783 rules applied. Total rules applied 1548 place count 854 transition count 1330
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 4 with 25 rules applied. Total rules applied 1573 place count 851 transition count 1308
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 5 with 22 rules applied. Total rules applied 1595 place count 829 transition count 1308
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 1595 place count 829 transition count 1296
Deduced a syphon composed of 12 places in 12 ms
Ensure Unique test removed 10 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 34 rules applied. Total rules applied 1629 place count 807 transition count 1296
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 6 with 2 rules applied. Total rules applied 1631 place count 805 transition count 1296
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 12 Pre rules applied. Total rules applied 1631 place count 805 transition count 1284
Deduced a syphon composed of 12 places in 13 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 7 with 24 rules applied. Total rules applied 1655 place count 793 transition count 1284
Discarding 51 places :
Symmetric choice reduction at 7 with 51 rule applications. Total rules 1706 place count 742 transition count 1233
Iterating global reduction 7 with 51 rules applied. Total rules applied 1757 place count 742 transition count 1233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1758 place count 742 transition count 1232
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 18 Pre rules applied. Total rules applied 1758 place count 742 transition count 1214
Deduced a syphon composed of 18 places in 15 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 8 with 37 rules applied. Total rules applied 1795 place count 723 transition count 1214
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1795 place count 723 transition count 1213
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 1798 place count 721 transition count 1213
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1802 place count 717 transition count 1186
Iterating global reduction 8 with 4 rules applied. Total rules applied 1806 place count 717 transition count 1186
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 1806 place count 717 transition count 1183
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1812 place count 714 transition count 1183
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1813 place count 713 transition count 1175
Iterating global reduction 8 with 1 rules applied. Total rules applied 1814 place count 713 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1815 place count 712 transition count 1167
Iterating global reduction 8 with 1 rules applied. Total rules applied 1816 place count 712 transition count 1167
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1817 place count 711 transition count 1159
Iterating global reduction 8 with 1 rules applied. Total rules applied 1818 place count 711 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1819 place count 710 transition count 1151
Iterating global reduction 8 with 1 rules applied. Total rules applied 1820 place count 710 transition count 1151
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1821 place count 709 transition count 1143
Iterating global reduction 8 with 1 rules applied. Total rules applied 1822 place count 709 transition count 1143
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1823 place count 708 transition count 1135
Iterating global reduction 8 with 1 rules applied. Total rules applied 1824 place count 708 transition count 1135
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1825 place count 707 transition count 1127
Iterating global reduction 8 with 1 rules applied. Total rules applied 1826 place count 707 transition count 1127
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1827 place count 706 transition count 1119
Iterating global reduction 8 with 1 rules applied. Total rules applied 1828 place count 706 transition count 1119
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1829 place count 705 transition count 1111
Iterating global reduction 8 with 1 rules applied. Total rules applied 1830 place count 705 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1831 place count 704 transition count 1103
Iterating global reduction 8 with 1 rules applied. Total rules applied 1832 place count 704 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1833 place count 703 transition count 1095
Iterating global reduction 8 with 1 rules applied. Total rules applied 1834 place count 703 transition count 1095
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1835 place count 702 transition count 1087
Iterating global reduction 8 with 1 rules applied. Total rules applied 1836 place count 702 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1837 place count 701 transition count 1079
Iterating global reduction 8 with 1 rules applied. Total rules applied 1838 place count 701 transition count 1079
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1839 place count 700 transition count 1071
Iterating global reduction 8 with 1 rules applied. Total rules applied 1840 place count 700 transition count 1071
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1841 place count 699 transition count 1063
Iterating global reduction 8 with 1 rules applied. Total rules applied 1842 place count 699 transition count 1063
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1843 place count 698 transition count 1055
Iterating global reduction 8 with 1 rules applied. Total rules applied 1844 place count 698 transition count 1055
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 4 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 8 with 176 rules applied. Total rules applied 2020 place count 610 transition count 967
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2021 place count 609 transition count 966
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 2023 place count 608 transition count 966
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 2024 place count 607 transition count 965
Iterating global reduction 8 with 1 rules applied. Total rules applied 2025 place count 607 transition count 965
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2027 place count 607 transition count 963
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2028 place count 606 transition count 963
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2030 place count 605 transition count 972
Free-agglomeration rule applied 4 times.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2034 place count 605 transition count 968
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 2038 place count 601 transition count 968
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 2041 place count 601 transition count 965
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 2044 place count 598 transition count 965
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2045 place count 597 transition count 964
Reduce places removed 6 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 12 with 9 rules applied. Total rules applied 2054 place count 591 transition count 961
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 2057 place count 588 transition count 961
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 9 Pre rules applied. Total rules applied 2057 place count 588 transition count 952
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 18 rules applied. Total rules applied 2075 place count 579 transition count 952
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 2078 place count 576 transition count 952
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 15 with 12 rules applied. Total rules applied 2090 place count 570 transition count 946
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 2093 place count 567 transition count 943
Iterating global reduction 15 with 3 rules applied. Total rules applied 2096 place count 567 transition count 943
Free-agglomeration rule applied 3 times.
Iterating global reduction 15 with 3 rules applied. Total rules applied 2099 place count 567 transition count 940
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 15 with 3 rules applied. Total rules applied 2102 place count 564 transition count 940
Applied a total of 2102 rules in 1767 ms. Remains 564 /1638 variables (removed 1074) and now considering 940/2094 (removed 1154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1788 ms. Remains : 564/1638 places, 940/2094 transitions.
// Phase 1: matrix 940 rows 564 cols
[2024-05-31 21:28:59] [INFO ] Computed 100 invariants in 66 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (14035 resets) in 2484 ms. (402 steps per ms)
FORMULA ASLink-PT-03b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (11616 resets) in 3415 ms. (878 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-31 21:29:05] [INFO ] Invariant cache hit.
[2024-05-31 21:29:05] [INFO ] [Real]Absence check using 25 positive place invariants in 22 ms returned sat
[2024-05-31 21:29:05] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 39 ms returned sat
[2024-05-31 21:29:06] [INFO ] [Real]Absence check using state equation in 544 ms returned sat
[2024-05-31 21:29:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:06] [INFO ] [Nat]Absence check using 25 positive place invariants in 20 ms returned sat
[2024-05-31 21:29:06] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 22 ms returned sat
[2024-05-31 21:29:07] [INFO ] [Nat]Absence check using state equation in 587 ms returned sat
[2024-05-31 21:29:07] [INFO ] Computed and/alt/rep : 366/1398/366 causal constraints (skipped 553 transitions) in 145 ms.
[2024-05-31 21:29:11] [INFO ] Added : 191 causal constraints over 39 iterations in 4106 ms. Result :sat
Minimization took 1113 ms.
[2024-05-31 21:29:12] [INFO ] [Real]Absence check using 25 positive place invariants in 14 ms returned sat
[2024-05-31 21:29:12] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 21 ms returned sat
[2024-05-31 21:29:13] [INFO ] [Real]Absence check using state equation in 564 ms returned sat
[2024-05-31 21:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:13] [INFO ] [Nat]Absence check using 25 positive place invariants in 17 ms returned sat
[2024-05-31 21:29:13] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 36 ms returned sat
[2024-05-31 21:29:13] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2024-05-31 21:29:14] [INFO ] Computed and/alt/rep : 366/1398/366 causal constraints (skipped 553 transitions) in 128 ms.
[2024-05-31 21:29:15] [INFO ] Added : 60 causal constraints over 12 iterations in 1282 ms. Result :sat
Minimization took 743 ms.
[2024-05-31 21:29:16] [INFO ] [Real]Absence check using 25 positive place invariants in 18 ms returned sat
[2024-05-31 21:29:16] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 36 ms returned sat
[2024-05-31 21:29:16] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-31 21:29:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:16] [INFO ] [Nat]Absence check using 25 positive place invariants in 18 ms returned sat
[2024-05-31 21:29:16] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 31 ms returned sat
[2024-05-31 21:29:17] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2024-05-31 21:29:18] [INFO ] Deduced a trap composed of 95 places in 575 ms of which 7 ms to minimize.
[2024-05-31 21:29:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 674 ms
[2024-05-31 21:29:18] [INFO ] Computed and/alt/rep : 366/1398/366 causal constraints (skipped 553 transitions) in 81 ms.
[2024-05-31 21:29:21] [INFO ] Added : 196 causal constraints over 40 iterations in 3551 ms. Result :sat
Minimization took 993 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 564 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 564/564 places, 940/940 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 564 transition count 938
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 562 transition count 938
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 561 transition count 937
Applied a total of 6 rules in 39 ms. Remains 561 /564 variables (removed 3) and now considering 937/940 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 561/564 places, 937/940 transitions.
// Phase 1: matrix 937 rows 561 cols
[2024-05-31 21:29:24] [INFO ] Computed 100 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (13940 resets) in 2518 ms. (396 steps per ms)
BEST_FIRST walk for 3000002 steps (11663 resets) in 3084 ms. (972 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-31 21:29:29] [INFO ] Invariant cache hit.
[2024-05-31 21:29:29] [INFO ] [Real]Absence check using 25 positive place invariants in 23 ms returned sat
[2024-05-31 21:29:29] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 44 ms returned sat
[2024-05-31 21:29:30] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2024-05-31 21:29:30] [INFO ] Computed and/alt/rep : 363/1395/363 causal constraints (skipped 553 transitions) in 115 ms.
[2024-05-31 21:29:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:31] [INFO ] [Nat]Absence check using 25 positive place invariants in 23 ms returned sat
[2024-05-31 21:29:31] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 43 ms returned sat
[2024-05-31 21:29:31] [INFO ] [Nat]Absence check using state equation in 603 ms returned sat
[2024-05-31 21:29:31] [INFO ] Computed and/alt/rep : 363/1395/363 causal constraints (skipped 553 transitions) in 79 ms.
[2024-05-31 21:29:35] [INFO ] Added : 199 causal constraints over 40 iterations in 3683 ms. Result :sat
Minimization took 1055 ms.
[2024-05-31 21:29:36] [INFO ] [Real]Absence check using 25 positive place invariants in 20 ms returned sat
[2024-05-31 21:29:36] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 42 ms returned sat
[2024-05-31 21:29:37] [INFO ] [Real]Absence check using state equation in 507 ms returned sat
[2024-05-31 21:29:37] [INFO ] Computed and/alt/rep : 363/1395/363 causal constraints (skipped 553 transitions) in 110 ms.
[2024-05-31 21:29:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:37] [INFO ] [Nat]Absence check using 25 positive place invariants in 23 ms returned sat
[2024-05-31 21:29:37] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 43 ms returned sat
[2024-05-31 21:29:38] [INFO ] [Nat]Absence check using state equation in 564 ms returned sat
[2024-05-31 21:29:38] [INFO ] Computed and/alt/rep : 363/1395/363 causal constraints (skipped 553 transitions) in 84 ms.
[2024-05-31 21:29:42] [INFO ] Added : 138 causal constraints over 28 iterations in 3791 ms. Result :sat
Minimization took 1043 ms.
[2024-05-31 21:29:43] [INFO ] [Real]Absence check using 25 positive place invariants in 20 ms returned sat
[2024-05-31 21:29:43] [INFO ] [Real]Absence check using 25 positive and 75 generalized place invariants in 43 ms returned sat
[2024-05-31 21:29:44] [INFO ] [Real]Absence check using state equation in 566 ms returned sat
[2024-05-31 21:29:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:29:44] [INFO ] [Nat]Absence check using 25 positive place invariants in 27 ms returned sat
[2024-05-31 21:29:44] [INFO ] [Nat]Absence check using 25 positive and 75 generalized place invariants in 44 ms returned sat
[2024-05-31 21:29:44] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2024-05-31 21:29:45] [INFO ] Computed and/alt/rep : 363/1395/363 causal constraints (skipped 553 transitions) in 105 ms.
[2024-05-31 21:29:51] [INFO ] Added : 284 causal constraints over 57 iterations in 6039 ms. Result :sat
Minimization took 958 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 937/937 transitions.
Applied a total of 0 rules in 33 ms. Remains 561 /561 variables (removed 0) and now considering 937/937 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 561/561 places, 937/937 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 937/937 transitions.
Applied a total of 0 rules in 32 ms. Remains 561 /561 variables (removed 0) and now considering 937/937 (removed 0) transitions.
[2024-05-31 21:29:53] [INFO ] Invariant cache hit.
[2024-05-31 21:29:53] [INFO ] Implicit Places using invariants in 842 ms returned [1, 18, 19, 22, 32, 49, 67, 138, 142, 144, 155, 156, 158, 175, 193, 264, 268, 269, 280, 281, 283, 300, 318, 387, 391, 392, 395, 406, 407, 408, 426, 428, 432, 450, 451, 452, 453, 465, 471, 477, 483, 489, 495, 501, 507, 513, 519, 525]
[2024-05-31 21:29:53] [INFO ] Actually due to overlaps returned [426, 408, 49, 175, 300, 432, 32, 158, 283, 155, 280, 406, 450, 156, 281, 407, 428, 451, 1, 18, 268, 269, 391, 392, 67, 193, 318, 452, 495, 513, 525, 19, 22, 142, 395, 453, 465, 471, 477, 483, 489, 501, 507, 519]
Discarding 44 places :
Implicit Place search using SMT only with invariants took 850 ms to find 44 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 517/561 places, 937/937 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 513 transition count 859
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 83 rules applied. Total rules applied 165 place count 435 transition count 854
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 167 place count 433 transition count 854
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 167 place count 433 transition count 835
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 206 place count 413 transition count 835
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 218 place count 409 transition count 827
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 226 place count 401 transition count 827
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 241 place count 386 transition count 812
Iterating global reduction 5 with 15 rules applied. Total rules applied 256 place count 386 transition count 812
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 259 place count 386 transition count 809
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 259 place count 386 transition count 808
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 385 transition count 808
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 264 place count 382 transition count 802
Iterating global reduction 6 with 3 rules applied. Total rules applied 267 place count 382 transition count 802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 268 place count 381 transition count 801
Iterating global reduction 6 with 1 rules applied. Total rules applied 269 place count 381 transition count 801
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 270 place count 380 transition count 799
Iterating global reduction 6 with 1 rules applied. Total rules applied 271 place count 380 transition count 799
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 327 place count 352 transition count 771
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 330 place count 349 transition count 768
Iterating global reduction 6 with 3 rules applied. Total rules applied 333 place count 349 transition count 768
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 336 place count 349 transition count 765
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 340 place count 347 transition count 766
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 346 place count 347 transition count 760
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 353 place count 340 transition count 760
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 8 with 9 rules applied. Total rules applied 362 place count 340 transition count 760
Applied a total of 362 rules in 159 ms. Remains 340 /517 variables (removed 177) and now considering 760/937 (removed 177) transitions.
// Phase 1: matrix 760 rows 340 cols
[2024-05-31 21:29:54] [INFO ] Computed 46 invariants in 9 ms
[2024-05-31 21:29:54] [INFO ] Implicit Places using invariants in 597 ms returned [72, 91, 97, 100, 102, 107, 108, 160, 179, 185, 188, 190, 195, 196, 248, 265, 271, 274, 276]
[2024-05-31 21:29:54] [INFO ] Actually due to overlaps returned [107, 195, 108, 196, 91, 97, 102, 179, 185, 190, 265, 271, 276, 72, 160, 248]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 602 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 324/561 places, 760/937 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 312 transition count 748
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 312 transition count 748
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 309 transition count 745
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 309 transition count 745
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 42 place count 303 transition count 739
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 51 place count 303 transition count 730
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 60 place count 294 transition count 730
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 294 transition count 727
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 291 transition count 727
Applied a total of 66 rules in 98 ms. Remains 291 /324 variables (removed 33) and now considering 727/760 (removed 33) transitions.
// Phase 1: matrix 727 rows 291 cols
[2024-05-31 21:29:54] [INFO ] Computed 30 invariants in 10 ms
[2024-05-31 21:29:55] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-05-31 21:29:55] [INFO ] Invariant cache hit.
[2024-05-31 21:29:56] [INFO ] Implicit Places using invariants and state equation in 1267 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 291/561 places, 727/937 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3476 ms. Remains : 291/561 places, 727/937 transitions.
[2024-05-31 21:29:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (21697 resets) in 2034 ms. (491 steps per ms)
BEST_FIRST walk for 3000002 steps (20847 resets) in 2354 ms. (1273 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-31 21:30:00] [INFO ] Invariant cache hit.
[2024-05-31 21:30:00] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-31 21:30:00] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 11 ms returned sat
[2024-05-31 21:30:01] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2024-05-31 21:30:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-31 21:30:01] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 17 ms returned sat
[2024-05-31 21:30:01] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2024-05-31 21:30:01] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 85 ms.
[2024-05-31 21:30:02] [INFO ] Added : 31 causal constraints over 7 iterations in 661 ms. Result :sat
Minimization took 842 ms.
[2024-05-31 21:30:03] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-31 21:30:03] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 18 ms returned sat
[2024-05-31 21:30:03] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2024-05-31 21:30:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:04] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-31 21:30:04] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 17 ms returned sat
[2024-05-31 21:30:04] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-05-31 21:30:04] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 89 ms.
[2024-05-31 21:30:05] [INFO ] Added : 54 causal constraints over 11 iterations in 1005 ms. Result :sat
Minimization took 893 ms.
[2024-05-31 21:30:06] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-31 21:30:06] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 14 ms returned sat
[2024-05-31 21:30:06] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2024-05-31 21:30:07] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 86 ms.
[2024-05-31 21:30:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:30:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-31 21:30:07] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 17 ms returned sat
[2024-05-31 21:30:07] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2024-05-31 21:30:07] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 85 ms.
[2024-05-31 21:30:08] [INFO ] Added : 10 causal constraints over 2 iterations in 346 ms. Result :sat
Minimization took 880 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 727/727 transitions.
Applied a total of 0 rules in 18 ms. Remains 291 /291 variables (removed 0) and now considering 727/727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 291/291 places, 727/727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 727/727 transitions.
Applied a total of 0 rules in 17 ms. Remains 291 /291 variables (removed 0) and now considering 727/727 (removed 0) transitions.
[2024-05-31 21:30:09] [INFO ] Invariant cache hit.
[2024-05-31 21:30:09] [INFO ] Implicit Places using invariants in 606 ms returned []
[2024-05-31 21:30:09] [INFO ] Invariant cache hit.
[2024-05-31 21:30:11] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1874 ms to find 0 implicit places.
[2024-05-31 21:30:11] [INFO ] Redundant transitions in 81 ms returned []
Running 706 sub problems to find dead transitions.
[2024-05-31 21:30:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 1/291 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-05-31 21:30:41] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 291/1018 variables, and 31 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 19/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/290 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 1/291 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 706 unsolved
[2024-05-31 21:31:04] [INFO ] Deduced a trap composed of 54 places in 358 ms of which 6 ms to minimize.
[2024-05-31 21:31:05] [INFO ] Deduced a trap composed of 61 places in 389 ms of which 4 ms to minimize.
[2024-05-31 21:31:08] [INFO ] Deduced a trap composed of 85 places in 336 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 706 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 291/1018 variables, and 34 constraints, problems are : Problem set: 0 solved, 706 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/291 constraints, PredecessorRefiner: 0/706 constraints, Known Traps: 4/4 constraints]
After SMT, in 60943ms problems are : Problem set: 0 solved, 706 unsolved
Search for dead transitions found 0 dead transitions in 60991ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63006 ms. Remains : 291/291 places, 727/727 transitions.
RANDOM walk for 40000 steps (866 resets) in 2112 ms. (18 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (270 resets) in 384 ms. (103 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (272 resets) in 530 ms. (75 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (276 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (266 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (256 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (263 resets) in 120 ms. (330 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 184617 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :2 out of 6
Probabilistic random walk after 184617 steps, saw 94923 distinct states, run finished after 3008 ms. (steps per millisecond=61 ) properties seen :2
[2024-05-31 21:31:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/170 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 85/255 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 18/273 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 18/291 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 727/1018 variables, 291/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1018 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1018 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1018/1018 variables, and 321 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1071 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 26/170 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 85/255 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 18/273 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-31 21:31:17] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/273 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/273 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 18/291 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 727/1018 variables, 291/322 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1018 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1018 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/1018 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1018/1018 variables, and 326 constraints, problems are : Problem set: 0 solved, 4 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 2052ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1306 ms.
Support contains 2 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 727/727 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 291 transition count 726
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 290 transition count 726
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 290 transition count 725
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 289 transition count 725
Applied a total of 4 rules in 21 ms. Remains 289 /291 variables (removed 2) and now considering 725/727 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 289/291 places, 725/727 transitions.
RANDOM walk for 40000 steps (867 resets) in 383 ms. (104 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (273 resets) in 256 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (257 resets) in 307 ms. (129 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (252 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (281 resets) in 143 ms. (277 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 152073 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 4
Probabilistic random walk after 152073 steps, saw 83982 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
// Phase 1: matrix 725 rows 289 cols
[2024-05-31 21:31:23] [INFO ] Computed 30 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/181 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 75/256 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 22/278 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 11/289 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 725/1014 variables, 289/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1014 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1014 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1014/1014 variables, and 319 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1179 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 142/144 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/181 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 75/256 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 22/278 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 11/289 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/289 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 725/1014 variables, 289/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1014 variables, 4/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/1014 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1014/1014 variables, and 323 constraints, problems are : Problem set: 0 solved, 4 unsolved in 883 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 2084ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1042 ms.
Support contains 2 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 725/725 transitions.
Applied a total of 0 rules in 10 ms. Remains 289 /289 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 289/289 places, 725/725 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 725/725 transitions.
Applied a total of 0 rules in 9 ms. Remains 289 /289 variables (removed 0) and now considering 725/725 (removed 0) transitions.
[2024-05-31 21:31:26] [INFO ] Invariant cache hit.
[2024-05-31 21:31:27] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-05-31 21:31:27] [INFO ] Invariant cache hit.
[2024-05-31 21:31:28] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2024-05-31 21:31:28] [INFO ] Redundant transitions in 34 ms returned []
Running 704 sub problems to find dead transitions.
[2024-05-31 21:31:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (OVERLAPS) 1/289 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-31 21:31:55] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/1014 variables, and 31 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 704/704 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 704 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/288 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/288 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 3 (OVERLAPS) 1/289 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 704 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 704 unsolved
[2024-05-31 21:32:19] [INFO ] Deduced a trap composed of 64 places in 421 ms of which 5 ms to minimize.
[2024-05-31 21:32:20] [INFO ] Deduced a trap composed of 61 places in 387 ms of which 4 ms to minimize.
[2024-05-31 21:32:22] [INFO ] Deduced a trap composed of 85 places in 448 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 704 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 1)
(s161 0)
(s162 1)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 289/1014 variables, and 34 constraints, problems are : Problem set: 0 solved, 704 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 0/704 constraints, Known Traps: 4/4 constraints]
After SMT, in 60615ms problems are : Problem set: 0 solved, 704 unsolved
Search for dead transitions found 0 dead transitions in 60625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61987 ms. Remains : 289/289 places, 725/725 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 16 ms. Remains 289 /289 variables (removed 0) and now considering 725/725 (removed 0) transitions.
Running SMT prover for 4 properties.
[2024-05-31 21:32:28] [INFO ] Invariant cache hit.
[2024-05-31 21:32:28] [INFO ] [Real]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-31 21:32:28] [INFO ] [Real]Absence check using 10 positive and 20 generalized place invariants in 22 ms returned sat
[2024-05-31 21:32:29] [INFO ] After 551ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 21:32:29] [INFO ] After 828ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :4
[2024-05-31 21:32:29] [INFO ] After 1195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 1229 ms.
FORMULA ASLink-PT-03b-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for ASLink-PT-03b-UpperBounds-06
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 727 rows 291 cols
[2024-05-31 21:32:30] [INFO ] Computed 30 invariants in 16 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (197 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 10001 steps (64 resets) in 17 ms. (555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:32:30] [INFO ] Invariant cache hit.
[2024-05-31 21:32:30] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2024-05-31 21:32:30] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 29 ms returned sat
[2024-05-31 21:32:30] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2024-05-31 21:32:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2024-05-31 21:32:30] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 16 ms returned sat
[2024-05-31 21:32:31] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-05-31 21:32:31] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 88 ms.
[2024-05-31 21:32:32] [INFO ] Added : 54 causal constraints over 11 iterations in 1005 ms. Result :sat
Minimization took 549 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 291 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p266) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 726/726 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 1792 edges and 290 vertex of which 289 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 289 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 287 transition count 723
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 287 transition count 721
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 285 transition count 721
Applied a total of 10 rules in 31 ms. Remains 285 /291 variables (removed 6) and now considering 721/726 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 285/291 places, 721/726 transitions.
// Phase 1: matrix 721 rows 285 cols
[2024-05-31 21:32:32] [INFO ] Computed 29 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21533 resets) in 2112 ms. (473 steps per ms)
BEST_FIRST walk for 1000001 steps (6997 resets) in 796 ms. (1254 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:32:35] [INFO ] Invariant cache hit.
[2024-05-31 21:32:35] [INFO ] [Real]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-31 21:32:35] [INFO ] [Real]Absence check using 12 positive and 17 generalized place invariants in 12 ms returned sat
[2024-05-31 21:32:36] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-05-31 21:32:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:32:36] [INFO ] [Nat]Absence check using 12 positive place invariants in 11 ms returned sat
[2024-05-31 21:32:36] [INFO ] [Nat]Absence check using 12 positive and 17 generalized place invariants in 16 ms returned sat
[2024-05-31 21:32:36] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2024-05-31 21:32:36] [INFO ] Computed and/alt/rep : 138/730/138 causal constraints (skipped 562 transitions) in 85 ms.
[2024-05-31 21:32:37] [INFO ] Added : 37 causal constraints over 8 iterations in 770 ms. Result :sat
Minimization took 1134 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 721/721 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 285/285 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 721/721 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-05-31 21:32:38] [INFO ] Invariant cache hit.
[2024-05-31 21:32:39] [INFO ] Implicit Places using invariants in 451 ms returned []
[2024-05-31 21:32:39] [INFO ] Invariant cache hit.
[2024-05-31 21:32:40] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1609 ms to find 0 implicit places.
[2024-05-31 21:32:40] [INFO ] Redundant transitions in 10 ms returned []
Running 700 sub problems to find dead transitions.
[2024-05-31 21:32:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-31 21:33:07] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/1006 variables, and 30 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-31 21:33:30] [INFO ] Deduced a trap composed of 54 places in 406 ms of which 5 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 85 places in 334 ms of which 4 ms to minimize.
[2024-05-31 21:33:31] [INFO ] Deduced a trap composed of 61 places in 366 ms of which 4 ms to minimize.
[2024-05-31 21:33:34] [INFO ] Deduced a trap composed of 79 places in 448 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/1006 variables, and 34 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 5/5 constraints]
After SMT, in 60691ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60704ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62349 ms. Remains : 285/285 places, 721/721 transitions.
RANDOM walk for 40000 steps (868 resets) in 216 ms. (184 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (265 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (277 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 276260 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 2
Probabilistic random walk after 276260 steps, saw 149613 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
[2024-05-31 21:33:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 124/192 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/209 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/260 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/282 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/284 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:33:44] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 721/1005 variables, 284/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1005 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/1006 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1006 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1006 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1006/1006 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 124/192 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/209 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/260 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/282 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/284 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:33:45] [INFO ] Deduced a trap composed of 13 places in 230 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 721/1005 variables, 284/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1005 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1005 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1006 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1006 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1006 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1006/1006 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2104ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 522 ms.
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 721/721 transitions.
Applied a total of 0 rules in 17 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 285/285 places, 721/721 transitions.
RANDOM walk for 40000 steps (894 resets) in 202 ms. (197 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (271 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (288 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 321749 steps, run timeout after 3001 ms. (steps per millisecond=107 ) properties seen :0 out of 2
Probabilistic random walk after 321749 steps, saw 175270 distinct states, run finished after 3001 ms. (steps per millisecond=107 ) properties seen :0
[2024-05-31 21:33:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 124/192 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/209 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/260 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/282 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/284 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:33:50] [INFO ] Deduced a trap composed of 24 places in 156 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 721/1005 variables, 284/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1005 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/1006 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1006 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 0/1006 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1006/1006 variables, and 315 constraints, problems are : Problem set: 0 solved, 2 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 11/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/55 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 13/68 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 124/192 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 17/209 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 51/260 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 22/282 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/282 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/284 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/284 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 21:33:51] [INFO ] Deduced a trap composed of 13 places in 215 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/284 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/284 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 721/1005 variables, 284/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1005 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1005 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 1/1006 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1006 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 0/1006 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1006/1006 variables, and 318 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1120 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 2050ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 642 ms.
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 721/721 transitions.
Applied a total of 0 rules in 17 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 285/285 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 721/721 transitions.
Applied a total of 0 rules in 15 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-05-31 21:33:52] [INFO ] Invariant cache hit.
[2024-05-31 21:33:53] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-31 21:33:53] [INFO ] Invariant cache hit.
[2024-05-31 21:33:54] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1713 ms to find 0 implicit places.
[2024-05-31 21:33:54] [INFO ] Redundant transitions in 10 ms returned []
Running 700 sub problems to find dead transitions.
[2024-05-31 21:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-31 21:34:21] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/1006 variables, and 30 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-31 21:34:44] [INFO ] Deduced a trap composed of 54 places in 434 ms of which 4 ms to minimize.
[2024-05-31 21:34:45] [INFO ] Deduced a trap composed of 85 places in 317 ms of which 4 ms to minimize.
[2024-05-31 21:34:45] [INFO ] Deduced a trap composed of 61 places in 378 ms of which 11 ms to minimize.
[2024-05-31 21:34:48] [INFO ] Deduced a trap composed of 79 places in 401 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 285/1006 variables, and 34 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 0/700 constraints, Known Traps: 5/5 constraints]
After SMT, in 60627ms problems are : Problem set: 0 solved, 700 unsolved
Search for dead transitions found 0 dead transitions in 60640ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62388 ms. Remains : 285/285 places, 721/721 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-31 21:34:55] [INFO ] Invariant cache hit.
[2024-05-31 21:34:55] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-31 21:34:55] [INFO ] [Real]Absence check using 12 positive and 17 generalized place invariants in 11 ms returned sat
[2024-05-31 21:34:55] [INFO ] After 447ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-31 21:34:55] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:55] [INFO ] [Nat]Absence check using 12 positive and 17 generalized place invariants in 10 ms returned sat
[2024-05-31 21:34:56] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-31 21:34:56] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-05-31 21:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
TRAPS : Iteration 1
[2024-05-31 21:34:56] [INFO ] After 554ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-31 21:34:56] [INFO ] After 697ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1161 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1]
Ending property specific reduction for ASLink-PT-03b-UpperBounds-06 in 146414 ms.
Starting property specific reduction for ASLink-PT-03b-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
// Phase 1: matrix 727 rows 291 cols
[2024-05-31 21:34:56] [INFO ] Computed 30 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10000 steps (223 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10001 steps (74 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:34:56] [INFO ] Invariant cache hit.
[2024-05-31 21:34:56] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2024-05-31 21:34:56] [INFO ] [Real]Absence check using 8 positive and 22 generalized place invariants in 14 ms returned sat
[2024-05-31 21:34:56] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-31 21:34:56] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 58 ms.
[2024-05-31 21:34:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:34:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2024-05-31 21:34:57] [INFO ] [Nat]Absence check using 8 positive and 22 generalized place invariants in 11 ms returned sat
[2024-05-31 21:34:57] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2024-05-31 21:34:57] [INFO ] Computed and/alt/rep : 144/737/144 causal constraints (skipped 562 transitions) in 51 ms.
[2024-05-31 21:34:57] [INFO ] Added : 10 causal constraints over 2 iterations in 205 ms. Result :sat
Minimization took 509 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 291 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p661) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 726/726 transitions.
Reduce places removed 1 places and 1 transitions.
Graph (complete) has 1792 edges and 290 vertex of which 289 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 4 place count 289 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 287 transition count 723
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 287 transition count 721
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 285 transition count 721
Applied a total of 10 rules in 17 ms. Remains 285 /291 variables (removed 6) and now considering 721/726 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 285/291 places, 721/726 transitions.
// Phase 1: matrix 721 rows 285 cols
[2024-05-31 21:34:58] [INFO ] Computed 29 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21506 resets) in 1693 ms. (590 steps per ms)
BEST_FIRST walk for 1000000 steps (6888 resets) in 765 ms. (1305 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:35:00] [INFO ] Invariant cache hit.
[2024-05-31 21:35:00] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:35:00] [INFO ] [Real]Absence check using 11 positive and 18 generalized place invariants in 9 ms returned sat
[2024-05-31 21:35:00] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2024-05-31 21:35:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:35:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2024-05-31 21:35:00] [INFO ] [Nat]Absence check using 11 positive and 18 generalized place invariants in 9 ms returned sat
[2024-05-31 21:35:01] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2024-05-31 21:35:01] [INFO ] Computed and/alt/rep : 138/730/138 causal constraints (skipped 562 transitions) in 56 ms.
[2024-05-31 21:35:01] [INFO ] Added : 31 causal constraints over 7 iterations in 395 ms. Result :sat
Minimization took 604 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 721/721 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 285/285 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 721/721 transitions.
Applied a total of 0 rules in 11 ms. Remains 285 /285 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2024-05-31 21:35:02] [INFO ] Invariant cache hit.
[2024-05-31 21:35:02] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-31 21:35:02] [INFO ] Invariant cache hit.
[2024-05-31 21:35:03] [INFO ] Implicit Places using invariants and state equation in 819 ms returned []
Implicit Place search using SMT with State Equation took 1198 ms to find 0 implicit places.
[2024-05-31 21:35:03] [INFO ] Redundant transitions in 6 ms returned []
Running 700 sub problems to find dead transitions.
[2024-05-31 21:35:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 700 unsolved
[2024-05-31 21:35:20] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
[2024-05-31 21:35:23] [INFO ] Deduced a trap composed of 60 places in 153 ms of which 3 ms to minimize.
[2024-05-31 21:35:24] [INFO ] Deduced a trap composed of 61 places in 239 ms of which 2 ms to minimize.
[2024-05-31 21:35:26] [INFO ] Deduced a trap composed of 80 places in 255 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/1006 variables, and 33 constraints, problems are : Problem set: 0 solved, 700 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 700/700 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 700 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 3 (OVERLAPS) 2/285 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 700 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 700 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
At refinement iteration 7 (OVERLAPS) 721/1006 variables, 285/318 constraints. Problems are: Problem set: 96 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1006/1006 variables, and 922 constraints, problems are : Problem set: 96 solved, 604 unsolved in 30108 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 604/700 constraints, Known Traps: 4/4 constraints]
After SMT, in 60531ms problems are : Problem set: 96 solved, 604 unsolved
Search for dead transitions found 96 dead transitions in 60539ms
Found 96 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 96 transitions
Dead transitions reduction (with SMT) removed 96 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 285/285 places, 625/721 transitions.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2024-05-31 21:36:04] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61796 ms. Remains : 285/285 places, 625/721 transitions.
// Phase 1: matrix 625 rows 285 cols
[2024-05-31 21:36:04] [INFO ] Computed 29 invariants in 15 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21563 resets) in 1816 ms. (550 steps per ms)
BEST_FIRST walk for 1000000 steps (6846 resets) in 794 ms. (1257 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:36:06] [INFO ] Invariant cache hit.
[2024-05-31 21:36:06] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-31 21:36:06] [INFO ] [Real]Absence check using 10 positive and 19 generalized place invariants in 8 ms returned sat
[2024-05-31 21:36:07] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-31 21:36:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:36:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 7 ms returned sat
[2024-05-31 21:36:07] [INFO ] [Nat]Absence check using 10 positive and 19 generalized place invariants in 9 ms returned sat
[2024-05-31 21:36:07] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2024-05-31 21:36:07] [INFO ] Computed and/alt/rep : 250/1238/250 causal constraints (skipped 354 transitions) in 55 ms.
[2024-05-31 21:36:08] [INFO ] Added : 57 causal constraints over 13 iterations in 607 ms. Result :sat
Minimization took 477 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 625/625 transitions.
Applied a total of 0 rules in 7 ms. Remains 285 /285 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 285/285 places, 625/625 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 285 /285 variables (removed 0) and now considering 625/625 (removed 0) transitions.
[2024-05-31 21:36:08] [INFO ] Invariant cache hit.
[2024-05-31 21:36:09] [INFO ] Implicit Places using invariants in 565 ms returned []
[2024-05-31 21:36:09] [INFO ] Invariant cache hit.
[2024-05-31 21:36:10] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1402 ms to find 0 implicit places.
[2024-05-31 21:36:10] [INFO ] Redundant transitions in 5 ms returned []
Running 604 sub problems to find dead transitions.
[2024-05-31 21:36:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-31 21:36:14] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:36:15] [INFO ] Deduced a trap composed of 34 places in 106 ms of which 2 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
[2024-05-31 21:36:15] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2024-05-31 21:36:15] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
Problem TDEAD153 is UNSAT
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 1 ms to minimize.
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 1 ms to minimize.
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-05-31 21:36:16] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
[2024-05-31 21:36:17] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
Problem TDEAD262 is UNSAT
[2024-05-31 21:36:17] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
[2024-05-31 21:36:17] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
Problem TDEAD266 is UNSAT
[2024-05-31 21:36:17] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 1 ms to minimize.
Problem TDEAD267 is UNSAT
[2024-05-31 21:36:17] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 16 ms to minimize.
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
[2024-05-31 21:36:17] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 1 ms to minimize.
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
[2024-05-31 21:36:17] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
[2024-05-31 21:36:18] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 1 ms to minimize.
Problem TDEAD294 is UNSAT
[2024-05-31 21:36:18] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 1 ms to minimize.
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 20/43 constraints. Problems are: Problem set: 101 solved, 503 unsolved
[2024-05-31 21:36:20] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
Problem TDEAD297 is UNSAT
[2024-05-31 21:36:22] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD573 is UNSAT
[2024-05-31 21:36:22] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
Problem TDEAD574 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 3/46 constraints. Problems are: Problem set: 108 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/46 constraints. Problems are: Problem set: 108 solved, 496 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 4/50 constraints. Problems are: Problem set: 108 solved, 496 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 2/52 constraints. Problems are: Problem set: 108 solved, 496 unsolved
[2024-05-31 21:36:32] [INFO ] Deduced a trap composed of 28 places in 198 ms of which 3 ms to minimize.
[2024-05-31 21:36:33] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2024-05-31 21:36:35] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
Problem TDEAD406 is UNSAT
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
Problem TDEAD414 is UNSAT
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
[2024-05-31 21:36:36] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 3 ms to minimize.
[2024-05-31 21:36:37] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 3 ms to minimize.
[2024-05-31 21:36:37] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 3 ms to minimize.
[2024-05-31 21:36:38] [INFO ] Deduced a trap composed of 102 places in 234 ms of which 3 ms to minimize.
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 85 places in 258 ms of which 3 ms to minimize.
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 1 ms to minimize.
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
[2024-05-31 21:36:39] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 1 ms to minimize.
Problem TDEAD621 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 13/65 constraints. Problems are: Problem set: 127 solved, 477 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/910 variables, and 65 constraints, problems are : Problem set: 127 solved, 477 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 127 solved, 477 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 6/6 constraints. Problems are: Problem set: 127 solved, 477 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 17/23 constraints. Problems are: Problem set: 127 solved, 477 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/283 variables, 29/52 constraints. Problems are: Problem set: 127 solved, 477 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 0/52 constraints. Problems are: Problem set: 127 solved, 477 unsolved
At refinement iteration 4 (OVERLAPS) 2/285 variables, 4/56 constraints. Problems are: Problem set: 127 solved, 477 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 2/58 constraints. Problems are: Problem set: 127 solved, 477 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 7/65 constraints. Problems are: Problem set: 127 solved, 477 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 0/65 constraints. Problems are: Problem set: 127 solved, 477 unsolved
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
At refinement iteration 8 (OVERLAPS) 625/910 variables, 285/350 constraints. Problems are: Problem set: 234 solved, 370 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 910/910 variables, and 720 constraints, problems are : Problem set: 234 solved, 370 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 370/604 constraints, Known Traps: 36/36 constraints]
After SMT, in 60382ms problems are : Problem set: 234 solved, 370 unsolved
Search for dead transitions found 234 dead transitions in 60390ms
Found 234 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 234 transitions
Dead transitions reduction (with SMT) removed 234 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 285/285 places, 391/625 transitions.
Ensure Unique test removed 9 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 274 transition count 382
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 29 place count 265 transition count 382
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 29 place count 265 transition count 380
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 263 transition count 380
Applied a total of 33 rules in 10 ms. Remains 263 /285 variables (removed 22) and now considering 380/391 (removed 11) transitions.
// Phase 1: matrix 380 rows 263 cols
[2024-05-31 21:37:10] [INFO ] Computed 36 invariants in 3 ms
[2024-05-31 21:37:10] [INFO ] Implicit Places using invariants in 362 ms returned [13, 69, 71, 73, 75, 77, 79, 101, 102, 170, 172, 174, 176, 178, 180]
[2024-05-31 21:37:10] [INFO ] Actually due to overlaps returned [13, 69, 71, 73, 75, 77, 79, 102]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 372 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 255/285 places, 380/625 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 255 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 254 transition count 379
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 248 transition count 373
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 248 transition count 372
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 247 transition count 372
Applied a total of 16 rules in 16 ms. Remains 247 /255 variables (removed 8) and now considering 372/380 (removed 8) transitions.
// Phase 1: matrix 372 rows 247 cols
[2024-05-31 21:37:10] [INFO ] Computed 28 invariants in 2 ms
[2024-05-31 21:37:11] [INFO ] Implicit Places using invariants in 431 ms returned []
[2024-05-31 21:37:11] [INFO ] Invariant cache hit.
[2024-05-31 21:37:11] [INFO ] Implicit Places using invariants and state equation in 600 ms returned [15, 17, 19, 21, 94, 96, 128, 130, 132, 134, 136, 138, 140]
Discarding 13 places :
Implicit Place search using SMT with State Equation took 1055 ms to find 13 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 234/285 places, 372/625 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 226 transition count 316
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 226 transition count 316
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 226 transition count 313
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 23 place count 223 transition count 312
Applied a total of 23 rules in 13 ms. Remains 223 /234 variables (removed 11) and now considering 312/372 (removed 60) transitions.
// Phase 1: matrix 312 rows 223 cols
[2024-05-31 21:37:12] [INFO ] Computed 26 invariants in 2 ms
[2024-05-31 21:37:12] [INFO ] Implicit Places using invariants in 304 ms returned []
[2024-05-31 21:37:12] [INFO ] Invariant cache hit.
[2024-05-31 21:37:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:37:12] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 223/285 places, 312/625 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 64139 ms. Remains : 223/285 places, 312/625 transitions.
[2024-05-31 21:37:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (21620 resets) in 1493 ms. (669 steps per ms)
BEST_FIRST walk for 1000000 steps (6872 resets) in 672 ms. (1485 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:37:15] [INFO ] Invariant cache hit.
[2024-05-31 21:37:15] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-31 21:37:15] [INFO ] [Real]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-31 21:37:15] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-31 21:37:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:37:15] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 3 ms to minimize.
[2024-05-31 21:37:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:37:15] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-31 21:37:15] [INFO ] [Nat]Absence check using 11 positive and 15 generalized place invariants in 7 ms returned sat
[2024-05-31 21:37:15] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2024-05-31 21:37:15] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 2 ms to minimize.
[2024-05-31 21:37:15] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-31 21:37:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2024-05-31 21:37:15] [INFO ] Computed and/alt/rep : 199/765/199 causal constraints (skipped 92 transitions) in 22 ms.
[2024-05-31 21:37:16] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-31 21:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2024-05-31 21:37:16] [INFO ] Added : 48 causal constraints over 12 iterations in 460 ms. Result :sat
Minimization took 236 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 312/312 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 223/223 places, 312/312 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 223 /223 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2024-05-31 21:37:16] [INFO ] Invariant cache hit.
[2024-05-31 21:37:17] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-31 21:37:17] [INFO ] Invariant cache hit.
[2024-05-31 21:37:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:37:17] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2024-05-31 21:37:17] [INFO ] Redundant transitions in 14 ms returned []
Running 291 sub problems to find dead transitions.
[2024-05-31 21:37:17] [INFO ] Invariant cache hit.
[2024-05-31 21:37:17] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem TDEAD70 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 6/6 constraints. Problems are: Problem set: 8 solved, 283 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD285 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 12/18 constraints. Problems are: Problem set: 11 solved, 280 unsolved
[2024-05-31 21:37:19] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 1/19 constraints. Problems are: Problem set: 11 solved, 280 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/19 constraints. Problems are: Problem set: 11 solved, 280 unsolved
At refinement iteration 4 (OVERLAPS) 2/223 variables, 5/24 constraints. Problems are: Problem set: 11 solved, 280 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 3/27 constraints. Problems are: Problem set: 11 solved, 280 unsolved
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 2 ms to minimize.
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-31 21:37:23] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:37:24] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
[2024-05-31 21:37:24] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:37:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
Problem TDEAD261 is UNSAT
Problem TDEAD278 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 7/34 constraints. Problems are: Problem set: 24 solved, 267 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 0/34 constraints. Problems are: Problem set: 24 solved, 267 unsolved
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
At refinement iteration 8 (OVERLAPS) 312/535 variables, 223/257 constraints. Problems are: Problem set: 55 solved, 236 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/535 variables, 2/259 constraints. Problems are: Problem set: 55 solved, 236 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 0/259 constraints. Problems are: Problem set: 55 solved, 236 unsolved
At refinement iteration 11 (OVERLAPS) 0/535 variables, 0/259 constraints. Problems are: Problem set: 55 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 535/535 variables, and 259 constraints, problems are : Problem set: 55 solved, 236 unsolved in 17931 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 223/223 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 55 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 6/6 constraints. Problems are: Problem set: 55 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 12/18 constraints. Problems are: Problem set: 55 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 6/24 constraints. Problems are: Problem set: 55 solved, 236 unsolved
[2024-05-31 21:37:36] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
Problem TDEAD75 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/25 constraints. Problems are: Problem set: 56 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/25 constraints. Problems are: Problem set: 56 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 2/223 variables, 5/30 constraints. Problems are: Problem set: 56 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 3/33 constraints. Problems are: Problem set: 56 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 2/35 constraints. Problems are: Problem set: 56 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/35 constraints. Problems are: Problem set: 56 solved, 235 unsolved
At refinement iteration 9 (OVERLAPS) 312/535 variables, 223/258 constraints. Problems are: Problem set: 56 solved, 235 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 2/260 constraints. Problems are: Problem set: 56 solved, 235 unsolved
Problem TDEAD77 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 235/495 constraints. Problems are: Problem set: 58 solved, 233 unsolved
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 2 ms to minimize.
[2024-05-31 21:37:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/535 variables, 2/497 constraints. Problems are: Problem set: 58 solved, 233 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/535 variables, 0/497 constraints. Problems are: Problem set: 58 solved, 233 unsolved
[2024-05-31 21:38:01] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/535 variables, 1/498 constraints. Problems are: Problem set: 58 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 535/535 variables, and 498 constraints, problems are : Problem set: 58 solved, 233 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 223/223 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 235/291 constraints, Known Traps: 12/12 constraints]
After SMT, in 48065ms problems are : Problem set: 58 solved, 233 unsolved
Search for dead transitions found 58 dead transitions in 48068ms
Found 58 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 58 transitions
Dead transitions reduction (with SMT) removed 58 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 223/223 places, 254/312 transitions.
Ensure Unique test removed 13 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 208 transition count 231
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 61 place count 185 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 61 place count 185 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 184 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 184 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 183 transition count 229
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 183 transition count 229
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 182 transition count 229
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 182 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 69 place count 181 transition count 228
Applied a total of 69 rules in 18 ms. Remains 181 /223 variables (removed 42) and now considering 228/254 (removed 26) transitions.
// Phase 1: matrix 228 rows 181 cols
[2024-05-31 21:38:05] [INFO ] Computed 26 invariants in 2 ms
[2024-05-31 21:38:05] [INFO ] Implicit Places using invariants in 218 ms returned [47, 91]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 239 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 179/223 places, 228/312 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 179 transition count 221
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 172 transition count 221
Applied a total of 14 rules in 4 ms. Remains 172 /179 variables (removed 7) and now considering 221/228 (removed 7) transitions.
// Phase 1: matrix 221 rows 172 cols
[2024-05-31 21:38:05] [INFO ] Computed 24 invariants in 1 ms
[2024-05-31 21:38:06] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-31 21:38:06] [INFO ] Invariant cache hit.
[2024-05-31 21:38:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 21:38:06] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 172/223 places, 221/312 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 49620 ms. Remains : 172/223 places, 221/312 transitions.
[2024-05-31 21:38:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (27058 resets) in 1520 ms. (657 steps per ms)
BEST_FIRST walk for 1000001 steps (7349 resets) in 641 ms. (1557 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-31 21:38:08] [INFO ] Invariant cache hit.
[2024-05-31 21:38:08] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-31 21:38:08] [INFO ] [Real]Absence check using 6 positive and 18 generalized place invariants in 7 ms returned sat
[2024-05-31 21:38:08] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-05-31 21:38:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 21:38:08] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2024-05-31 21:38:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:38:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-31 21:38:08] [INFO ] [Nat]Absence check using 6 positive and 18 generalized place invariants in 7 ms returned sat
[2024-05-31 21:38:08] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-31 21:38:08] [INFO ] [Nat]Added 5 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:38:08] [INFO ] Computed and/alt/rep : 119/335/119 causal constraints (skipped 81 transitions) in 16 ms.
[2024-05-31 21:38:09] [INFO ] Added : 21 causal constraints over 5 iterations in 119 ms. Result :sat
Minimization took 189 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[1]
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 221/221 transitions.
Applied a total of 0 rules in 5 ms. Remains 172 /172 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 172/172 places, 221/221 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 172 /172 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2024-05-31 21:38:09] [INFO ] Invariant cache hit.
[2024-05-31 21:38:09] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-31 21:38:09] [INFO ] Invariant cache hit.
[2024-05-31 21:38:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-31 21:38:09] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-31 21:38:09] [INFO ] Redundant transitions in 3 ms returned []
Running 200 sub problems to find dead transitions.
[2024-05-31 21:38:09] [INFO ] Invariant cache hit.
[2024-05-31 21:38:09] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 200 unsolved
[2024-05-31 21:38:12] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 1/172 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Problem TDEAD217 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
At refinement iteration 8 (OVERLAPS) 221/393 variables, 172/197 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 5/202 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 0/202 constraints. Problems are: Problem set: 3 solved, 197 unsolved
[2024-05-31 21:38:19] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/393 variables, 1/203 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 13 (OVERLAPS) 0/393 variables, 0/203 constraints. Problems are: Problem set: 3 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 203 constraints, problems are : Problem set: 3 solved, 197 unsolved in 13897 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 172/172 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 3 solved, 197 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 15/19 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/19 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 3 (OVERLAPS) 1/171 variables, 2/21 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 2/23 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/171 variables, 0/23 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 6 (OVERLAPS) 1/172 variables, 3/26 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/26 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 8 (OVERLAPS) 221/393 variables, 172/198 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 5/203 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/393 variables, 197/400 constraints. Problems are: Problem set: 3 solved, 197 unsolved
[2024-05-31 21:38:28] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/393 variables, 1/401 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/401 constraints. Problems are: Problem set: 3 solved, 197 unsolved
At refinement iteration 13 (OVERLAPS) 0/393 variables, 0/401 constraints. Problems are: Problem set: 3 solved, 197 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 401 constraints, problems are : Problem set: 3 solved, 197 unsolved in 16890 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 172/172 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 197/200 constraints, Known Traps: 3/3 constraints]
After SMT, in 30865ms problems are : Problem set: 3 solved, 197 unsolved
Search for dead transitions found 3 dead transitions in 30868ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 172/172 places, 218/221 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 171 transition count 216
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 169 transition count 216
Applied a total of 5 rules in 5 ms. Remains 169 /172 variables (removed 3) and now considering 216/218 (removed 2) transitions.
// Phase 1: matrix 216 rows 169 cols
[2024-05-31 21:38:40] [INFO ] Computed 26 invariants in 2 ms
[2024-05-31 21:38:40] [INFO ] Implicit Places using invariants in 224 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 226 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 168/172 places, 216/221 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 168 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 165 transition count 213
Applied a total of 6 rules in 8 ms. Remains 165 /168 variables (removed 3) and now considering 213/216 (removed 3) transitions.
// Phase 1: matrix 213 rows 165 cols
[2024-05-31 21:38:40] [INFO ] Computed 25 invariants in 1 ms
[2024-05-31 21:38:41] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-31 21:38:41] [INFO ] Invariant cache hit.
[2024-05-31 21:38:41] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 165/172 places, 213/221 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 32149 ms. Remains : 165/172 places, 213/221 transitions.
[2024-05-31 21:38:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[1]
FORMULA ASLink-PT-03b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (27131 resets) in 1492 ms. (669 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for ASLink-PT-03b-UpperBounds-14 in 226518 ms.
[2024-05-31 21:38:43] [INFO ] Flatten gal took : 178 ms
[2024-05-31 21:38:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2024-05-31 21:38:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 291 places, 727 transitions and 2970 arcs took 20 ms.
Total runtime 632188 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-03b-UpperBounds-06

BK_STOP 1717191523774

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-03b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117700053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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