Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592700165.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-10b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592700165
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 13:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 26 13:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.4M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678505973909

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10b
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-11 03:39:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 03:39:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:39:36] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2023-03-11 03:39:36] [INFO ] Transformed 4410 places.
[2023-03-11 03:39:36] [INFO ] Transformed 5405 transitions.
[2023-03-11 03:39:36] [INFO ] Found NUPN structural information;
[2023-03-11 03:39:36] [INFO ] Parsed PT model containing 4410 places and 5405 transitions and 16377 arcs in 386 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 5405 rows 4410 cols
[2023-03-11 03:39:37] [INFO ] Computed 433 place invariants in 249 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 16) seen :6
FORMULA ASLink-PT-10b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
[2023-03-11 03:39:37] [INFO ] Invariant cache hit.
[2023-03-11 03:39:38] [INFO ] [Real]Absence check using 102 positive place invariants in 165 ms returned sat
[2023-03-11 03:39:39] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 209 ms returned sat
[2023-03-11 03:39:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:42] [INFO ] [Real]Absence check using state equation in 3782 ms returned unknown
[2023-03-11 03:39:44] [INFO ] [Real]Absence check using 102 positive place invariants in 182 ms returned sat
[2023-03-11 03:39:44] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 257 ms returned sat
[2023-03-11 03:39:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:47] [INFO ] [Real]Absence check using state equation in 3492 ms returned unknown
[2023-03-11 03:39:48] [INFO ] [Real]Absence check using 102 positive place invariants in 118 ms returned sat
[2023-03-11 03:39:49] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 204 ms returned sat
[2023-03-11 03:39:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:52] [INFO ] [Real]Absence check using state equation in 3763 ms returned unknown
[2023-03-11 03:39:53] [INFO ] [Real]Absence check using 102 positive place invariants in 119 ms returned sat
[2023-03-11 03:39:54] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 398 ms returned sat
[2023-03-11 03:39:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:39:57] [INFO ] [Real]Absence check using state equation in 3680 ms returned unknown
[2023-03-11 03:39:58] [INFO ] [Real]Absence check using 102 positive place invariants in 123 ms returned sat
[2023-03-11 03:39:59] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 316 ms returned sat
[2023-03-11 03:39:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:40:04] [INFO ] [Real]Absence check using 102 positive place invariants in 136 ms returned sat
[2023-03-11 03:40:04] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 203 ms returned sat
[2023-03-11 03:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:07] [INFO ] [Real]Absence check using state equation in 3616 ms returned unknown
[2023-03-11 03:40:08] [INFO ] [Real]Absence check using 102 positive place invariants in 141 ms returned sat
[2023-03-11 03:40:09] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 343 ms returned sat
[2023-03-11 03:40:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-11 03:40:14] [INFO ] [Real]Absence check using 102 positive place invariants in 248 ms returned sat
[2023-03-11 03:40:14] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 179 ms returned sat
[2023-03-11 03:40:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:18] [INFO ] [Real]Absence check using state equation in 3829 ms returned unknown
[2023-03-11 03:40:18] [INFO ] [Real]Absence check using 102 positive place invariants in 92 ms returned sat
[2023-03-11 03:40:19] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 155 ms returned sat
[2023-03-11 03:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:23] [INFO ] [Real]Absence check using state equation in 4006 ms returned unknown
[2023-03-11 03:40:24] [INFO ] [Real]Absence check using 102 positive place invariants in 366 ms returned sat
[2023-03-11 03:40:25] [INFO ] [Real]Absence check using 102 positive and 331 generalized place invariants in 948 ms returned sat
[2023-03-11 03:40:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:899)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2618)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java: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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 4410 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4410/4410 places, 5405/5405 transitions.
Drop transitions removed 1029 transitions
Trivial Post-agglo rules discarded 1029 transitions
Performed 1029 trivial Post agglomeration. Transition count delta: 1029
Iterating post reduction 0 with 1029 rules applied. Total rules applied 1029 place count 4410 transition count 4376
Reduce places removed 1029 places and 0 transitions.
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 1075 rules applied. Total rules applied 2104 place count 3381 transition count 4330
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 2119 place count 3369 transition count 4327
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 2122 place count 3366 transition count 4327
Performed 1025 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1025 Pre rules applied. Total rules applied 2122 place count 3366 transition count 3302
Deduced a syphon composed of 1025 places in 9 ms
Ensure Unique test removed 103 places
Reduce places removed 1128 places and 0 transitions.
Iterating global reduction 4 with 2153 rules applied. Total rules applied 4275 place count 2238 transition count 3302
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 4 with 72 rules applied. Total rules applied 4347 place count 2228 transition count 3240
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 5 with 62 rules applied. Total rules applied 4409 place count 2166 transition count 3240
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 4409 place count 2166 transition count 3200
Deduced a syphon composed of 40 places in 22 ms
Ensure Unique test removed 40 places
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 4529 place count 2086 transition count 3200
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 40 Pre rules applied. Total rules applied 4529 place count 2086 transition count 3160
Deduced a syphon composed of 40 places in 21 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 6 with 80 rules applied. Total rules applied 4609 place count 2046 transition count 3160
Discarding 140 places :
Symmetric choice reduction at 6 with 140 rule applications. Total rules 4749 place count 1906 transition count 3020
Iterating global reduction 6 with 140 rules applied. Total rules applied 4889 place count 1906 transition count 3020
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 4890 place count 1906 transition count 3019
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 46 Pre rules applied. Total rules applied 4890 place count 1906 transition count 2973
Deduced a syphon composed of 46 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 7 with 93 rules applied. Total rules applied 4983 place count 1859 transition count 2973
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 4983 place count 1859 transition count 2972
Deduced a syphon composed of 1 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 4986 place count 1857 transition count 2972
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 4997 place count 1846 transition count 2903
Iterating global reduction 7 with 11 rules applied. Total rules applied 5008 place count 1846 transition count 2903
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 5008 place count 1846 transition count 2895
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 5024 place count 1838 transition count 2895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5025 place count 1837 transition count 2887
Iterating global reduction 7 with 1 rules applied. Total rules applied 5026 place count 1837 transition count 2887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5027 place count 1836 transition count 2879
Iterating global reduction 7 with 1 rules applied. Total rules applied 5028 place count 1836 transition count 2879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5029 place count 1835 transition count 2871
Iterating global reduction 7 with 1 rules applied. Total rules applied 5030 place count 1835 transition count 2871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5031 place count 1834 transition count 2863
Iterating global reduction 7 with 1 rules applied. Total rules applied 5032 place count 1834 transition count 2863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5033 place count 1833 transition count 2855
Iterating global reduction 7 with 1 rules applied. Total rules applied 5034 place count 1833 transition count 2855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5035 place count 1832 transition count 2847
Iterating global reduction 7 with 1 rules applied. Total rules applied 5036 place count 1832 transition count 2847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5037 place count 1831 transition count 2839
Iterating global reduction 7 with 1 rules applied. Total rules applied 5038 place count 1831 transition count 2839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5039 place count 1830 transition count 2831
Iterating global reduction 7 with 1 rules applied. Total rules applied 5040 place count 1830 transition count 2831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5041 place count 1829 transition count 2823
Iterating global reduction 7 with 1 rules applied. Total rules applied 5042 place count 1829 transition count 2823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5043 place count 1828 transition count 2815
Iterating global reduction 7 with 1 rules applied. Total rules applied 5044 place count 1828 transition count 2815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5045 place count 1827 transition count 2807
Iterating global reduction 7 with 1 rules applied. Total rules applied 5046 place count 1827 transition count 2807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5047 place count 1826 transition count 2799
Iterating global reduction 7 with 1 rules applied. Total rules applied 5048 place count 1826 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5049 place count 1825 transition count 2791
Iterating global reduction 7 with 1 rules applied. Total rules applied 5050 place count 1825 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5051 place count 1824 transition count 2783
Iterating global reduction 7 with 1 rules applied. Total rules applied 5052 place count 1824 transition count 2783
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5053 place count 1823 transition count 2775
Iterating global reduction 7 with 1 rules applied. Total rules applied 5054 place count 1823 transition count 2775
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5055 place count 1822 transition count 2767
Iterating global reduction 7 with 1 rules applied. Total rules applied 5056 place count 1822 transition count 2767
Performed 259 Post agglomeration using F-continuation condition.Transition count delta: 259
Deduced a syphon composed of 259 places in 8 ms
Reduce places removed 259 places and 0 transitions.
Iterating global reduction 7 with 518 rules applied. Total rules applied 5574 place count 1563 transition count 2508
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5575 place count 1562 transition count 2507
Iterating global reduction 7 with 1 rules applied. Total rules applied 5576 place count 1562 transition count 2507
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 5577 place count 1561 transition count 2506
Iterating global reduction 7 with 1 rules applied. Total rules applied 5578 place count 1561 transition count 2506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 7 with 2 rules applied. Total rules applied 5580 place count 1560 transition count 2505
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 5582 place count 1559 transition count 2514
Free-agglomeration rule applied 11 times.
Iterating global reduction 8 with 11 rules applied. Total rules applied 5593 place count 1559 transition count 2503
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 5604 place count 1548 transition count 2503
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 9 with 12 rules applied. Total rules applied 5616 place count 1548 transition count 2491
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 5628 place count 1536 transition count 2491
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 5629 place count 1536 transition count 2491
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 5630 place count 1535 transition count 2490
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 10 with 30 rules applied. Total rules applied 5660 place count 1515 transition count 2480
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 11 with 10 rules applied. Total rules applied 5670 place count 1505 transition count 2480
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 29 Pre rules applied. Total rules applied 5670 place count 1505 transition count 2451
Deduced a syphon composed of 29 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 12 with 59 rules applied. Total rules applied 5729 place count 1475 transition count 2451
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 12 with 11 rules applied. Total rules applied 5740 place count 1464 transition count 2451
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 5740 place count 1464 transition count 2450
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 5742 place count 1463 transition count 2450
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 6 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 13 with 42 rules applied. Total rules applied 5784 place count 1442 transition count 2429
Discarding 10 places :
Symmetric choice reduction at 13 with 10 rule applications. Total rules 5794 place count 1432 transition count 2419
Iterating global reduction 13 with 10 rules applied. Total rules applied 5804 place count 1432 transition count 2419
Free-agglomeration rule applied 10 times.
Iterating global reduction 13 with 10 rules applied. Total rules applied 5814 place count 1432 transition count 2409
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 13 with 10 rules applied. Total rules applied 5824 place count 1422 transition count 2409
Applied a total of 5824 rules in 3623 ms. Remains 1422 /4410 variables (removed 2988) and now considering 2409/5405 (removed 2996) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3623 ms. Remains : 1422/4410 places, 2409/5405 transitions.
// Phase 1: matrix 2409 rows 1422 cols
[2023-03-11 03:40:31] [INFO ] Computed 245 place invariants in 75 ms
Incomplete random walk after 1000000 steps, including 9494 resets, run finished after 4884 ms. (steps per millisecond=204 ) properties (out of 10) seen :3
FORMULA ASLink-PT-10b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-10b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 925 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 916 resets, run finished after 1878 ms. (steps per millisecond=532 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 926 resets, run finished after 1788 ms. (steps per millisecond=559 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 924 resets, run finished after 1915 ms. (steps per millisecond=522 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 925 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 914 resets, run finished after 2005 ms. (steps per millisecond=498 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 918 resets, run finished after 1938 ms. (steps per millisecond=515 ) properties (out of 7) seen :0
[2023-03-11 03:40:50] [INFO ] Invariant cache hit.
[2023-03-11 03:40:50] [INFO ] [Real]Absence check using 66 positive place invariants in 55 ms returned sat
[2023-03-11 03:40:50] [INFO ] [Real]Absence check using 66 positive and 179 generalized place invariants in 83 ms returned sat
[2023-03-11 03:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:51] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2023-03-11 03:40:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:40:51] [INFO ] [Nat]Absence check using 66 positive place invariants in 86 ms returned sat
[2023-03-11 03:40:52] [INFO ] [Nat]Absence check using 66 positive and 179 generalized place invariants in 49 ms returned sat
[2023-03-11 03:40:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:40:53] [INFO ] [Nat]Absence check using state equation in 1607 ms returned sat
[2023-03-11 03:40:54] [INFO ] Computed and/alt/rep : 962/3695/962 causal constraints (skipped 1398 transitions) in 200 ms.
[2023-03-11 03:41:14] [INFO ] Added : 555 causal constraints over 111 iterations in 20284 ms.(timeout) Result :sat
Minimization took 1083 ms.
[2023-03-11 03:41:15] [INFO ] [Real]Absence check using 66 positive place invariants in 103 ms returned sat
[2023-03-11 03:41:15] [INFO ] [Real]Absence check using 66 positive and 179 generalized place invariants in 82 ms returned sat
[2023-03-11 03:41:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:41:17] [INFO ] [Real]Absence check using state equation in 1156 ms returned sat
[2023-03-11 03:41:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:41:17] [INFO ] [Nat]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-11 03:41:17] [INFO ] [Nat]Absence check using 66 positive and 179 generalized place invariants in 70 ms returned sat
[2023-03-11 03:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:41:18] [INFO ] [Nat]Absence check using state equation in 1334 ms returned sat
[2023-03-11 03:41:19] [INFO ] Computed and/alt/rep : 962/3695/962 causal constraints (skipped 1398 transitions) in 205 ms.
[2023-03-11 03:41:39] [INFO ] Added : 575 causal constraints over 115 iterations in 20115 ms.(timeout) Result :sat
Minimization took 1618 ms.
[2023-03-11 03:41:41] [INFO ] [Real]Absence check using 66 positive place invariants in 28 ms returned sat
[2023-03-11 03:41:41] [INFO ] [Real]Absence check using 66 positive and 179 generalized place invariants in 94 ms returned sat
[2023-03-11 03:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:41:42] [INFO ] [Real]Absence check using state equation in 1590 ms returned sat
[2023-03-11 03:41:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:41:43] [INFO ] [Nat]Absence check using 66 positive place invariants in 61 ms returned sat
[2023-03-11 03:41:43] [INFO ] [Nat]Absence check using 66 positive and 179 generalized place invariants in 101 ms returned sat
[2023-03-11 03:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:41:44] [INFO ] [Nat]Absence check using state equation in 1403 ms returned sat
[2023-03-11 03:41:45] [INFO ] Computed and/alt/rep : 962/3695/962 causal constraints (skipped 1398 transitions) in 168 ms.
[2023-03-11 03:42:05] [INFO ] Added : 590 causal constraints over 118 iterations in 20163 ms.(timeout) Result :sat
Minimization took 919 ms.
[2023-03-11 03:42:06] [INFO ] [Real]Absence check using 66 positive place invariants in 108 ms returned sat
[2023-03-11 03:42:06] [INFO ] [Real]Absence check using 66 positive and 179 generalized place invariants in 123 ms returned sat
[2023-03-11 03:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:42:08] [INFO ] [Real]Absence check using state equation in 1425 ms returned sat
[2023-03-11 03:42:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:42:08] [INFO ] [Nat]Absence check using 66 positive place invariants in 34 ms returned sat
[2023-03-11 03:42:08] [INFO ] [Nat]Absence check using 66 positive and 179 generalized place invariants in 154 ms returned sat
[2023-03-11 03:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:42:10] [INFO ] [Nat]Absence check using state equation in 1667 ms returned sat
[2023-03-11 03:42:10] [INFO ] Computed and/alt/rep : 962/3695/962 causal constraints (skipped 1398 transitions) in 215 ms.
[2023-03-11 03:42:30] [INFO ] Added : 605 causal constraints over 121 iterations in 20036 ms.(timeout) Result :sat
Minimization took 1624 ms.
[2023-03-11 03:42:32] [INFO ] [Real]Absence check using 66 positive place invariants in 95 ms returned sat
[2023-03-11 03:42:32] [INFO ] [Real]Absence check using 66 positive and 179 generalized place invariants in 71 ms returned sat
[2023-03-11 03:42:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:42:34] [INFO ] [Real]Absence check using state equation in 1422 ms returned sat
[2023-03-11 03:42:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:42:34] [INFO ] [Nat]Absence check using 66 positive place invariants in 23 ms returned sat
[2023-03-11 03:42:34] [INFO ] [Nat]Absence check using 66 positive and 179 generalized place invariants in 80 ms returned sat
[2023-03-11 03:42:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:42:36] [INFO ] [Nat]Absence check using state equation in 1398 ms returned sat
[2023-03-11 03:42:36] [INFO ] Computed and/alt/rep : 962/3695/962 causal constraints (skipped 1398 transitions) in 274 ms.
[2023-03-11 03:42:56] [INFO ] Added : 555 causal constraints over 111 iterations in 20155 ms.(timeout) Result :sat
Minimization took 1329 ms.
[2023-03-11 03:42:58] [INFO ] [Real]Absence check using 66 positive place invariants in 25 ms returned sat
[2023-03-11 03:42:58] [INFO ] [Real]Absence check using 66 positive and 179 generalized place invariants in 84 ms returned sat
[2023-03-11 03:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:43:00] [INFO ] [Real]Absence check using state equation in 1904 ms returned sat
[2023-03-11 03:43:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:43:00] [INFO ] [Nat]Absence check using 66 positive place invariants in 59 ms returned sat
[2023-03-11 03:43:00] [INFO ] [Nat]Absence check using 66 positive and 179 generalized place invariants in 72 ms returned sat
[2023-03-11 03:43:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:43:01] [INFO ] [Nat]Absence check using state equation in 956 ms returned sat
[2023-03-11 03:43:01] [INFO ] Computed and/alt/rep : 962/3695/962 causal constraints (skipped 1398 transitions) in 135 ms.
[2023-03-11 03:43:09] [INFO ] Added : 184 causal constraints over 37 iterations in 7240 ms. Result :sat
Minimization took 1221 ms.
[2023-03-11 03:43:10] [INFO ] [Real]Absence check using 66 positive place invariants in 22 ms returned sat
[2023-03-11 03:43:10] [INFO ] [Real]Absence check using 66 positive and 179 generalized place invariants in 83 ms returned sat
[2023-03-11 03:43:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:43:11] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2023-03-11 03:43:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:43:11] [INFO ] [Nat]Absence check using 66 positive place invariants in 24 ms returned sat
[2023-03-11 03:43:12] [INFO ] [Nat]Absence check using 66 positive and 179 generalized place invariants in 75 ms returned sat
[2023-03-11 03:43:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:43:14] [INFO ] [Nat]Absence check using state equation in 2465 ms returned sat
[2023-03-11 03:43:14] [INFO ] Computed and/alt/rep : 962/3695/962 causal constraints (skipped 1398 transitions) in 173 ms.
[2023-03-11 03:43:34] [INFO ] Added : 540 causal constraints over 108 iterations in 20042 ms.(timeout) Result :sat
Minimization took 1406 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-10b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 1422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1422/1422 places, 2409/2409 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1422 transition count 2408
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1421 transition count 2408
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 1418 transition count 2405
Applied a total of 8 rules in 192 ms. Remains 1418 /1422 variables (removed 4) and now considering 2405/2409 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 1418/1422 places, 2405/2409 transitions.
// Phase 1: matrix 2405 rows 1418 cols
[2023-03-11 03:44:06] [INFO ] Computed 245 place invariants in 46 ms
Incomplete random walk after 1000000 steps, including 9515 resets, run finished after 4562 ms. (steps per millisecond=219 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 919 resets, run finished after 1881 ms. (steps per millisecond=531 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 921 resets, run finished after 1950 ms. (steps per millisecond=512 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 919 resets, run finished after 1962 ms. (steps per millisecond=509 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 926 resets, run finished after 1826 ms. (steps per millisecond=547 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 917 resets, run finished after 1978 ms. (steps per millisecond=505 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 915 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties (out of 6) seen :0
[2023-03-11 03:44:23] [INFO ] Invariant cache hit.
[2023-03-11 03:44:23] [INFO ] [Real]Absence check using 67 positive place invariants in 20 ms returned sat
[2023-03-11 03:44:23] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 45 ms returned sat
[2023-03-11 03:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:44:24] [INFO ] [Real]Absence check using state equation in 1272 ms returned sat
[2023-03-11 03:44:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:44:25] [INFO ] [Nat]Absence check using 67 positive place invariants in 45 ms returned sat
[2023-03-11 03:44:25] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 74 ms returned sat
[2023-03-11 03:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:44:26] [INFO ] [Nat]Absence check using state equation in 1835 ms returned sat
[2023-03-11 03:44:27] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 137 ms.
[2023-03-11 03:44:38] [INFO ] Added : 160 causal constraints over 32 iterations in 11722 ms. Result :unknown
[2023-03-11 03:44:39] [INFO ] [Real]Absence check using 67 positive place invariants in 25 ms returned sat
[2023-03-11 03:44:39] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 83 ms returned sat
[2023-03-11 03:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:44:40] [INFO ] [Real]Absence check using state equation in 894 ms returned sat
[2023-03-11 03:44:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:44:40] [INFO ] [Nat]Absence check using 67 positive place invariants in 25 ms returned sat
[2023-03-11 03:44:40] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 50 ms returned sat
[2023-03-11 03:44:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:44:42] [INFO ] [Nat]Absence check using state equation in 1853 ms returned sat
[2023-03-11 03:44:42] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 226 ms.
[2023-03-11 03:45:02] [INFO ] Added : 605 causal constraints over 121 iterations in 20208 ms.(timeout) Result :sat
Minimization took 1190 ms.
[2023-03-11 03:45:04] [INFO ] [Real]Absence check using 67 positive place invariants in 39 ms returned sat
[2023-03-11 03:45:04] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 57 ms returned sat
[2023-03-11 03:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:45:05] [INFO ] [Real]Absence check using state equation in 939 ms returned sat
[2023-03-11 03:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:45:05] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-11 03:45:05] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 49 ms returned sat
[2023-03-11 03:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:45:06] [INFO ] [Nat]Absence check using state equation in 1069 ms returned sat
[2023-03-11 03:45:06] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 143 ms.
[2023-03-11 03:45:17] [INFO ] Added : 165 causal constraints over 33 iterations in 11298 ms. Result :unknown
[2023-03-11 03:45:18] [INFO ] [Real]Absence check using 67 positive place invariants in 30 ms returned sat
[2023-03-11 03:45:18] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 102 ms returned sat
[2023-03-11 03:45:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:45:19] [INFO ] [Real]Absence check using state equation in 1455 ms returned sat
[2023-03-11 03:45:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:45:20] [INFO ] [Nat]Absence check using 67 positive place invariants in 20 ms returned sat
[2023-03-11 03:45:20] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 36 ms returned sat
[2023-03-11 03:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:45:20] [INFO ] [Nat]Absence check using state equation in 924 ms returned sat
[2023-03-11 03:45:21] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 171 ms.
[2023-03-11 03:45:41] [INFO ] Added : 600 causal constraints over 120 iterations in 20102 ms.(timeout) Result :sat
Minimization took 1414 ms.
[2023-03-11 03:45:42] [INFO ] [Real]Absence check using 67 positive place invariants in 63 ms returned sat
[2023-03-11 03:45:43] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 117 ms returned sat
[2023-03-11 03:45:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:45:44] [INFO ] [Real]Absence check using state equation in 1160 ms returned sat
[2023-03-11 03:45:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:45:44] [INFO ] [Nat]Absence check using 67 positive place invariants in 21 ms returned sat
[2023-03-11 03:45:44] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 67 ms returned sat
[2023-03-11 03:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:45:45] [INFO ] [Nat]Absence check using state equation in 1317 ms returned sat
[2023-03-11 03:45:46] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 269 ms.
[2023-03-11 03:46:06] [INFO ] Added : 600 causal constraints over 120 iterations in 20030 ms.(timeout) Result :sat
Minimization took 3011 ms.
[2023-03-11 03:46:09] [INFO ] [Real]Absence check using 67 positive place invariants in 29 ms returned sat
[2023-03-11 03:46:10] [INFO ] [Real]Absence check using 67 positive and 178 generalized place invariants in 894 ms returned sat
[2023-03-11 03:46:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:46:11] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2023-03-11 03:46:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:46:11] [INFO ] [Nat]Absence check using 67 positive place invariants in 23 ms returned sat
[2023-03-11 03:46:11] [INFO ] [Nat]Absence check using 67 positive and 178 generalized place invariants in 52 ms returned sat
[2023-03-11 03:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:46:13] [INFO ] [Nat]Absence check using state equation in 2267 ms returned sat
[2023-03-11 03:46:14] [INFO ] Computed and/alt/rep : 958/3691/958 causal constraints (skipped 1398 transitions) in 160 ms.
[2023-03-11 03:46:34] [INFO ] Added : 585 causal constraints over 117 iterations in 20154 ms.(timeout) Result :sat
Minimization took 1499 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 1418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1418/1418 places, 2405/2405 transitions.
Applied a total of 0 rules in 51 ms. Remains 1418 /1418 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 1418/1418 places, 2405/2405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1418/1418 places, 2405/2405 transitions.
Applied a total of 0 rules in 51 ms. Remains 1418 /1418 variables (removed 0) and now considering 2405/2405 (removed 0) transitions.
[2023-03-11 03:46:51] [INFO ] Invariant cache hit.
[2023-03-11 03:46:55] [INFO ] Implicit Places using invariants in 3855 ms returned [1, 18, 20, 32, 49, 67, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 750, 754, 755, 766, 767, 769, 786, 804, 878, 879, 890, 891, 893, 910, 928, 998, 1002, 1003, 1014, 1015, 1017, 1034, 1052, 1121, 1125, 1126, 1137, 1138, 1140, 1157, 1175, 1244, 1248, 1249, 1252, 1263, 1264, 1265, 1283, 1285, 1289, 1307, 1308, 1309, 1310, 1322, 1328, 1334, 1340, 1346, 1352, 1358, 1364, 1370, 1376, 1382]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 3865 ms to find 101 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1317/1418 places, 2405/2405 transitions.
Drop transitions removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 185 rules applied. Total rules applied 185 place count 1317 transition count 2220
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 197 rules applied. Total rules applied 382 place count 1132 transition count 2208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 384 place count 1130 transition count 2208
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 384 place count 1130 transition count 2161
Deduced a syphon composed of 47 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 479 place count 1082 transition count 2161
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions 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 491 place count 1078 transition count 2153
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 499 place count 1070 transition count 2153
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 514 place count 1055 transition count 2138
Iterating global reduction 5 with 15 rules applied. Total rules applied 529 place count 1055 transition count 2138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 532 place count 1055 transition count 2135
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 532 place count 1055 transition count 2134
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 534 place count 1054 transition count 2134
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 537 place count 1051 transition count 2128
Iterating global reduction 6 with 3 rules applied. Total rules applied 540 place count 1051 transition count 2128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 541 place count 1050 transition count 2127
Iterating global reduction 6 with 1 rules applied. Total rules applied 542 place count 1050 transition count 2127
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 543 place count 1049 transition count 2125
Iterating global reduction 6 with 1 rules applied. Total rules applied 544 place count 1049 transition count 2125
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 4 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 684 place count 979 transition count 2055
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 692 place count 971 transition count 2047
Iterating global reduction 6 with 8 rules applied. Total rules applied 700 place count 971 transition count 2047
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 707 place count 971 transition count 2040
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 708 place count 970 transition count 2039
Iterating global reduction 7 with 1 rules applied. Total rules applied 709 place count 970 transition count 2039
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 710 place count 970 transition count 2038
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 714 place count 968 transition count 2039
Free-agglomeration rule (complex) applied 23 times.
Iterating global reduction 8 with 23 rules applied. Total rules applied 737 place count 968 transition count 2016
Ensure Unique test removed 1 places
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 8 with 24 rules applied. Total rules applied 761 place count 944 transition count 2016
Partial Free-agglomeration rule applied 30 times.
Drop transitions removed 30 transitions
Iterating global reduction 9 with 30 rules applied. Total rules applied 791 place count 944 transition count 2016
Applied a total of 791 rules in 547 ms. Remains 944 /1317 variables (removed 373) and now considering 2016/2405 (removed 389) transitions.
// Phase 1: matrix 2016 rows 944 cols
[2023-03-11 03:46:56] [INFO ] Computed 138 place invariants in 47 ms
[2023-03-11 03:46:56] [INFO ] Implicit Places using invariants in 825 ms returned [74, 91, 97, 100, 102, 105, 106, 158, 175, 181, 184, 186, 191, 192, 244, 261, 267, 270, 272, 277, 278, 330, 347, 353, 356, 358, 363, 364, 416, 433, 439, 442, 444, 449, 450, 520, 526, 529, 531, 537, 538, 607, 613, 616, 618, 621, 626, 627, 679, 697, 703, 706, 708, 713, 714, 766, 783, 789, 792, 794, 799, 800, 852, 869, 875, 878, 880]
Discarding 67 places :
Implicit Place search using SMT only with invariants took 842 ms to find 67 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 877/1418 places, 2016/2405 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 847 transition count 1986
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 847 transition count 1986
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 837 transition count 1976
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 837 transition count 1976
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 36 rules applied. Total rules applied 116 place count 819 transition count 1958
Free-agglomeration rule applied 30 times.
Iterating global reduction 0 with 30 rules applied. Total rules applied 146 place count 819 transition count 1928
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 176 place count 789 transition count 1928
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 183 place count 789 transition count 1921
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 190 place count 782 transition count 1921
Applied a total of 190 rules in 191 ms. Remains 782 /877 variables (removed 95) and now considering 1921/2016 (removed 95) transitions.
// Phase 1: matrix 1921 rows 782 cols
[2023-03-11 03:46:57] [INFO ] Computed 71 place invariants in 31 ms
[2023-03-11 03:46:58] [INFO ] Implicit Places using invariants in 1648 ms returned []
[2023-03-11 03:46:58] [INFO ] Invariant cache hit.
[2023-03-11 03:47:01] [INFO ] Implicit Places using invariants and state equation in 2713 ms returned []
Implicit Place search using SMT with State Equation took 4388 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 782/1418 places, 1921/2405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 9885 ms. Remains : 782/1418 places, 1921/2405 transitions.
Successfully produced net in file /tmp/petri1000_5366048065128869820.dot
Successfully produced net in file /tmp/petri1001_16027468656188797277.dot
Successfully produced net in file /tmp/petri1002_475166259867752095.dot
Successfully produced net in file /tmp/petri1003_6901300417877184558.dot
Successfully produced net in file /tmp/petri1004_17267100029209419910.dot
Successfully produced net in file /tmp/petri1005_1370262939569305980.dot
Successfully produced net in file /tmp/petri1006_17314296982317798545.dot
Successfully produced net in file /tmp/petri1007_8973459769561370646.dot
Successfully produced net in file /tmp/petri1008_5119524805713122697.dot
Successfully produced net in file /tmp/petri1009_14900156196372352053.dot
Drop transitions removed 10 transitions
Dominated transitions for bounds rules discarded 10 transitions
// Phase 1: matrix 1911 rows 782 cols
[2023-03-11 03:47:01] [INFO ] Computed 71 place invariants in 46 ms
Incomplete random walk after 1000000 steps, including 16093 resets, run finished after 2949 ms. (steps per millisecond=339 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2127 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2133 resets, run finished after 908 ms. (steps per millisecond=1101 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2153 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2128 resets, run finished after 796 ms. (steps per millisecond=1256 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2119 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2121 resets, run finished after 951 ms. (steps per millisecond=1051 ) properties (out of 6) seen :0
[2023-03-11 03:47:09] [INFO ] Invariant cache hit.
[2023-03-11 03:47:10] [INFO ] [Real]Absence check using 16 positive place invariants in 41 ms returned sat
[2023-03-11 03:47:10] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 24 ms returned sat
[2023-03-11 03:47:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:10] [INFO ] [Real]Absence check using state equation in 696 ms returned sat
[2023-03-11 03:47:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 12 ms returned sat
[2023-03-11 03:47:11] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 39 ms returned sat
[2023-03-11 03:47:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:12] [INFO ] [Nat]Absence check using state equation in 1211 ms returned sat
[2023-03-11 03:47:12] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 143 ms.
[2023-03-11 03:47:14] [INFO ] Added : 33 causal constraints over 7 iterations in 2026 ms. Result :sat
Minimization took 195 ms.
[2023-03-11 03:47:15] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-11 03:47:15] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 90 ms returned sat
[2023-03-11 03:47:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:16] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2023-03-11 03:47:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:16] [INFO ] [Nat]Absence check using 16 positive place invariants in 21 ms returned sat
[2023-03-11 03:47:16] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 36 ms returned sat
[2023-03-11 03:47:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:17] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2023-03-11 03:47:17] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 116 ms.
[2023-03-11 03:47:18] [INFO ] Deduced a trap composed of 13 places in 319 ms of which 19 ms to minimize.
[2023-03-11 03:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2023-03-11 03:47:19] [INFO ] Added : 52 causal constraints over 11 iterations in 1919 ms. Result :sat
Minimization took 224 ms.
[2023-03-11 03:47:19] [INFO ] [Real]Absence check using 16 positive place invariants in 13 ms returned sat
[2023-03-11 03:47:19] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 29 ms returned sat
[2023-03-11 03:47:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:20] [INFO ] [Real]Absence check using state equation in 1072 ms returned sat
[2023-03-11 03:47:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:21] [INFO ] [Nat]Absence check using 16 positive place invariants in 70 ms returned sat
[2023-03-11 03:47:21] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 293 ms returned sat
[2023-03-11 03:47:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:22] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2023-03-11 03:47:22] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 191 ms.
[2023-03-11 03:47:23] [INFO ] Added : 45 causal constraints over 10 iterations in 1444 ms. Result :sat
Minimization took 384 ms.
[2023-03-11 03:47:24] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-11 03:47:24] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 17 ms returned sat
[2023-03-11 03:47:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:25] [INFO ] [Real]Absence check using state equation in 875 ms returned sat
[2023-03-11 03:47:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:25] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-11 03:47:25] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-11 03:47:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:27] [INFO ] [Nat]Absence check using state equation in 1364 ms returned sat
[2023-03-11 03:47:27] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 242 ms.
[2023-03-11 03:47:29] [INFO ] Added : 77 causal constraints over 16 iterations in 2638 ms. Result :sat
Minimization took 490 ms.
[2023-03-11 03:47:30] [INFO ] [Real]Absence check using 16 positive place invariants in 46 ms returned sat
[2023-03-11 03:47:30] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 19 ms returned sat
[2023-03-11 03:47:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:31] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2023-03-11 03:47:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:31] [INFO ] [Nat]Absence check using 16 positive place invariants in 21 ms returned sat
[2023-03-11 03:47:31] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 39 ms returned sat
[2023-03-11 03:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:32] [INFO ] [Nat]Absence check using state equation in 732 ms returned sat
[2023-03-11 03:47:32] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 251 ms.
[2023-03-11 03:47:33] [INFO ] Added : 35 causal constraints over 8 iterations in 1435 ms. Result :sat
Minimization took 317 ms.
[2023-03-11 03:47:34] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-11 03:47:34] [INFO ] [Real]Absence check using 16 positive and 55 generalized place invariants in 84 ms returned sat
[2023-03-11 03:47:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:35] [INFO ] [Real]Absence check using state equation in 650 ms returned sat
[2023-03-11 03:47:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 14 ms returned sat
[2023-03-11 03:47:35] [INFO ] [Nat]Absence check using 16 positive and 55 generalized place invariants in 18 ms returned sat
[2023-03-11 03:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:36] [INFO ] [Nat]Absence check using state equation in 922 ms returned sat
[2023-03-11 03:47:36] [INFO ] Computed and/alt/rep : 468/2077/468 causal constraints (skipped 1394 transitions) in 175 ms.
[2023-03-11 03:47:40] [INFO ] Added : 82 causal constraints over 18 iterations in 4444 ms. Result :sat
Minimization took 540 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-10b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 782 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 782/782 places, 1911/1911 transitions.
Graph (complete) has 4700 edges and 782 vertex of which 772 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.3 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 772 transition count 1910
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 771 transition count 1910
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 771 transition count 1909
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 5 place count 770 transition count 1909
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 7 place count 768 transition count 1907
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 768 transition count 1907
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 768 transition count 1905
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 768 transition count 1905
Applied a total of 21 rules in 96 ms. Remains 768 /782 variables (removed 14) and now considering 1905/1911 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 768/782 places, 1905/1911 transitions.
// Phase 1: matrix 1905 rows 768 cols
[2023-03-11 03:47:44] [INFO ] Computed 71 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 16157 resets, run finished after 2834 ms. (steps per millisecond=352 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2135 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2145 resets, run finished after 963 ms. (steps per millisecond=1038 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2131 resets, run finished after 992 ms. (steps per millisecond=1008 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2131 resets, run finished after 953 ms. (steps per millisecond=1049 ) properties (out of 4) seen :0
[2023-03-11 03:47:50] [INFO ] Invariant cache hit.
[2023-03-11 03:47:51] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:47:51] [INFO ] [Real]Absence check using 15 positive and 56 generalized place invariants in 28 ms returned sat
[2023-03-11 03:47:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:52] [INFO ] [Real]Absence check using state equation in 1058 ms returned sat
[2023-03-11 03:47:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:52] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2023-03-11 03:47:52] [INFO ] [Nat]Absence check using 15 positive and 56 generalized place invariants in 21 ms returned sat
[2023-03-11 03:47:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:53] [INFO ] [Nat]Absence check using state equation in 1136 ms returned sat
[2023-03-11 03:47:53] [INFO ] Computed and/alt/rep : 476/2163/476 causal constraints (skipped 1380 transitions) in 152 ms.
[2023-03-11 03:47:54] [INFO ] Added : 33 causal constraints over 7 iterations in 1185 ms. Result :sat
Minimization took 202 ms.
[2023-03-11 03:47:55] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 03:47:55] [INFO ] [Real]Absence check using 15 positive and 56 generalized place invariants in 271 ms returned sat
[2023-03-11 03:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:56] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-11 03:47:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:47:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:47:56] [INFO ] [Nat]Absence check using 15 positive and 56 generalized place invariants in 20 ms returned sat
[2023-03-11 03:47:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:47:57] [INFO ] [Nat]Absence check using state equation in 1092 ms returned sat
[2023-03-11 03:47:57] [INFO ] Computed and/alt/rep : 476/2163/476 causal constraints (skipped 1380 transitions) in 122 ms.
[2023-03-11 03:47:59] [INFO ] Added : 33 causal constraints over 8 iterations in 2183 ms. Result :sat
Minimization took 397 ms.
[2023-03-11 03:48:00] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:48:00] [INFO ] [Real]Absence check using 15 positive and 56 generalized place invariants in 64 ms returned sat
[2023-03-11 03:48:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:01] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2023-03-11 03:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:48:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 27 ms returned sat
[2023-03-11 03:48:01] [INFO ] [Nat]Absence check using 15 positive and 56 generalized place invariants in 15 ms returned sat
[2023-03-11 03:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:02] [INFO ] [Nat]Absence check using state equation in 1027 ms returned sat
[2023-03-11 03:48:02] [INFO ] Computed and/alt/rep : 476/2163/476 causal constraints (skipped 1380 transitions) in 145 ms.
[2023-03-11 03:48:04] [INFO ] Added : 53 causal constraints over 11 iterations in 2239 ms. Result :sat
Minimization took 497 ms.
[2023-03-11 03:48:05] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:48:05] [INFO ] [Real]Absence check using 15 positive and 56 generalized place invariants in 17 ms returned sat
[2023-03-11 03:48:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:06] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2023-03-11 03:48:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:48:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:48:06] [INFO ] [Nat]Absence check using 15 positive and 56 generalized place invariants in 18 ms returned sat
[2023-03-11 03:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:13] [INFO ] [Nat]Absence check using state equation in 6797 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 768 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 1905/1905 transitions.
Applied a total of 0 rules in 31 ms. Remains 768 /768 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 768/768 places, 1905/1905 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 768/768 places, 1905/1905 transitions.
Applied a total of 0 rules in 31 ms. Remains 768 /768 variables (removed 0) and now considering 1905/1905 (removed 0) transitions.
[2023-03-11 03:48:14] [INFO ] Invariant cache hit.
[2023-03-11 03:48:15] [INFO ] Implicit Places using invariants in 549 ms returned [413, 484]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 552 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 766/768 places, 1905/1905 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 764 transition count 1903
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 764 transition count 1901
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 762 transition count 1901
Applied a total of 8 rules in 88 ms. Remains 762 /766 variables (removed 4) and now considering 1901/1905 (removed 4) transitions.
// Phase 1: matrix 1901 rows 762 cols
[2023-03-11 03:48:15] [INFO ] Computed 69 place invariants in 30 ms
[2023-03-11 03:48:16] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-11 03:48:16] [INFO ] Invariant cache hit.
[2023-03-11 03:48:19] [INFO ] Implicit Places using invariants and state equation in 3510 ms returned []
Implicit Place search using SMT with State Equation took 4463 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 762/768 places, 1901/1905 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 5134 ms. Remains : 762/768 places, 1901/1905 transitions.
[2023-03-11 03:48:19] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16010 resets, run finished after 2966 ms. (steps per millisecond=337 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2150 resets, run finished after 808 ms. (steps per millisecond=1237 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2138 resets, run finished after 901 ms. (steps per millisecond=1109 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2129 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2115 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 4) seen :0
[2023-03-11 03:48:26] [INFO ] Invariant cache hit.
[2023-03-11 03:48:26] [INFO ] [Real]Absence check using 16 positive place invariants in 39 ms returned sat
[2023-03-11 03:48:26] [INFO ] [Real]Absence check using 16 positive and 53 generalized place invariants in 267 ms returned sat
[2023-03-11 03:48:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:27] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2023-03-11 03:48:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:48:27] [INFO ] [Nat]Absence check using 16 positive place invariants in 11 ms returned sat
[2023-03-11 03:48:28] [INFO ] [Nat]Absence check using 16 positive and 53 generalized place invariants in 26 ms returned sat
[2023-03-11 03:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:30] [INFO ] [Nat]Absence check using state equation in 2674 ms returned sat
[2023-03-11 03:48:30] [INFO ] Computed and/alt/rep : 458/2017/458 causal constraints (skipped 1394 transitions) in 179 ms.
[2023-03-11 03:48:34] [INFO ] Added : 63 causal constraints over 13 iterations in 3381 ms. Result :sat
Minimization took 306 ms.
[2023-03-11 03:48:34] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-11 03:48:34] [INFO ] [Real]Absence check using 16 positive and 53 generalized place invariants in 21 ms returned sat
[2023-03-11 03:48:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:35] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2023-03-11 03:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:48:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 36 ms returned sat
[2023-03-11 03:48:36] [INFO ] [Nat]Absence check using 16 positive and 53 generalized place invariants in 67 ms returned sat
[2023-03-11 03:48:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:37] [INFO ] [Nat]Absence check using state equation in 1731 ms returned sat
[2023-03-11 03:48:37] [INFO ] Computed and/alt/rep : 458/2017/458 causal constraints (skipped 1394 transitions) in 103 ms.
[2023-03-11 03:48:40] [INFO ] Added : 34 causal constraints over 10 iterations in 2828 ms. Result :sat
Minimization took 362 ms.
[2023-03-11 03:48:41] [INFO ] [Real]Absence check using 16 positive place invariants in 31 ms returned sat
[2023-03-11 03:48:41] [INFO ] [Real]Absence check using 16 positive and 53 generalized place invariants in 42 ms returned sat
[2023-03-11 03:48:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:42] [INFO ] [Real]Absence check using state equation in 914 ms returned sat
[2023-03-11 03:48:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:48:42] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2023-03-11 03:48:42] [INFO ] [Nat]Absence check using 16 positive and 53 generalized place invariants in 29 ms returned sat
[2023-03-11 03:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:43] [INFO ] [Nat]Absence check using state equation in 1262 ms returned sat
[2023-03-11 03:48:44] [INFO ] Computed and/alt/rep : 458/2017/458 causal constraints (skipped 1394 transitions) in 166 ms.
[2023-03-11 03:48:47] [INFO ] Deduced a trap composed of 62 places in 313 ms of which 1 ms to minimize.
[2023-03-11 03:48:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 497 ms
[2023-03-11 03:48:47] [INFO ] Added : 84 causal constraints over 18 iterations in 3701 ms. Result :sat
Minimization took 634 ms.
[2023-03-11 03:48:48] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2023-03-11 03:48:48] [INFO ] [Real]Absence check using 16 positive and 53 generalized place invariants in 19 ms returned sat
[2023-03-11 03:48:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:49] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-11 03:48:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:48:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2023-03-11 03:48:49] [INFO ] [Nat]Absence check using 16 positive and 53 generalized place invariants in 27 ms returned sat
[2023-03-11 03:48:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:48:50] [INFO ] [Nat]Absence check using state equation in 1422 ms returned sat
[2023-03-11 03:48:51] [INFO ] Computed and/alt/rep : 458/2017/458 causal constraints (skipped 1394 transitions) in 155 ms.
[2023-03-11 03:48:53] [INFO ] Added : 56 causal constraints over 12 iterations in 2304 ms. Result :sat
Minimization took 569 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-10b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-10b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 762/762 places, 1901/1901 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 762 transition count 1900
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 761 transition count 1900
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 761 transition count 1899
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 4 place count 760 transition count 1899
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 760 transition count 1898
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 759 transition count 1898
Applied a total of 6 rules in 64 ms. Remains 759 /762 variables (removed 3) and now considering 1898/1901 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 759/762 places, 1898/1901 transitions.
// Phase 1: matrix 1898 rows 759 cols
[2023-03-11 03:48:56] [INFO ] Computed 69 place invariants in 39 ms
Incomplete random walk after 1000000 steps, including 15929 resets, run finished after 2932 ms. (steps per millisecond=341 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2111 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 1) seen :0
[2023-03-11 03:48:59] [INFO ] Invariant cache hit.
[2023-03-11 03:49:00] [INFO ] [Real]Absence check using 15 positive place invariants in 21 ms returned sat
[2023-03-11 03:49:00] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 85 ms returned sat
[2023-03-11 03:49:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:49:00] [INFO ] [Real]Absence check using state equation in 598 ms returned sat
[2023-03-11 03:49:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:49:01] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2023-03-11 03:49:01] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 28 ms returned sat
[2023-03-11 03:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:49:02] [INFO ] [Nat]Absence check using state equation in 1260 ms returned sat
[2023-03-11 03:49:02] [INFO ] Computed and/alt/rep : 440/1872/440 causal constraints (skipped 1409 transitions) in 176 ms.
[2023-03-11 03:49:04] [INFO ] Added : 84 causal constraints over 17 iterations in 2437 ms. Result :sat
Minimization took 212 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 31 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 759/759 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 30 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-11 03:49:05] [INFO ] Invariant cache hit.
[2023-03-11 03:49:06] [INFO ] Implicit Places using invariants in 840 ms returned []
[2023-03-11 03:49:06] [INFO ] Invariant cache hit.
[2023-03-11 03:49:08] [INFO ] Implicit Places using invariants and state equation in 2113 ms returned []
Implicit Place search using SMT with State Equation took 2958 ms to find 0 implicit places.
[2023-03-11 03:49:08] [INFO ] Redundant transitions in 173 ms returned []
[2023-03-11 03:49:08] [INFO ] Invariant cache hit.
[2023-03-11 03:49:09] [INFO ] Dead Transitions using invariants and state equation in 973 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4148 ms. Remains : 759/759 places, 1898/1898 transitions.
Starting property specific reduction for ASLink-PT-10b-UpperBounds-00
[2023-03-11 03:49:09] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-11 03:49:09] [INFO ] Invariant cache hit.
[2023-03-11 03:49:10] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-11 03:49:10] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 27 ms returned sat
[2023-03-11 03:49:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:49:10] [INFO ] [Real]Absence check using state equation in 719 ms returned sat
[2023-03-11 03:49:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:49:11] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2023-03-11 03:49:11] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 34 ms returned sat
[2023-03-11 03:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:49:12] [INFO ] [Nat]Absence check using state equation in 1439 ms returned sat
[2023-03-11 03:49:12] [INFO ] Computed and/alt/rep : 440/1872/440 causal constraints (skipped 1409 transitions) in 139 ms.
[2023-03-11 03:49:14] [INFO ] Added : 84 causal constraints over 17 iterations in 2224 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 28 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 759/759 places, 1898/1898 transitions.
[2023-03-11 03:49:15] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16058 resets, run finished after 2962 ms. (steps per millisecond=337 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2136 resets, run finished after 918 ms. (steps per millisecond=1089 ) properties (out of 1) seen :0
[2023-03-11 03:49:19] [INFO ] Invariant cache hit.
[2023-03-11 03:49:19] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-11 03:49:19] [INFO ] [Real]Absence check using 15 positive and 54 generalized place invariants in 17 ms returned sat
[2023-03-11 03:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 03:49:20] [INFO ] [Real]Absence check using state equation in 651 ms returned sat
[2023-03-11 03:49:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 03:49:20] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-11 03:49:20] [INFO ] [Nat]Absence check using 15 positive and 54 generalized place invariants in 24 ms returned sat
[2023-03-11 03:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 03:49:21] [INFO ] [Nat]Absence check using state equation in 1325 ms returned sat
[2023-03-11 03:49:22] [INFO ] Computed and/alt/rep : 440/1872/440 causal constraints (skipped 1409 transitions) in 188 ms.
[2023-03-11 03:49:24] [INFO ] Added : 84 causal constraints over 17 iterations in 2745 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 759 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 32 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 759/759 places, 1898/1898 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 759/759 places, 1898/1898 transitions.
Applied a total of 0 rules in 29 ms. Remains 759 /759 variables (removed 0) and now considering 1898/1898 (removed 0) transitions.
[2023-03-11 03:49:25] [INFO ] Invariant cache hit.
[2023-03-11 03:49:25] [INFO ] Implicit Places using invariants in 528 ms returned []
[2023-03-11 03:49:25] [INFO ] Invariant cache hit.
[2023-03-11 03:49:27] [INFO ] Implicit Places using invariants and state equation in 2024 ms returned []
Implicit Place search using SMT with State Equation took 2581 ms to find 0 implicit places.
[2023-03-11 03:49:28] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-11 03:49:28] [INFO ] Invariant cache hit.
[2023-03-11 03:49:28] [INFO ] Dead Transitions using invariants and state equation in 817 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3530 ms. Remains : 759/759 places, 1898/1898 transitions.
Ending property specific reduction for ASLink-PT-10b-UpperBounds-00 in 19075 ms.
[2023-03-11 03:49:29] [INFO ] Flatten gal took : 187 ms
[2023-03-11 03:49:29] [INFO ] Applying decomposition
[2023-03-11 03:49:29] [INFO ] Flatten gal took : 94 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9331195150849565492.txt' '-o' '/tmp/graph9331195150849565492.bin' '-w' '/tmp/graph9331195150849565492.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9331195150849565492.bin' '-l' '-1' '-v' '-w' '/tmp/graph9331195150849565492.weights' '-q' '0' '-e' '0.001'
[2023-03-11 03:49:29] [INFO ] Decomposing Gal with order
[2023-03-11 03:49:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 03:49:30] [INFO ] Removed a total of 3773 redundant transitions.
[2023-03-11 03:49:30] [INFO ] Flatten gal took : 199 ms
[2023-03-11 03:49:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 38 ms.
[2023-03-11 03:49:30] [INFO ] Time to serialize gal into /tmp/UpperBounds8406178200593265993.gal : 23 ms
[2023-03-11 03:49:30] [INFO ] Time to serialize properties into /tmp/UpperBounds8330128685181391638.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8406178200593265993.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8330128685181391638.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds8330128685181391638.prop.
Detected timeout of ITS tools.
[2023-03-11 04:12:51] [INFO ] Applying decomposition
[2023-03-11 04:12:52] [INFO ] Flatten gal took : 1242 ms
[2023-03-11 04:12:52] [INFO ] Decomposing Gal with order
[2023-03-11 04:12:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 04:12:54] [INFO ] Removed a total of 3619 redundant transitions.
[2023-03-11 04:12:54] [INFO ] Flatten gal took : 1196 ms
[2023-03-11 04:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1511 labels/synchronizations in 679 ms.
[2023-03-11 04:12:56] [INFO ] Time to serialize gal into /tmp/UpperBounds14341483734615188021.gal : 82 ms
[2023-03-11 04:12:56] [INFO ] Time to serialize properties into /tmp/UpperBounds3316280196604810517.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14341483734615188021.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3316280196604810517.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds3316280196604810517.prop.
Detected timeout of ITS tools.
[2023-03-11 04:36:16] [INFO ] Flatten gal took : 363 ms
[2023-03-11 04:36:18] [INFO ] Input system was already deterministic with 1898 transitions.
[2023-03-11 04:36:18] [INFO ] Transformed 759 places.
[2023-03-11 04:36:18] [INFO ] Transformed 1898 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 04:36:19] [INFO ] Time to serialize gal into /tmp/UpperBounds9954351065109394572.gal : 22 ms
[2023-03-11 04:36:19] [INFO ] Time to serialize properties into /tmp/UpperBounds4977228929572204669.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9954351065109394572.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds4977228929572204669.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...349
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds4977228929572204669.prop.
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 11283432 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16204036 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-10b, 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 r005-oct2-167813592700165"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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