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.r011-oct2-167813599800133.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 smartxred
Input is ASLink-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599800133
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 6.4K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 26 13:07 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.2M 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-08b-UpperBounds-00
FORMULA_NAME ASLink-PT-08b-UpperBounds-01
FORMULA_NAME ASLink-PT-08b-UpperBounds-02
FORMULA_NAME ASLink-PT-08b-UpperBounds-03
FORMULA_NAME ASLink-PT-08b-UpperBounds-04
FORMULA_NAME ASLink-PT-08b-UpperBounds-05
FORMULA_NAME ASLink-PT-08b-UpperBounds-06
FORMULA_NAME ASLink-PT-08b-UpperBounds-07
FORMULA_NAME ASLink-PT-08b-UpperBounds-08
FORMULA_NAME ASLink-PT-08b-UpperBounds-09
FORMULA_NAME ASLink-PT-08b-UpperBounds-10
FORMULA_NAME ASLink-PT-08b-UpperBounds-11
FORMULA_NAME ASLink-PT-08b-UpperBounds-12
FORMULA_NAME ASLink-PT-08b-UpperBounds-13
FORMULA_NAME ASLink-PT-08b-UpperBounds-14
FORMULA_NAME ASLink-PT-08b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678727127947

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 17:05:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 17:05:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:05:31] [INFO ] Load time of PNML (sax parser for PT used): 202 ms
[2023-03-13 17:05:31] [INFO ] Transformed 3618 places.
[2023-03-13 17:05:31] [INFO ] Transformed 4459 transitions.
[2023-03-13 17:05:31] [INFO ] Found NUPN structural information;
[2023-03-13 17:05:31] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 4459 rows 3618 cols
[2023-03-13 17:05:31] [INFO ] Computed 355 place invariants in 130 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 16) seen :8
FORMULA ASLink-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
[2023-03-13 17:05:32] [INFO ] Invariant cache hit.
[2023-03-13 17:05:33] [INFO ] [Real]Absence check using 83 positive place invariants in 81 ms returned sat
[2023-03-13 17:05:33] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 313 ms returned sat
[2023-03-13 17:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:05:37] [INFO ] [Real]Absence check using state equation in 3576 ms returned unknown
[2023-03-13 17:05:38] [INFO ] [Real]Absence check using 83 positive place invariants in 99 ms returned sat
[2023-03-13 17:05:38] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 218 ms returned sat
[2023-03-13 17:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:05:42] [INFO ] [Real]Absence check using state equation in 3620 ms returned unknown
[2023-03-13 17:05:42] [INFO ] [Real]Absence check using 83 positive place invariants in 86 ms returned sat
[2023-03-13 17:05:43] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 301 ms returned sat
[2023-03-13 17:05:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:05:46] [INFO ] [Real]Absence check using state equation in 2871 ms returned sat
[2023-03-13 17:05:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:05:47] [INFO ] [Nat]Absence check using 83 positive place invariants in 87 ms returned sat
[2023-03-13 17:05:47] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 127 ms returned sat
[2023-03-13 17:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:05:51] [INFO ] [Nat]Absence check using state equation in 4236 ms returned unknown
[2023-03-13 17:05:52] [INFO ] [Real]Absence check using 83 positive place invariants in 113 ms returned sat
[2023-03-13 17:05:52] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 118 ms returned sat
[2023-03-13 17:05:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:05:54] [INFO ] [Real]Absence check using state equation in 2641 ms returned sat
[2023-03-13 17:05:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:05:55] [INFO ] [Nat]Absence check using 83 positive place invariants in 74 ms returned sat
[2023-03-13 17:05:56] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 283 ms returned sat
[2023-03-13 17:05:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:05:58] [INFO ] [Nat]Absence check using state equation in 2599 ms returned sat
[2023-03-13 17:06:01] [INFO ] Deduced a trap composed of 32 places in 2291 ms of which 8 ms to minimize.
[2023-03-13 17:06:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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-13 17:06:01] [INFO ] [Real]Absence check using 83 positive place invariants in 83 ms returned sat
[2023-03-13 17:06:02] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 257 ms returned sat
[2023-03-13 17:06:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:04] [INFO ] [Real]Absence check using state equation in 2702 ms returned sat
[2023-03-13 17:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:06:05] [INFO ] [Nat]Absence check using 83 positive place invariants in 76 ms returned sat
[2023-03-13 17:06:05] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 123 ms returned sat
[2023-03-13 17:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:10] [INFO ] [Nat]Absence check using state equation in 4338 ms returned unknown
[2023-03-13 17:06:10] [INFO ] [Real]Absence check using 83 positive place invariants in 77 ms returned sat
[2023-03-13 17:06:10] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 146 ms returned sat
[2023-03-13 17:06:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:14] [INFO ] [Real]Absence check using state equation in 3262 ms returned sat
[2023-03-13 17:06:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:06:15] [INFO ] [Nat]Absence check using 83 positive place invariants in 73 ms returned sat
[2023-03-13 17:06:15] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 115 ms returned sat
[2023-03-13 17:06:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:19] [INFO ] [Nat]Absence check using state equation in 4243 ms returned unknown
[2023-03-13 17:06:20] [INFO ] [Real]Absence check using 83 positive place invariants in 73 ms returned sat
[2023-03-13 17:06:20] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 150 ms returned sat
[2023-03-13 17:06:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:23] [INFO ] [Real]Absence check using state equation in 2706 ms returned sat
[2023-03-13 17:06:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:06:23] [INFO ] [Nat]Absence check using 83 positive place invariants in 85 ms returned sat
[2023-03-13 17:06:24] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 122 ms returned sat
[2023-03-13 17:06:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:28] [INFO ] [Nat]Absence check using state equation in 4173 ms returned unknown
[2023-03-13 17:06:28] [INFO ] [Real]Absence check using 83 positive place invariants in 74 ms returned sat
[2023-03-13 17:06:29] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 169 ms returned sat
[2023-03-13 17:06:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:31] [INFO ] [Real]Absence check using state equation in 2724 ms returned sat
[2023-03-13 17:06:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:06:32] [INFO ] [Nat]Absence check using 83 positive place invariants in 73 ms returned sat
[2023-03-13 17:06:32] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 211 ms returned sat
[2023-03-13 17:06:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:36] [INFO ] [Nat]Absence check using state equation in 3358 ms returned sat
[2023-03-13 17:06:38] [INFO ] Deduced a trap composed of 99 places in 1832 ms of which 4 ms to minimize.
[2023-03-13 17:06:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions removed 844 transitions
Trivial Post-agglo rules discarded 844 transitions
Performed 844 trivial Post agglomeration. Transition count delta: 844
Iterating post reduction 0 with 844 rules applied. Total rules applied 844 place count 3618 transition count 3615
Reduce places removed 844 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 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 1 with 882 rules applied. Total rules applied 1726 place count 2774 transition count 3577
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 1737 place count 2764 transition count 3576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1738 place count 2763 transition count 3576
Performed 839 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 839 Pre rules applied. Total rules applied 1738 place count 2763 transition count 2737
Deduced a syphon composed of 839 places in 16 ms
Ensure Unique test removed 82 places
Reduce places removed 921 places and 0 transitions.
Iterating global reduction 4 with 1760 rules applied. Total rules applied 3498 place count 1842 transition count 2737
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 4 with 60 rules applied. Total rules applied 3558 place count 1833 transition count 2686
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 52 rules applied. Total rules applied 3610 place count 1782 transition count 2685
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3611 place count 1781 transition count 2685
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3611 place count 1781 transition count 2653
Deduced a syphon composed of 32 places in 6 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 3707 place count 1717 transition count 2653
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 31 Pre rules applied. Total rules applied 3707 place count 1717 transition count 2622
Deduced a syphon composed of 31 places in 39 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 3769 place count 1686 transition count 2622
Discarding 116 places :
Symmetric choice reduction at 7 with 116 rule applications. Total rules 3885 place count 1570 transition count 2506
Iterating global reduction 7 with 116 rules applied. Total rules applied 4001 place count 1570 transition count 2506
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 4002 place count 1570 transition count 2505
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 38 Pre rules applied. Total rules applied 4002 place count 1570 transition count 2467
Deduced a syphon composed of 38 places in 39 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 77 rules applied. Total rules applied 4079 place count 1531 transition count 2467
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4079 place count 1531 transition count 2466
Deduced a syphon composed of 1 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4082 place count 1529 transition count 2466
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4091 place count 1520 transition count 2409
Iterating global reduction 8 with 9 rules applied. Total rules applied 4100 place count 1520 transition count 2409
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 4100 place count 1520 transition count 2401
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 4116 place count 1512 transition count 2401
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4117 place count 1511 transition count 2393
Iterating global reduction 8 with 1 rules applied. Total rules applied 4118 place count 1511 transition count 2393
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4119 place count 1510 transition count 2385
Iterating global reduction 8 with 1 rules applied. Total rules applied 4120 place count 1510 transition count 2385
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4121 place count 1509 transition count 2377
Iterating global reduction 8 with 1 rules applied. Total rules applied 4122 place count 1509 transition count 2377
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4123 place count 1508 transition count 2369
Iterating global reduction 8 with 1 rules applied. Total rules applied 4124 place count 1508 transition count 2369
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4125 place count 1507 transition count 2361
Iterating global reduction 8 with 1 rules applied. Total rules applied 4126 place count 1507 transition count 2361
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4127 place count 1506 transition count 2353
Iterating global reduction 8 with 1 rules applied. Total rules applied 4128 place count 1506 transition count 2353
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4129 place count 1505 transition count 2345
Iterating global reduction 8 with 1 rules applied. Total rules applied 4130 place count 1505 transition count 2345
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4131 place count 1504 transition count 2337
Iterating global reduction 8 with 1 rules applied. Total rules applied 4132 place count 1504 transition count 2337
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4133 place count 1503 transition count 2329
Iterating global reduction 8 with 1 rules applied. Total rules applied 4134 place count 1503 transition count 2329
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4135 place count 1502 transition count 2321
Iterating global reduction 8 with 1 rules applied. Total rules applied 4136 place count 1502 transition count 2321
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4137 place count 1501 transition count 2313
Iterating global reduction 8 with 1 rules applied. Total rules applied 4138 place count 1501 transition count 2313
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4139 place count 1500 transition count 2305
Iterating global reduction 8 with 1 rules applied. Total rules applied 4140 place count 1500 transition count 2305
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4141 place count 1499 transition count 2297
Iterating global reduction 8 with 1 rules applied. Total rules applied 4142 place count 1499 transition count 2297
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4143 place count 1498 transition count 2289
Iterating global reduction 8 with 1 rules applied. Total rules applied 4144 place count 1498 transition count 2289
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4145 place count 1497 transition count 2281
Iterating global reduction 8 with 1 rules applied. Total rules applied 4146 place count 1497 transition count 2281
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4147 place count 1496 transition count 2273
Iterating global reduction 8 with 1 rules applied. Total rules applied 4148 place count 1496 transition count 2273
Performed 208 Post agglomeration using F-continuation condition.Transition count delta: 208
Deduced a syphon composed of 208 places in 5 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 8 with 416 rules applied. Total rules applied 4564 place count 1288 transition count 2065
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4565 place count 1287 transition count 2064
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4567 place count 1286 transition count 2064
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4568 place count 1285 transition count 2063
Iterating global reduction 8 with 1 rules applied. Total rules applied 4569 place count 1285 transition count 2063
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 4571 place count 1285 transition count 2061
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4572 place count 1284 transition count 2061
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4574 place count 1283 transition count 2070
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 4584 place count 1283 transition count 2060
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 4594 place count 1273 transition count 2060
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 4601 place count 1273 transition count 2053
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 4608 place count 1266 transition count 2053
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4609 place count 1265 transition count 2052
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 12 with 21 rules applied. Total rules applied 4630 place count 1250 transition count 2046
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 7 rules applied. Total rules applied 4637 place count 1244 transition count 2045
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 4638 place count 1243 transition count 2045
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 23 Pre rules applied. Total rules applied 4638 place count 1243 transition count 2022
Deduced a syphon composed of 23 places in 4 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 15 with 46 rules applied. Total rules applied 4684 place count 1220 transition count 2022
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 15 with 8 rules applied. Total rules applied 4692 place count 1212 transition count 2022
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 16 with 30 rules applied. Total rules applied 4722 place count 1197 transition count 2007
Discarding 8 places :
Symmetric choice reduction at 16 with 8 rule applications. Total rules 4730 place count 1189 transition count 1999
Iterating global reduction 16 with 8 rules applied. Total rules applied 4738 place count 1189 transition count 1999
Free-agglomeration rule applied 8 times.
Iterating global reduction 16 with 8 rules applied. Total rules applied 4746 place count 1189 transition count 1991
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 16 with 8 rules applied. Total rules applied 4754 place count 1181 transition count 1991
Applied a total of 4754 rules in 2442 ms. Remains 1181 /3618 variables (removed 2437) and now considering 1991/4459 (removed 2468) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2444 ms. Remains : 1181/3618 places, 1991/4459 transitions.
// Phase 1: matrix 1991 rows 1181 cols
[2023-03-13 17:06:40] [INFO ] Computed 206 place invariants in 75 ms
Incomplete random walk after 1000000 steps, including 10194 resets, run finished after 4186 ms. (steps per millisecond=238 ) properties (out of 8) seen :3
FORMULA ASLink-PT-08b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1279 resets, run finished after 1563 ms. (steps per millisecond=639 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1272 resets, run finished after 1532 ms. (steps per millisecond=652 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1281 resets, run finished after 1584 ms. (steps per millisecond=631 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1273 resets, run finished after 1678 ms. (steps per millisecond=595 ) properties (out of 5) seen :2
FORMULA ASLink-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-13 17:06:51] [INFO ] Invariant cache hit.
[2023-03-13 17:06:51] [INFO ] [Real]Absence check using 55 positive place invariants in 28 ms returned sat
[2023-03-13 17:06:51] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 50 ms returned sat
[2023-03-13 17:06:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:52] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2023-03-13 17:06:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:06:52] [INFO ] [Nat]Absence check using 55 positive place invariants in 40 ms returned sat
[2023-03-13 17:06:52] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 88 ms returned sat
[2023-03-13 17:06:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:06:54] [INFO ] [Nat]Absence check using state equation in 1181 ms returned sat
[2023-03-13 17:06:54] [INFO ] Computed and/alt/rep : 791/2967/791 causal constraints (skipped 1159 transitions) in 152 ms.
[2023-03-13 17:07:05] [INFO ] Added : 431 causal constraints over 87 iterations in 11107 ms. Result :sat
Minimization took 677 ms.
[2023-03-13 17:07:06] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2023-03-13 17:07:06] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 31 ms returned sat
[2023-03-13 17:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:07] [INFO ] [Real]Absence check using state equation in 742 ms returned sat
[2023-03-13 17:07:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:07:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 19 ms returned sat
[2023-03-13 17:07:07] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 58 ms returned sat
[2023-03-13 17:07:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:08] [INFO ] [Nat]Absence check using state equation in 1172 ms returned sat
[2023-03-13 17:07:09] [INFO ] Computed and/alt/rep : 791/2967/791 causal constraints (skipped 1159 transitions) in 156 ms.
[2023-03-13 17:07:25] [INFO ] Added : 579 causal constraints over 116 iterations in 16457 ms. Result :sat
Minimization took 597 ms.
[2023-03-13 17:07:26] [INFO ] [Real]Absence check using 55 positive place invariants in 59 ms returned sat
[2023-03-13 17:07:26] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 49 ms returned sat
[2023-03-13 17:07:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:27] [INFO ] [Real]Absence check using state equation in 767 ms returned sat
[2023-03-13 17:07:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:07:27] [INFO ] [Nat]Absence check using 55 positive place invariants in 59 ms returned sat
[2023-03-13 17:07:27] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 44 ms returned sat
[2023-03-13 17:07:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:28] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2023-03-13 17:07:28] [INFO ] Computed and/alt/rep : 791/2967/791 causal constraints (skipped 1159 transitions) in 129 ms.
[2023-03-13 17:07:31] [INFO ] Added : 104 causal constraints over 21 iterations in 2985 ms. Result :sat
Minimization took 387 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Support contains 3 out of 1181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1181/1181 places, 1991/1991 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 1181 transition count 1988
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 1178 transition count 1988
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 1177 transition count 1987
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 1177 transition count 1987
Applied a total of 9 rules in 209 ms. Remains 1177 /1181 variables (removed 4) and now considering 1987/1991 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 1177/1181 places, 1987/1991 transitions.
// Phase 1: matrix 1987 rows 1177 cols
[2023-03-13 17:07:34] [INFO ] Computed 206 place invariants in 19 ms
Incomplete random walk after 1000000 steps, including 10336 resets, run finished after 3721 ms. (steps per millisecond=268 ) properties (out of 3) seen :1
FORMULA ASLink-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1271 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1273 resets, run finished after 1656 ms. (steps per millisecond=603 ) properties (out of 2) seen :0
[2023-03-13 17:07:41] [INFO ] Invariant cache hit.
[2023-03-13 17:07:41] [INFO ] [Real]Absence check using 54 positive place invariants in 68 ms returned sat
[2023-03-13 17:07:41] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 45 ms returned sat
[2023-03-13 17:07:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:42] [INFO ] [Real]Absence check using state equation in 960 ms returned sat
[2023-03-13 17:07:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:07:42] [INFO ] [Nat]Absence check using 54 positive place invariants in 28 ms returned sat
[2023-03-13 17:07:42] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 45 ms returned sat
[2023-03-13 17:07:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:44] [INFO ] [Nat]Absence check using state equation in 1488 ms returned sat
[2023-03-13 17:07:44] [INFO ] Deduced a trap composed of 143 places in 322 ms of which 2 ms to minimize.
[2023-03-13 17:07:45] [INFO ] Deduced a trap composed of 132 places in 474 ms of which 2 ms to minimize.
[2023-03-13 17:07:45] [INFO ] Deduced a trap composed of 140 places in 249 ms of which 1 ms to minimize.
[2023-03-13 17:07:46] [INFO ] Deduced a trap composed of 128 places in 447 ms of which 1 ms to minimize.
[2023-03-13 17:07:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1836 ms
[2023-03-13 17:07:46] [INFO ] Computed and/alt/rep : 787/2975/787 causal constraints (skipped 1159 transitions) in 124 ms.
[2023-03-13 17:07:49] [INFO ] Added : 95 causal constraints over 19 iterations in 3534 ms. Result :sat
Minimization took 756 ms.
[2023-03-13 17:07:50] [INFO ] [Real]Absence check using 54 positive place invariants in 17 ms returned sat
[2023-03-13 17:07:50] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 36 ms returned sat
[2023-03-13 17:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:52] [INFO ] [Real]Absence check using state equation in 1278 ms returned sat
[2023-03-13 17:07:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:07:52] [INFO ] [Nat]Absence check using 54 positive place invariants in 17 ms returned sat
[2023-03-13 17:07:52] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 32 ms returned sat
[2023-03-13 17:07:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:07:53] [INFO ] [Nat]Absence check using state equation in 1437 ms returned sat
[2023-03-13 17:07:54] [INFO ] Computed and/alt/rep : 787/2975/787 causal constraints (skipped 1159 transitions) in 135 ms.
[2023-03-13 17:08:13] [INFO ] Added : 666 causal constraints over 134 iterations in 19954 ms. Result :sat
Minimization took 903 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 1177 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1177/1177 places, 1987/1987 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1176 transition count 1986
Applied a total of 2 rules in 114 ms. Remains 1176 /1177 variables (removed 1) and now considering 1986/1987 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 117 ms. Remains : 1176/1177 places, 1986/1987 transitions.
// Phase 1: matrix 1986 rows 1176 cols
[2023-03-13 17:08:20] [INFO ] Computed 206 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 10221 resets, run finished after 3869 ms. (steps per millisecond=258 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1286 resets, run finished after 1751 ms. (steps per millisecond=571 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1263 resets, run finished after 1613 ms. (steps per millisecond=619 ) properties (out of 2) seen :0
[2023-03-13 17:08:28] [INFO ] Invariant cache hit.
[2023-03-13 17:08:28] [INFO ] [Real]Absence check using 54 positive place invariants in 32 ms returned sat
[2023-03-13 17:08:28] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 40 ms returned sat
[2023-03-13 17:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:08:29] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2023-03-13 17:08:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:08:29] [INFO ] [Nat]Absence check using 54 positive place invariants in 21 ms returned sat
[2023-03-13 17:08:29] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 45 ms returned sat
[2023-03-13 17:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:08:30] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2023-03-13 17:08:30] [INFO ] Computed and/alt/rep : 786/2974/786 causal constraints (skipped 1159 transitions) in 110 ms.
[2023-03-13 17:08:37] [INFO ] Added : 231 causal constraints over 47 iterations in 6805 ms. Result :sat
Minimization took 617 ms.
[2023-03-13 17:08:38] [INFO ] [Real]Absence check using 54 positive place invariants in 15 ms returned sat
[2023-03-13 17:08:38] [INFO ] [Real]Absence check using 54 positive and 152 generalized place invariants in 28 ms returned sat
[2023-03-13 17:08:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:08:38] [INFO ] [Real]Absence check using state equation in 654 ms returned sat
[2023-03-13 17:08:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:08:39] [INFO ] [Nat]Absence check using 54 positive place invariants in 15 ms returned sat
[2023-03-13 17:08:39] [INFO ] [Nat]Absence check using 54 positive and 152 generalized place invariants in 28 ms returned sat
[2023-03-13 17:08:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:08:42] [INFO ] [Nat]Absence check using state equation in 3235 ms returned sat
[2023-03-13 17:08:42] [INFO ] Computed and/alt/rep : 786/2974/786 causal constraints (skipped 1159 transitions) in 106 ms.
[2023-03-13 17:08:59] [INFO ] Added : 624 causal constraints over 125 iterations in 17303 ms. Result :sat
Minimization took 630 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 1176 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1176/1176 places, 1986/1986 transitions.
Applied a total of 0 rules in 45 ms. Remains 1176 /1176 variables (removed 0) and now considering 1986/1986 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1176/1176 places, 1986/1986 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1176/1176 places, 1986/1986 transitions.
Applied a total of 0 rules in 45 ms. Remains 1176 /1176 variables (removed 0) and now considering 1986/1986 (removed 0) transitions.
[2023-03-13 17:09:02] [INFO ] Invariant cache hit.
[2023-03-13 17:09:03] [INFO ] Implicit Places using invariants in 1048 ms returned [1, 18, 19, 22, 32, 49, 67, 143, 157, 158, 160, 177, 195, 264, 268, 269, 280, 281, 283, 300, 318, 387, 391, 392, 403, 404, 406, 423, 441, 510, 514, 515, 526, 527, 529, 546, 564, 633, 637, 638, 649, 650, 652, 669, 687, 756, 760, 761, 772, 773, 775, 792, 810, 879, 883, 884, 895, 896, 898, 915, 933, 1002, 1006, 1007, 1010, 1021, 1022, 1023, 1041, 1043, 1047, 1065, 1066, 1067, 1068, 1080, 1086, 1092, 1098, 1104, 1110, 1116, 1122, 1128, 1134, 1140]
Discarding 86 places :
Implicit Place search using SMT only with invariants took 1067 ms to find 86 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1090/1176 places, 1986/1986 transitions.
Drop transitions removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1090 transition count 1829
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 163 rules applied. Total rules applied 320 place count 933 transition count 1823
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 320 place count 933 transition count 1785
Deduced a syphon composed of 38 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 77 rules applied. Total rules applied 397 place count 894 transition count 1785
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 2 with 12 rules applied. Total rules applied 409 place count 890 transition count 1777
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 417 place count 882 transition count 1777
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 432 place count 867 transition count 1762
Iterating global reduction 4 with 15 rules applied. Total rules applied 447 place count 867 transition count 1762
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 450 place count 867 transition count 1759
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 450 place count 867 transition count 1758
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 452 place count 866 transition count 1758
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 455 place count 863 transition count 1752
Iterating global reduction 5 with 3 rules applied. Total rules applied 458 place count 863 transition count 1752
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 459 place count 862 transition count 1751
Iterating global reduction 5 with 1 rules applied. Total rules applied 460 place count 862 transition count 1751
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 461 place count 861 transition count 1749
Iterating global reduction 5 with 1 rules applied. Total rules applied 462 place count 861 transition count 1749
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 122 rules applied. Total rules applied 584 place count 800 transition count 1688
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 585 place count 800 transition count 1687
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 592 place count 793 transition count 1680
Iterating global reduction 6 with 7 rules applied. Total rules applied 599 place count 793 transition count 1680
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 606 place count 793 transition count 1673
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 610 place count 791 transition count 1674
Free-agglomeration rule (complex) applied 18 times.
Iterating global reduction 7 with 18 rules applied. Total rules applied 628 place count 791 transition count 1656
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 647 place count 772 transition count 1656
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 671 place count 772 transition count 1656
Applied a total of 671 rules in 326 ms. Remains 772 /1090 variables (removed 318) and now considering 1656/1986 (removed 330) transitions.
// Phase 1: matrix 1656 rows 772 cols
[2023-03-13 17:09:03] [INFO ] Computed 114 place invariants in 15 ms
[2023-03-13 17:09:04] [INFO ] Implicit Places using invariants in 634 ms returned [89, 95, 98, 100, 103, 110, 111, 164, 181, 187, 190, 192, 197, 198, 250, 267, 273, 276, 278, 283, 284, 336, 353, 359, 362, 364, 369, 370, 422, 439, 445, 448, 450, 455, 456, 508, 525, 531, 534, 536, 541, 542, 594, 611, 617, 620, 622, 627, 628, 680, 697, 703, 706, 708]
Discarding 54 places :
Implicit Place search using SMT only with invariants took 649 ms to find 54 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 718/1176 places, 1656/1986 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 693 transition count 1631
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 693 transition count 1631
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 58 place count 685 transition count 1623
Iterating global reduction 0 with 8 rules applied. Total rules applied 66 place count 685 transition count 1623
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 96 place count 670 transition count 1608
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 97 place count 670 transition count 1607
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 121 place count 670 transition count 1583
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 145 place count 646 transition count 1583
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 152 place count 646 transition count 1576
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 159 place count 639 transition count 1576
Applied a total of 159 rules in 219 ms. Remains 639 /718 variables (removed 79) and now considering 1576/1656 (removed 80) transitions.
// Phase 1: matrix 1576 rows 639 cols
[2023-03-13 17:09:04] [INFO ] Computed 60 place invariants in 10 ms
[2023-03-13 17:09:04] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-13 17:09:04] [INFO ] Invariant cache hit.
[2023-03-13 17:09:06] [INFO ] Implicit Places using invariants and state equation in 1470 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 639/1176 places, 1576/1986 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4187 ms. Remains : 639/1176 places, 1576/1986 transitions.
Successfully produced net in file /tmp/petri1000_17557913170154209664.dot
Successfully produced net in file /tmp/petri1001_12042856774934559671.dot
Successfully produced net in file /tmp/petri1002_7973526414120642177.dot
Successfully produced net in file /tmp/petri1003_9571468502451863494.dot
Successfully produced net in file /tmp/petri1004_501399182840075695.dot
Successfully produced net in file /tmp/petri1005_2665806277033867234.dot
Successfully produced net in file /tmp/petri1006_491575081746677631.dot
Successfully produced net in file /tmp/petri1007_13614815637316013831.dot
Drop transitions removed 8 transitions
Dominated transitions for bounds rules discarded 8 transitions
// Phase 1: matrix 1568 rows 639 cols
[2023-03-13 17:09:06] [INFO ] Computed 60 place invariants in 13 ms
Incomplete random walk after 1000000 steps, including 16839 resets, run finished after 2418 ms. (steps per millisecond=413 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2801 resets, run finished after 821 ms. (steps per millisecond=1218 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2800 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 2) seen :0
[2023-03-13 17:09:10] [INFO ] Invariant cache hit.
[2023-03-13 17:09:10] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-13 17:09:10] [INFO ] [Real]Absence check using 14 positive and 46 generalized place invariants in 48 ms returned sat
[2023-03-13 17:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:11] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2023-03-13 17:09:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:09:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 8 ms returned sat
[2023-03-13 17:09:11] [INFO ] [Nat]Absence check using 14 positive and 46 generalized place invariants in 130 ms returned sat
[2023-03-13 17:09:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:12] [INFO ] [Nat]Absence check using state equation in 808 ms returned sat
[2023-03-13 17:09:12] [INFO ] Computed and/alt/rep : 367/1625/367 causal constraints (skipped 1160 transitions) in 93 ms.
[2023-03-13 17:09:14] [INFO ] Added : 55 causal constraints over 11 iterations in 1551 ms. Result :sat
Minimization took 294 ms.
[2023-03-13 17:09:14] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-13 17:09:14] [INFO ] [Real]Absence check using 14 positive and 46 generalized place invariants in 25 ms returned sat
[2023-03-13 17:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:15] [INFO ] [Real]Absence check using state equation in 452 ms returned sat
[2023-03-13 17:09:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:09:15] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2023-03-13 17:09:15] [INFO ] [Nat]Absence check using 14 positive and 46 generalized place invariants in 38 ms returned sat
[2023-03-13 17:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:15] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2023-03-13 17:09:16] [INFO ] Computed and/alt/rep : 367/1625/367 causal constraints (skipped 1160 transitions) in 115 ms.
[2023-03-13 17:09:19] [INFO ] Added : 121 causal constraints over 25 iterations in 3541 ms. Result :sat
Minimization took 394 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 639 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 639/639 places, 1568/1568 transitions.
Graph (complete) has 3878 edges and 639 vertex of which 631 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 631 transition count 1568
Applied a total of 9 rules in 49 ms. Remains 631 /639 variables (removed 8) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 631/639 places, 1568/1568 transitions.
// Phase 1: matrix 1568 rows 631 cols
[2023-03-13 17:09:22] [INFO ] Computed 60 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 16490 resets, run finished after 2405 ms. (steps per millisecond=415 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2795 resets, run finished after 802 ms. (steps per millisecond=1246 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2797 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 2) seen :0
[2023-03-13 17:09:26] [INFO ] Invariant cache hit.
[2023-03-13 17:09:26] [INFO ] [Real]Absence check using 13 positive place invariants in 57 ms returned sat
[2023-03-13 17:09:26] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 29 ms returned sat
[2023-03-13 17:09:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:27] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2023-03-13 17:09:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:09:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-13 17:09:27] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 59 ms returned sat
[2023-03-13 17:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:27] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2023-03-13 17:09:28] [INFO ] Deduced a trap composed of 64 places in 385 ms of which 19 ms to minimize.
[2023-03-13 17:09:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 486 ms
[2023-03-13 17:09:28] [INFO ] Computed and/alt/rep : 367/1623/367 causal constraints (skipped 1160 transitions) in 173 ms.
[2023-03-13 17:09:29] [INFO ] Added : 38 causal constraints over 8 iterations in 1505 ms. Result :sat
Minimization took 246 ms.
[2023-03-13 17:09:30] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-13 17:09:30] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 26 ms returned sat
[2023-03-13 17:09:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:30] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-13 17:09:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:09:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 113 ms returned sat
[2023-03-13 17:09:31] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 215 ms returned sat
[2023-03-13 17:09:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:31] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2023-03-13 17:09:32] [INFO ] Computed and/alt/rep : 367/1623/367 causal constraints (skipped 1160 transitions) in 155 ms.
[2023-03-13 17:09:33] [INFO ] Added : 48 causal constraints over 10 iterations in 1739 ms. Result :sat
Minimization took 325 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1568/1568 transitions.
Applied a total of 0 rules in 25 ms. Remains 631 /631 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 631/631 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1568/1568 transitions.
Applied a total of 0 rules in 25 ms. Remains 631 /631 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2023-03-13 17:09:34] [INFO ] Invariant cache hit.
[2023-03-13 17:09:35] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-13 17:09:35] [INFO ] Invariant cache hit.
[2023-03-13 17:09:37] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
[2023-03-13 17:09:37] [INFO ] Redundant transitions in 131 ms returned []
[2023-03-13 17:09:37] [INFO ] Invariant cache hit.
[2023-03-13 17:09:38] [INFO ] Dead Transitions using invariants and state equation in 823 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3190 ms. Remains : 631/631 places, 1568/1568 transitions.
Starting property specific reduction for ASLink-PT-08b-UpperBounds-13
[2023-03-13 17:09:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 171 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-13 17:09:38] [INFO ] Invariant cache hit.
[2023-03-13 17:09:38] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 17:09:38] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 40 ms returned sat
[2023-03-13 17:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:38] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-13 17:09:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:09:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 33 ms returned sat
[2023-03-13 17:09:39] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 22 ms returned sat
[2023-03-13 17:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:39] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2023-03-13 17:09:40] [INFO ] Deduced a trap composed of 64 places in 323 ms of which 1 ms to minimize.
[2023-03-13 17:09:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 446 ms
[2023-03-13 17:09:40] [INFO ] Computed and/alt/rep : 367/1623/367 causal constraints (skipped 1160 transitions) in 94 ms.
[2023-03-13 17:09:41] [INFO ] Added : 38 causal constraints over 8 iterations in 1445 ms. Result :sat
Minimization took 216 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1568/1568 transitions.
Applied a total of 0 rules in 24 ms. Remains 631 /631 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 631/631 places, 1568/1568 transitions.
[2023-03-13 17:09:42] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16835 resets, run finished after 2844 ms. (steps per millisecond=351 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2812 resets, run finished after 941 ms. (steps per millisecond=1062 ) properties (out of 1) seen :0
[2023-03-13 17:09:46] [INFO ] Invariant cache hit.
[2023-03-13 17:09:46] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-13 17:09:46] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 31 ms returned sat
[2023-03-13 17:09:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:46] [INFO ] [Real]Absence check using state equation in 474 ms returned sat
[2023-03-13 17:09:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:09:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-13 17:09:47] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 33 ms returned sat
[2023-03-13 17:09:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:47] [INFO ] [Nat]Absence check using state equation in 554 ms returned sat
[2023-03-13 17:09:48] [INFO ] Deduced a trap composed of 64 places in 365 ms of which 1 ms to minimize.
[2023-03-13 17:09:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 493 ms
[2023-03-13 17:09:48] [INFO ] Computed and/alt/rep : 367/1623/367 causal constraints (skipped 1160 transitions) in 104 ms.
[2023-03-13 17:09:49] [INFO ] Added : 38 causal constraints over 8 iterations in 1305 ms. Result :sat
Minimization took 218 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1568/1568 transitions.
Applied a total of 0 rules in 26 ms. Remains 631 /631 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 631/631 places, 1568/1568 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1568/1568 transitions.
Applied a total of 0 rules in 25 ms. Remains 631 /631 variables (removed 0) and now considering 1568/1568 (removed 0) transitions.
[2023-03-13 17:09:50] [INFO ] Invariant cache hit.
[2023-03-13 17:09:55] [INFO ] Implicit Places using invariants in 5421 ms returned []
[2023-03-13 17:09:55] [INFO ] Invariant cache hit.
[2023-03-13 17:09:57] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 6869 ms to find 0 implicit places.
[2023-03-13 17:09:57] [INFO ] Redundant transitions in 67 ms returned []
[2023-03-13 17:09:57] [INFO ] Invariant cache hit.
[2023-03-13 17:09:57] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7608 ms. Remains : 631/631 places, 1568/1568 transitions.
Ending property specific reduction for ASLink-PT-08b-UpperBounds-13 in 19760 ms.
Starting property specific reduction for ASLink-PT-08b-UpperBounds-14
[2023-03-13 17:09:57] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 173 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 28 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-13 17:09:57] [INFO ] Invariant cache hit.
[2023-03-13 17:09:57] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-13 17:09:58] [INFO ] [Real]Absence check using 13 positive and 47 generalized place invariants in 34 ms returned sat
[2023-03-13 17:09:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:58] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-13 17:09:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:09:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-13 17:09:58] [INFO ] [Nat]Absence check using 13 positive and 47 generalized place invariants in 31 ms returned sat
[2023-03-13 17:09:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:09:59] [INFO ] [Nat]Absence check using state equation in 626 ms returned sat
[2023-03-13 17:09:59] [INFO ] Computed and/alt/rep : 367/1623/367 causal constraints (skipped 1160 transitions) in 115 ms.
[2023-03-13 17:10:01] [INFO ] Added : 48 causal constraints over 10 iterations in 1702 ms. Result :sat
Minimization took 315 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[0]
Support contains 1 out of 631 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 631/631 places, 1568/1568 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 629 transition count 1567
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 629 transition count 1566
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 629 transition count 1564
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 627 transition count 1564
Applied a total of 8 rules in 45 ms. Remains 627 /631 variables (removed 4) and now considering 1564/1568 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 627/631 places, 1564/1568 transitions.
// Phase 1: matrix 1564 rows 627 cols
[2023-03-13 17:10:01] [INFO ] Computed 59 place invariants in 30 ms
Incomplete random walk after 1000000 steps, including 16763 resets, run finished after 2508 ms. (steps per millisecond=398 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2817 resets, run finished after 1110 ms. (steps per millisecond=900 ) properties (out of 1) seen :0
[2023-03-13 17:10:05] [INFO ] Invariant cache hit.
[2023-03-13 17:10:05] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2023-03-13 17:10:05] [INFO ] [Real]Absence check using 15 positive and 44 generalized place invariants in 20 ms returned sat
[2023-03-13 17:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 17:10:06] [INFO ] [Real]Absence check using state equation in 683 ms returned sat
[2023-03-13 17:10:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 17:10:06] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-13 17:10:06] [INFO ] [Nat]Absence check using 15 positive and 44 generalized place invariants in 36 ms returned sat
[2023-03-13 17:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 17:10:07] [INFO ] [Nat]Absence check using state equation in 749 ms returned sat
[2023-03-13 17:10:07] [INFO ] Computed and/alt/rep : 363/1619/363 causal constraints (skipped 1160 transitions) in 130 ms.
[2023-03-13 17:10:09] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 1 ms to minimize.
[2023-03-13 17:10:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-13 17:10:09] [INFO ] Added : 42 causal constraints over 9 iterations in 2243 ms. Result :sat
Minimization took 362 ms.
Current structural bounds on expressions (after SMT) : [189] Max seen :[0]
Support contains 1 out of 627 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 1564/1564 transitions.
Applied a total of 0 rules in 26 ms. Remains 627 /627 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 627/627 places, 1564/1564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 627/627 places, 1564/1564 transitions.
Applied a total of 0 rules in 24 ms. Remains 627 /627 variables (removed 0) and now considering 1564/1564 (removed 0) transitions.
[2023-03-13 17:10:10] [INFO ] Invariant cache hit.
[2023-03-13 17:10:11] [INFO ] Implicit Places using invariants in 462 ms returned [86, 87]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 464 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 625/627 places, 1564/1564 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 623 transition count 1562
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 623 transition count 1561
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 622 transition count 1561
Applied a total of 6 rules in 78 ms. Remains 622 /625 variables (removed 3) and now considering 1561/1564 (removed 3) transitions.
// Phase 1: matrix 1561 rows 622 cols
[2023-03-13 17:10:11] [INFO ] Computed 57 place invariants in 11 ms
[2023-03-13 17:10:11] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-13 17:10:11] [INFO ] Invariant cache hit.
[2023-03-13 17:10:13] [INFO ] Implicit Places using invariants and state equation in 1539 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 622/627 places, 1561/1564 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2549 ms. Remains : 622/627 places, 1561/1564 transitions.
[2023-03-13 17:10:13] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 16979 resets, run finished after 2408 ms. (steps per millisecond=415 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2792 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties (out of 1) seen :0
[2023-03-13 17:10:16] [INFO ] Invariant cache hit.
[2023-03-13 17:10:16] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-13 17:10:16] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 79 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA ASLink-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for ASLink-PT-08b-UpperBounds-14 in 18651 ms.
[2023-03-13 17:10:16] [INFO ] Flatten gal took : 209 ms
[2023-03-13 17:10:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-13 17:10:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 631 places, 1568 transitions and 6403 arcs took 15 ms.
Total runtime 286173 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 08b
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 631 places, 1568 transitions, 6403 arcs.
Final Score: 27896.141
Took : 73 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 8109984 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102716 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-08b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is ASLink-PT-08b, 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 r011-oct2-167813599800133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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