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-167813599700109.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-07a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r011-oct2-167813599700109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 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 677K 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-07a-UpperBounds-00
FORMULA_NAME ASLink-PT-07a-UpperBounds-01
FORMULA_NAME ASLink-PT-07a-UpperBounds-02
FORMULA_NAME ASLink-PT-07a-UpperBounds-03
FORMULA_NAME ASLink-PT-07a-UpperBounds-04
FORMULA_NAME ASLink-PT-07a-UpperBounds-05
FORMULA_NAME ASLink-PT-07a-UpperBounds-06
FORMULA_NAME ASLink-PT-07a-UpperBounds-07
FORMULA_NAME ASLink-PT-07a-UpperBounds-08
FORMULA_NAME ASLink-PT-07a-UpperBounds-09
FORMULA_NAME ASLink-PT-07a-UpperBounds-10
FORMULA_NAME ASLink-PT-07a-UpperBounds-11
FORMULA_NAME ASLink-PT-07a-UpperBounds-12
FORMULA_NAME ASLink-PT-07a-UpperBounds-13
FORMULA_NAME ASLink-PT-07a-UpperBounds-14
FORMULA_NAME ASLink-PT-07a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678725217723

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-07a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-13 16:33:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-13 16:33:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:33:40] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2023-03-13 16:33:40] [INFO ] Transformed 1601 places.
[2023-03-13 16:33:40] [INFO ] Transformed 2373 transitions.
[2023-03-13 16:33:40] [INFO ] Found NUPN structural information;
[2023-03-13 16:33:40] [INFO ] Parsed PT model containing 1601 places and 2373 transitions and 8915 arcs in 298 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
// Phase 1: matrix 2348 rows 1601 cols
[2023-03-13 16:33:40] [INFO ] Computed 308 place invariants in 124 ms
Incomplete random walk after 10000 steps, including 50 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 16) seen :7
FORMULA ASLink-PT-07a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-07a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :1
FORMULA ASLink-PT-07a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
[2023-03-13 16:33:41] [INFO ] Invariant cache hit.
[2023-03-13 16:33:41] [INFO ] [Real]Absence check using 75 positive place invariants in 111 ms returned sat
[2023-03-13 16:33:42] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 127 ms returned sat
[2023-03-13 16:33:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:33:43] [INFO ] [Real]Absence check using state equation in 1490 ms returned sat
[2023-03-13 16:33:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:33:44] [INFO ] [Nat]Absence check using 75 positive place invariants in 32 ms returned sat
[2023-03-13 16:33:44] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 59 ms returned sat
[2023-03-13 16:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:33:48] [INFO ] [Nat]Absence check using state equation in 4613 ms returned unknown
[2023-03-13 16:33:49] [INFO ] [Real]Absence check using 75 positive place invariants in 43 ms returned sat
[2023-03-13 16:33:49] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 58 ms returned sat
[2023-03-13 16:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:33:50] [INFO ] [Real]Absence check using state equation in 1171 ms returned sat
[2023-03-13 16:33:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:33:50] [INFO ] [Nat]Absence check using 75 positive place invariants in 37 ms returned sat
[2023-03-13 16:33:51] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 81 ms returned sat
[2023-03-13 16:33:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:33:55] [INFO ] [Nat]Absence check using state equation in 4678 ms returned unknown
[2023-03-13 16:33:56] [INFO ] [Real]Absence check using 75 positive place invariants in 29 ms returned sat
[2023-03-13 16:33:56] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 118 ms returned sat
[2023-03-13 16:33:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:33:57] [INFO ] [Real]Absence check using state equation in 1215 ms returned sat
[2023-03-13 16:33:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:33:57] [INFO ] [Nat]Absence check using 75 positive place invariants in 50 ms returned sat
[2023-03-13 16:33:57] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 67 ms returned sat
[2023-03-13 16:33:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:33:59] [INFO ] [Nat]Absence check using state equation in 1263 ms returned sat
[2023-03-13 16:33:59] [INFO ] Deduced a trap composed of 46 places in 356 ms of which 5 ms to minimize.
[2023-03-13 16:34:00] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 1 ms to minimize.
[2023-03-13 16:34:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1078 ms
[2023-03-13 16:34:00] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 213 ms.
[2023-03-13 16:34:02] [INFO ] Added : 5 causal constraints over 1 iterations in 2301 ms. Result :unknown
[2023-03-13 16:34:02] [INFO ] [Real]Absence check using 75 positive place invariants in 30 ms returned sat
[2023-03-13 16:34:02] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 60 ms returned sat
[2023-03-13 16:34:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:03] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2023-03-13 16:34:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:34:04] [INFO ] [Nat]Absence check using 75 positive place invariants in 33 ms returned sat
[2023-03-13 16:34:04] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 63 ms returned sat
[2023-03-13 16:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:07] [INFO ] [Nat]Absence check using state equation in 3103 ms returned sat
[2023-03-13 16:34:07] [INFO ] Computed and/alt/rep : 982/3478/982 causal constraints (skipped 1365 transitions) in 214 ms.
[2023-03-13 16:34:10] [INFO ] Deduced a trap composed of 4 places in 1160 ms of which 25 ms to minimize.
[2023-03-13 16:34:10] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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 16:34:10] [INFO ] [Real]Absence check using 75 positive place invariants in 31 ms returned sat
[2023-03-13 16:34:10] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 76 ms returned sat
[2023-03-13 16:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:11] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2023-03-13 16:34:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:34:11] [INFO ] [Nat]Absence check using 75 positive place invariants in 28 ms returned sat
[2023-03-13 16:34:12] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 119 ms returned sat
[2023-03-13 16:34:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:16] [INFO ] [Nat]Absence check using state equation in 4513 ms returned unknown
[2023-03-13 16:34:16] [INFO ] [Real]Absence check using 75 positive place invariants in 30 ms returned sat
[2023-03-13 16:34:17] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 66 ms returned sat
[2023-03-13 16:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:18] [INFO ] [Real]Absence check using state equation in 1100 ms returned sat
[2023-03-13 16:34:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:34:18] [INFO ] [Nat]Absence check using 75 positive place invariants in 32 ms returned sat
[2023-03-13 16:34:18] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 94 ms returned sat
[2023-03-13 16:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:23] [INFO ] [Nat]Absence check using state equation in 4489 ms returned sat
[2023-03-13 16:34:24] [INFO ] Deduced a trap composed of 4 places in 1339 ms of which 2 ms to minimize.
[2023-03-13 16:34:24] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 16:34:24] [INFO ] [Real]Absence check using 75 positive place invariants in 30 ms returned sat
[2023-03-13 16:34:25] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 75 ms returned sat
[2023-03-13 16:34:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:26] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2023-03-13 16:34:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:34:26] [INFO ] [Nat]Absence check using 75 positive place invariants in 51 ms returned sat
[2023-03-13 16:34:26] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 82 ms returned sat
[2023-03-13 16:34:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:31] [INFO ] [Nat]Absence check using state equation in 4589 ms returned unknown
[2023-03-13 16:34:31] [INFO ] [Real]Absence check using 75 positive place invariants in 59 ms returned sat
[2023-03-13 16:34:31] [INFO ] [Real]Absence check using 75 positive and 233 generalized place invariants in 123 ms returned sat
[2023-03-13 16:34:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:33] [INFO ] [Real]Absence check using state equation in 1273 ms returned sat
[2023-03-13 16:34:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:34:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 60 ms returned sat
[2023-03-13 16:34:33] [INFO ] [Nat]Absence check using 75 positive and 233 generalized place invariants in 82 ms returned sat
[2023-03-13 16:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:38] [INFO ] [Nat]Absence check using state equation in 4538 ms returned unknown
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]
FORMULA ASLink-PT-07a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1601 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1601/1601 places, 2348/2348 transitions.
Ensure Unique test removed 28 places
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 188 rules applied. Total rules applied 188 place count 1559 transition count 2202
Reduce places removed 146 places and 0 transitions.
Iterating post reduction 1 with 146 rules applied. Total rules applied 334 place count 1413 transition count 2202
Performed 149 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 149 Pre rules applied. Total rules applied 334 place count 1413 transition count 2053
Deduced a syphon composed of 149 places in 7 ms
Ensure Unique test removed 59 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 2 with 357 rules applied. Total rules applied 691 place count 1205 transition count 2053
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 692 place count 1205 transition count 2052
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 693 place count 1204 transition count 2052
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 703 place count 1194 transition count 1999
Ensure Unique test removed 1 places
Iterating global reduction 4 with 11 rules applied. Total rules applied 714 place count 1193 transition count 1999
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 720 place count 1192 transition count 1994
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 723 place count 1189 transition count 1994
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 724 place count 1188 transition count 1986
Iterating global reduction 6 with 1 rules applied. Total rules applied 725 place count 1188 transition count 1986
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 726 place count 1187 transition count 1978
Iterating global reduction 6 with 1 rules applied. Total rules applied 727 place count 1187 transition count 1978
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 728 place count 1186 transition count 1970
Iterating global reduction 6 with 1 rules applied. Total rules applied 729 place count 1186 transition count 1970
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 730 place count 1185 transition count 1962
Iterating global reduction 6 with 1 rules applied. Total rules applied 731 place count 1185 transition count 1962
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 732 place count 1184 transition count 1954
Iterating global reduction 6 with 1 rules applied. Total rules applied 733 place count 1184 transition count 1954
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 734 place count 1183 transition count 1946
Iterating global reduction 6 with 1 rules applied. Total rules applied 735 place count 1183 transition count 1946
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 736 place count 1182 transition count 1938
Iterating global reduction 6 with 1 rules applied. Total rules applied 737 place count 1182 transition count 1938
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 738 place count 1181 transition count 1930
Iterating global reduction 6 with 1 rules applied. Total rules applied 739 place count 1181 transition count 1930
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 740 place count 1180 transition count 1922
Iterating global reduction 6 with 1 rules applied. Total rules applied 741 place count 1180 transition count 1922
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 742 place count 1179 transition count 1914
Iterating global reduction 6 with 1 rules applied. Total rules applied 743 place count 1179 transition count 1914
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 744 place count 1178 transition count 1906
Iterating global reduction 6 with 1 rules applied. Total rules applied 745 place count 1178 transition count 1906
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 746 place count 1177 transition count 1898
Iterating global reduction 6 with 1 rules applied. Total rules applied 747 place count 1177 transition count 1898
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 748 place count 1176 transition count 1890
Iterating global reduction 6 with 1 rules applied. Total rules applied 749 place count 1176 transition count 1890
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 750 place count 1175 transition count 1882
Iterating global reduction 6 with 1 rules applied. Total rules applied 751 place count 1175 transition count 1882
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 752 place count 1174 transition count 1874
Iterating global reduction 6 with 1 rules applied. Total rules applied 753 place count 1174 transition count 1874
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 754 place count 1173 transition count 1866
Iterating global reduction 6 with 1 rules applied. Total rules applied 755 place count 1173 transition count 1866
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 853 place count 1124 transition count 1817
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 859 place count 1124 transition count 1811
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 865 place count 1118 transition count 1811
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 873 place count 1118 transition count 1811
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 874 place count 1117 transition count 1810
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 888 place count 1103 transition count 1810
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 28 Pre rules applied. Total rules applied 888 place count 1103 transition count 1782
Deduced a syphon composed of 28 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 57 rules applied. Total rules applied 945 place count 1074 transition count 1782
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 8 with 8 rules applied. Total rules applied 953 place count 1066 transition count 1782
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 953 place count 1066 transition count 1781
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 955 place count 1065 transition count 1781
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 9 with 16 rules applied. Total rules applied 971 place count 1057 transition count 1773
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 978 place count 1050 transition count 1766
Iterating global reduction 9 with 7 rules applied. Total rules applied 985 place count 1050 transition count 1766
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 992 place count 1050 transition count 1759
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 999 place count 1043 transition count 1759
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 1006 place count 1043 transition count 1759
Applied a total of 1006 rules in 1905 ms. Remains 1043 /1601 variables (removed 558) and now considering 1759/2348 (removed 589) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1906 ms. Remains : 1043/1601 places, 1759/2348 transitions.
// Phase 1: matrix 1759 rows 1043 cols
[2023-03-13 16:34:40] [INFO ] Computed 182 place invariants in 50 ms
Incomplete random walk after 1000000 steps, including 10739 resets, run finished after 3810 ms. (steps per millisecond=262 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1524 resets, run finished after 1685 ms. (steps per millisecond=593 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1531 resets, run finished after 1416 ms. (steps per millisecond=706 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1541 resets, run finished after 1284 ms. (steps per millisecond=778 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1533 resets, run finished after 1290 ms. (steps per millisecond=775 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1548 resets, run finished after 1296 ms. (steps per millisecond=771 ) properties (out of 5) seen :0
[2023-03-13 16:34:51] [INFO ] Invariant cache hit.
[2023-03-13 16:34:51] [INFO ] [Real]Absence check using 44 positive place invariants in 18 ms returned sat
[2023-03-13 16:34:51] [INFO ] [Real]Absence check using 44 positive and 138 generalized place invariants in 34 ms returned sat
[2023-03-13 16:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:52] [INFO ] [Real]Absence check using state equation in 623 ms returned sat
[2023-03-13 16:34:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:34:52] [INFO ] [Nat]Absence check using 44 positive place invariants in 14 ms returned sat
[2023-03-13 16:34:52] [INFO ] [Nat]Absence check using 44 positive and 138 generalized place invariants in 135 ms returned sat
[2023-03-13 16:34:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:34:54] [INFO ] [Nat]Absence check using state equation in 1446 ms returned sat
[2023-03-13 16:34:54] [INFO ] Computed and/alt/rep : 695/2643/695 causal constraints (skipped 1027 transitions) in 120 ms.
[2023-03-13 16:35:01] [INFO ] Added : 15 causal constraints over 3 iterations in 6556 ms. Result :unknown
[2023-03-13 16:35:01] [INFO ] [Real]Absence check using 44 positive place invariants in 65 ms returned sat
[2023-03-13 16:35:01] [INFO ] [Real]Absence check using 44 positive and 138 generalized place invariants in 194 ms returned sat
[2023-03-13 16:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:02] [INFO ] [Real]Absence check using state equation in 965 ms returned sat
[2023-03-13 16:35:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:35:02] [INFO ] [Nat]Absence check using 44 positive place invariants in 29 ms returned sat
[2023-03-13 16:35:02] [INFO ] [Nat]Absence check using 44 positive and 138 generalized place invariants in 37 ms returned sat
[2023-03-13 16:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:04] [INFO ] [Nat]Absence check using state equation in 1264 ms returned sat
[2023-03-13 16:35:04] [INFO ] Computed and/alt/rep : 695/2643/695 causal constraints (skipped 1027 transitions) in 117 ms.
[2023-03-13 16:35:15] [INFO ] Added : 185 causal constraints over 37 iterations in 11781 ms. Result :unknown
[2023-03-13 16:35:16] [INFO ] [Real]Absence check using 44 positive place invariants in 12 ms returned sat
[2023-03-13 16:35:16] [INFO ] [Real]Absence check using 44 positive and 138 generalized place invariants in 130 ms returned sat
[2023-03-13 16:35:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:17] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2023-03-13 16:35:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:35:17] [INFO ] [Nat]Absence check using 44 positive place invariants in 14 ms returned sat
[2023-03-13 16:35:17] [INFO ] [Nat]Absence check using 44 positive and 138 generalized place invariants in 74 ms returned sat
[2023-03-13 16:35:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:18] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2023-03-13 16:35:18] [INFO ] Computed and/alt/rep : 695/2643/695 causal constraints (skipped 1027 transitions) in 122 ms.
[2023-03-13 16:35:24] [INFO ] Added : 202 causal constraints over 41 iterations in 6107 ms. Result :sat
Minimization took 478 ms.
[2023-03-13 16:35:25] [INFO ] [Real]Absence check using 44 positive place invariants in 84 ms returned sat
[2023-03-13 16:35:25] [INFO ] [Real]Absence check using 44 positive and 138 generalized place invariants in 46 ms returned sat
[2023-03-13 16:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:26] [INFO ] [Real]Absence check using state equation in 828 ms returned sat
[2023-03-13 16:35:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:35:26] [INFO ] [Nat]Absence check using 44 positive place invariants in 42 ms returned sat
[2023-03-13 16:35:26] [INFO ] [Nat]Absence check using 44 positive and 138 generalized place invariants in 50 ms returned sat
[2023-03-13 16:35:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:27] [INFO ] [Nat]Absence check using state equation in 1036 ms returned sat
[2023-03-13 16:35:28] [INFO ] Deduced a trap composed of 104 places in 677 ms of which 27 ms to minimize.
[2023-03-13 16:35:28] [INFO ] Deduced a trap composed of 81 places in 262 ms of which 0 ms to minimize.
[2023-03-13 16:35:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1152 ms
[2023-03-13 16:35:29] [INFO ] Computed and/alt/rep : 695/2643/695 causal constraints (skipped 1027 transitions) in 131 ms.
[2023-03-13 16:35:34] [INFO ] Added : 188 causal constraints over 39 iterations in 5840 ms. Result :sat
Minimization took 1252 ms.
[2023-03-13 16:35:36] [INFO ] [Real]Absence check using 44 positive place invariants in 41 ms returned sat
[2023-03-13 16:35:36] [INFO ] [Real]Absence check using 44 positive and 138 generalized place invariants in 46 ms returned sat
[2023-03-13 16:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:37] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2023-03-13 16:35:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:35:37] [INFO ] [Nat]Absence check using 44 positive place invariants in 14 ms returned sat
[2023-03-13 16:35:37] [INFO ] [Nat]Absence check using 44 positive and 138 generalized place invariants in 83 ms returned sat
[2023-03-13 16:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:35:38] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2023-03-13 16:35:38] [INFO ] Computed and/alt/rep : 695/2643/695 causal constraints (skipped 1027 transitions) in 111 ms.
[2023-03-13 16:35:53] [INFO ] Deduced a trap composed of 87 places in 566 ms of which 23 ms to minimize.
[2023-03-13 16:35:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 727 ms
[2023-03-13 16:35:54] [INFO ] Added : 562 causal constraints over 113 iterations in 15702 ms. Result :sat
Minimization took 457 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 1759/1759 transitions.
Applied a total of 0 rules in 32 ms. Remains 1043 /1043 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 1043/1043 places, 1759/1759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 1759/1759 transitions.
Applied a total of 0 rules in 29 ms. Remains 1043 /1043 variables (removed 0) and now considering 1759/1759 (removed 0) transitions.
[2023-03-13 16:35:58] [INFO ] Invariant cache hit.
[2023-03-13 16:36:00] [INFO ] Implicit Places using invariants in 1413 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 501, 505, 506, 517, 518, 519, 537, 555, 624, 628, 629, 640, 641, 642, 660, 678, 747, 751, 752, 763, 764, 765, 783, 801, 870, 874, 875, 878, 889, 890, 891, 909, 911, 914, 932, 933, 934, 935, 947, 953, 959, 965, 971, 977, 983, 989, 995, 1001, 1007]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 1431 ms to find 78 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 965/1043 places, 1759/1759 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 965 transition count 1625
Reduce places removed 134 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 269 place count 831 transition count 1624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 830 transition count 1624
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 270 place count 830 transition count 1589
Deduced a syphon composed of 35 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 71 rules applied. Total rules applied 341 place count 794 transition count 1589
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 353 place count 790 transition count 1581
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 361 place count 782 transition count 1581
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 376 place count 767 transition count 1566
Iterating global reduction 5 with 15 rules applied. Total rules applied 391 place count 767 transition count 1566
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 394 place count 767 transition count 1563
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 394 place count 767 transition count 1562
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 396 place count 766 transition count 1562
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 399 place count 763 transition count 1559
Iterating global reduction 6 with 3 rules applied. Total rules applied 402 place count 763 transition count 1559
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 403 place count 762 transition count 1558
Iterating global reduction 6 with 1 rules applied. Total rules applied 404 place count 762 transition count 1558
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 405 place count 761 transition count 1557
Iterating global reduction 6 with 1 rules applied. Total rules applied 406 place count 761 transition count 1557
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 6 with 120 rules applied. Total rules applied 526 place count 701 transition count 1497
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 533 place count 701 transition count 1490
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 540 place count 694 transition count 1483
Iterating global reduction 7 with 7 rules applied. Total rules applied 547 place count 694 transition count 1483
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 554 place count 694 transition count 1476
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 8 with 15 rules applied. Total rules applied 569 place count 694 transition count 1461
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 585 place count 678 transition count 1461
Partial Free-agglomeration rule applied 22 times.
Drop transitions removed 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 607 place count 678 transition count 1461
Applied a total of 607 rules in 245 ms. Remains 678 /965 variables (removed 287) and now considering 1461/1759 (removed 298) transitions.
// Phase 1: matrix 1461 rows 678 cols
[2023-03-13 16:36:00] [INFO ] Computed 98 place invariants in 27 ms
[2023-03-13 16:36:01] [INFO ] Implicit Places using invariants in 835 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184, 189, 190, 242, 259, 265, 268, 270, 275, 276, 328, 345, 351, 354, 356, 361, 362, 414, 431, 437, 440, 442, 447, 448, 500, 518, 524, 527, 529, 534, 535, 587, 604, 610, 613, 615]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 843 ms to find 47 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 631/1043 places, 1461/1759 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 610 transition count 1440
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 610 transition count 1440
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 603 transition count 1433
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 603 transition count 1433
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 84 place count 589 transition count 1419
Free-agglomeration rule applied 21 times.
Iterating global reduction 0 with 21 rules applied. Total rules applied 105 place count 589 transition count 1398
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 126 place count 568 transition count 1398
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 568 transition count 1391
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 140 place count 561 transition count 1391
Applied a total of 140 rules in 145 ms. Remains 561 /631 variables (removed 70) and now considering 1391/1461 (removed 70) transitions.
// Phase 1: matrix 1391 rows 561 cols
[2023-03-13 16:36:01] [INFO ] Computed 51 place invariants in 25 ms
[2023-03-13 16:36:01] [INFO ] Implicit Places using invariants in 433 ms returned []
[2023-03-13 16:36:01] [INFO ] Invariant cache hit.
[2023-03-13 16:36:03] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 561/1043 places, 1391/1759 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4641 ms. Remains : 561/1043 places, 1391/1759 transitions.
Successfully produced net in file /tmp/petri1000_6033398843515667503.dot
Successfully produced net in file /tmp/petri1001_11789122576624761229.dot
Successfully produced net in file /tmp/petri1002_17387018746949336510.dot
Successfully produced net in file /tmp/petri1003_10814656722595250360.dot
Successfully produced net in file /tmp/petri1004_5439834694807097302.dot
Successfully produced net in file /tmp/petri1005_12583875769414389922.dot
Successfully produced net in file /tmp/petri1006_4783358278932705229.dot
Drop transitions removed 7 transitions
Dominated transitions for bounds rules discarded 7 transitions
// Phase 1: matrix 1384 rows 561 cols
[2023-03-13 16:36:03] [INFO ] Computed 51 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 17418 resets, run finished after 2196 ms. (steps per millisecond=455 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3402 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3397 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3373 resets, run finished after 884 ms. (steps per millisecond=1131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3384 resets, run finished after 911 ms. (steps per millisecond=1097 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3379 resets, run finished after 966 ms. (steps per millisecond=1035 ) properties (out of 5) seen :0
[2023-03-13 16:36:10] [INFO ] Invariant cache hit.
[2023-03-13 16:36:10] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-13 16:36:10] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 78 ms returned sat
[2023-03-13 16:36:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:10] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2023-03-13 16:36:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:11] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 16:36:11] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 17 ms returned sat
[2023-03-13 16:36:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:11] [INFO ] [Nat]Absence check using state equation in 631 ms returned sat
[2023-03-13 16:36:12] [INFO ] Computed and/alt/rep : 306/1333/306 causal constraints (skipped 1044 transitions) in 100 ms.
[2023-03-13 16:36:12] [INFO ] Added : 34 causal constraints over 9 iterations in 1040 ms. Result :sat
Minimization took 177 ms.
[2023-03-13 16:36:13] [INFO ] [Real]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 16:36:13] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 15 ms returned sat
[2023-03-13 16:36:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:14] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2023-03-13 16:36:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:14] [INFO ] [Nat]Absence check using 12 positive place invariants in 29 ms returned sat
[2023-03-13 16:36:14] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 18 ms returned sat
[2023-03-13 16:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:14] [INFO ] [Nat]Absence check using state equation in 578 ms returned sat
[2023-03-13 16:36:15] [INFO ] Computed and/alt/rep : 306/1333/306 causal constraints (skipped 1044 transitions) in 95 ms.
[2023-03-13 16:36:15] [INFO ] Added : 22 causal constraints over 6 iterations in 956 ms. Result :sat
Minimization took 266 ms.
[2023-03-13 16:36:16] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-03-13 16:36:16] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 11 ms returned sat
[2023-03-13 16:36:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:16] [INFO ] [Real]Absence check using state equation in 454 ms returned sat
[2023-03-13 16:36:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-13 16:36:17] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 18 ms returned sat
[2023-03-13 16:36:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:17] [INFO ] [Nat]Absence check using state equation in 528 ms returned sat
[2023-03-13 16:36:17] [INFO ] Computed and/alt/rep : 306/1333/306 causal constraints (skipped 1044 transitions) in 116 ms.
[2023-03-13 16:36:18] [INFO ] Added : 19 causal constraints over 4 iterations in 862 ms. Result :sat
Minimization took 326 ms.
[2023-03-13 16:36:19] [INFO ] [Real]Absence check using 12 positive place invariants in 6 ms returned sat
[2023-03-13 16:36:19] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 27 ms returned sat
[2023-03-13 16:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:19] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2023-03-13 16:36:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 79 ms returned sat
[2023-03-13 16:36:19] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 16 ms returned sat
[2023-03-13 16:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:20] [INFO ] [Nat]Absence check using state equation in 509 ms returned sat
[2023-03-13 16:36:20] [INFO ] Computed and/alt/rep : 306/1333/306 causal constraints (skipped 1044 transitions) in 101 ms.
[2023-03-13 16:36:21] [INFO ] Added : 26 causal constraints over 6 iterations in 1055 ms. Result :sat
Minimization took 324 ms.
[2023-03-13 16:36:21] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-13 16:36:21] [INFO ] [Real]Absence check using 12 positive and 39 generalized place invariants in 26 ms returned sat
[2023-03-13 16:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:22] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2023-03-13 16:36:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:22] [INFO ] [Nat]Absence check using 12 positive place invariants in 39 ms returned sat
[2023-03-13 16:36:22] [INFO ] [Nat]Absence check using 12 positive and 39 generalized place invariants in 37 ms returned sat
[2023-03-13 16:36:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:23] [INFO ] [Nat]Absence check using state equation in 791 ms returned sat
[2023-03-13 16:36:23] [INFO ] Computed and/alt/rep : 306/1333/306 causal constraints (skipped 1044 transitions) in 122 ms.
[2023-03-13 16:36:24] [INFO ] Added : 9 causal constraints over 2 iterations in 458 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-07a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-07a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 561/561 places, 1384/1384 transitions.
Graph (complete) has 3445 edges and 561 vertex of which 554 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 8 place count 554 transition count 1384
Applied a total of 8 rules in 39 ms. Remains 554 /561 variables (removed 7) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 554/561 places, 1384/1384 transitions.
// Phase 1: matrix 1384 rows 554 cols
[2023-03-13 16:36:25] [INFO ] Computed 51 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 17277 resets, run finished after 2384 ms. (steps per millisecond=419 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3419 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3409 resets, run finished after 780 ms. (steps per millisecond=1282 ) properties (out of 2) seen :0
[2023-03-13 16:36:29] [INFO ] Invariant cache hit.
[2023-03-13 16:36:29] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2023-03-13 16:36:29] [INFO ] [Real]Absence check using 14 positive and 37 generalized place invariants in 171 ms returned sat
[2023-03-13 16:36:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:30] [INFO ] [Real]Absence check using state equation in 526 ms returned sat
[2023-03-13 16:36:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:30] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-13 16:36:30] [INFO ] [Nat]Absence check using 14 positive and 37 generalized place invariants in 164 ms returned sat
[2023-03-13 16:36:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:31] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2023-03-13 16:36:31] [INFO ] Computed and/alt/rep : 306/1331/306 causal constraints (skipped 1044 transitions) in 111 ms.
[2023-03-13 16:36:32] [INFO ] Added : 21 causal constraints over 5 iterations in 724 ms. Result :sat
Minimization took 226 ms.
[2023-03-13 16:36:32] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-13 16:36:32] [INFO ] [Real]Absence check using 14 positive and 37 generalized place invariants in 25 ms returned sat
[2023-03-13 16:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:33] [INFO ] [Real]Absence check using state equation in 908 ms returned sat
[2023-03-13 16:36:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 44 ms returned sat
[2023-03-13 16:36:34] [INFO ] [Nat]Absence check using 14 positive and 37 generalized place invariants in 48 ms returned sat
[2023-03-13 16:36:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:34] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2023-03-13 16:36:34] [INFO ] Computed and/alt/rep : 306/1331/306 causal constraints (skipped 1044 transitions) in 104 ms.
[2023-03-13 16:36:34] [INFO ] Added : 12 causal constraints over 3 iterations in 350 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1384/1384 transitions.
Applied a total of 0 rules in 21 ms. Remains 554 /554 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 554/554 places, 1384/1384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1384/1384 transitions.
Applied a total of 0 rules in 21 ms. Remains 554 /554 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
[2023-03-13 16:36:35] [INFO ] Invariant cache hit.
[2023-03-13 16:36:35] [INFO ] Implicit Places using invariants in 468 ms returned []
[2023-03-13 16:36:35] [INFO ] Invariant cache hit.
[2023-03-13 16:36:37] [INFO ] Implicit Places using invariants and state equation in 1211 ms returned []
Implicit Place search using SMT with State Equation took 1708 ms to find 0 implicit places.
[2023-03-13 16:36:37] [INFO ] Redundant transitions in 90 ms returned []
[2023-03-13 16:36:37] [INFO ] Invariant cache hit.
[2023-03-13 16:36:38] [INFO ] Dead Transitions using invariants and state equation in 821 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2654 ms. Remains : 554/554 places, 1384/1384 transitions.
Starting property specific reduction for ASLink-PT-07a-UpperBounds-02
[2023-03-13 16:36:38] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 140 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
[2023-03-13 16:36:38] [INFO ] Invariant cache hit.
[2023-03-13 16:36:38] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-13 16:36:38] [INFO ] [Real]Absence check using 14 positive and 37 generalized place invariants in 13 ms returned sat
[2023-03-13 16:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:38] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-13 16:36:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 80 ms returned sat
[2023-03-13 16:36:38] [INFO ] [Nat]Absence check using 14 positive and 37 generalized place invariants in 20 ms returned sat
[2023-03-13 16:36:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:39] [INFO ] [Nat]Absence check using state equation in 897 ms returned sat
[2023-03-13 16:36:39] [INFO ] Computed and/alt/rep : 306/1331/306 causal constraints (skipped 1044 transitions) in 104 ms.
[2023-03-13 16:36:40] [INFO ] Added : 21 causal constraints over 5 iterations in 839 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1384/1384 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 554 transition count 1383
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 553 transition count 1383
Applied a total of 2 rules in 22 ms. Remains 553 /554 variables (removed 1) and now considering 1383/1384 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 553/554 places, 1383/1384 transitions.
// Phase 1: matrix 1383 rows 553 cols
[2023-03-13 16:36:41] [INFO ] Computed 51 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 17169 resets, run finished after 2324 ms. (steps per millisecond=430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3424 resets, run finished after 770 ms. (steps per millisecond=1298 ) properties (out of 1) seen :0
[2023-03-13 16:36:44] [INFO ] Invariant cache hit.
[2023-03-13 16:36:44] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-13 16:36:44] [INFO ] [Real]Absence check using 14 positive and 37 generalized place invariants in 82 ms returned sat
[2023-03-13 16:36:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:45] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2023-03-13 16:36:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:45] [INFO ] [Nat]Absence check using 14 positive place invariants in 15 ms returned sat
[2023-03-13 16:36:45] [INFO ] [Nat]Absence check using 14 positive and 37 generalized place invariants in 38 ms returned sat
[2023-03-13 16:36:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:45] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2023-03-13 16:36:46] [INFO ] Computed and/alt/rep : 305/1330/305 causal constraints (skipped 1044 transitions) in 152 ms.
[2023-03-13 16:36:46] [INFO ] Added : 17 causal constraints over 4 iterations in 766 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1383/1383 transitions.
Applied a total of 0 rules in 18 ms. Remains 553 /553 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 553/553 places, 1383/1383 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1383/1383 transitions.
Applied a total of 0 rules in 17 ms. Remains 553 /553 variables (removed 0) and now considering 1383/1383 (removed 0) transitions.
[2023-03-13 16:36:47] [INFO ] Invariant cache hit.
[2023-03-13 16:36:48] [INFO ] Implicit Places using invariants in 947 ms returned []
[2023-03-13 16:36:48] [INFO ] Invariant cache hit.
[2023-03-13 16:36:50] [INFO ] Implicit Places using invariants and state equation in 1984 ms returned []
Implicit Place search using SMT with State Equation took 2938 ms to find 0 implicit places.
[2023-03-13 16:36:50] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-13 16:36:50] [INFO ] Invariant cache hit.
[2023-03-13 16:36:50] [INFO ] Dead Transitions using invariants and state equation in 549 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3709 ms. Remains : 553/553 places, 1383/1383 transitions.
Ending property specific reduction for ASLink-PT-07a-UpperBounds-02 in 12657 ms.
Starting property specific reduction for ASLink-PT-07a-UpperBounds-15
// Phase 1: matrix 1384 rows 554 cols
[2023-03-13 16:36:50] [INFO ] Computed 51 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 173 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-13 16:36:50] [INFO ] Invariant cache hit.
[2023-03-13 16:36:50] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-13 16:36:50] [INFO ] [Real]Absence check using 14 positive and 37 generalized place invariants in 36 ms returned sat
[2023-03-13 16:36:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:51] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2023-03-13 16:36:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-13 16:36:51] [INFO ] [Nat]Absence check using 14 positive and 37 generalized place invariants in 12 ms returned sat
[2023-03-13 16:36:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:52] [INFO ] [Nat]Absence check using state equation in 417 ms returned sat
[2023-03-13 16:36:52] [INFO ] Computed and/alt/rep : 306/1331/306 causal constraints (skipped 1044 transitions) in 69 ms.
[2023-03-13 16:36:52] [INFO ] Added : 12 causal constraints over 3 iterations in 288 ms. Result :sat
Minimization took 248 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1384/1384 transitions.
Applied a total of 0 rules in 15 ms. Remains 554 /554 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 554/554 places, 1384/1384 transitions.
[2023-03-13 16:36:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17321 resets, run finished after 2298 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3414 resets, run finished after 914 ms. (steps per millisecond=1094 ) properties (out of 1) seen :0
[2023-03-13 16:36:56] [INFO ] Invariant cache hit.
[2023-03-13 16:36:56] [INFO ] [Real]Absence check using 14 positive place invariants in 19 ms returned sat
[2023-03-13 16:36:56] [INFO ] [Real]Absence check using 14 positive and 37 generalized place invariants in 22 ms returned sat
[2023-03-13 16:36:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:56] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-13 16:36:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 16:36:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-13 16:36:56] [INFO ] [Nat]Absence check using 14 positive and 37 generalized place invariants in 9 ms returned sat
[2023-03-13 16:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 16:36:57] [INFO ] [Nat]Absence check using state equation in 583 ms returned sat
[2023-03-13 16:36:57] [INFO ] Computed and/alt/rep : 306/1331/306 causal constraints (skipped 1044 transitions) in 74 ms.
[2023-03-13 16:36:57] [INFO ] Added : 12 causal constraints over 3 iterations in 381 ms. Result :sat
Minimization took 280 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 554 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 554 /554 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 554/554 places, 1384/1384 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 554/554 places, 1384/1384 transitions.
Applied a total of 0 rules in 17 ms. Remains 554 /554 variables (removed 0) and now considering 1384/1384 (removed 0) transitions.
[2023-03-13 16:36:58] [INFO ] Invariant cache hit.
[2023-03-13 16:36:58] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-03-13 16:36:58] [INFO ] Invariant cache hit.
[2023-03-13 16:37:00] [INFO ] Implicit Places using invariants and state equation in 1939 ms returned []
Implicit Place search using SMT with State Equation took 2355 ms to find 0 implicit places.
[2023-03-13 16:37:00] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-13 16:37:00] [INFO ] Invariant cache hit.
[2023-03-13 16:37:01] [INFO ] Dead Transitions using invariants and state equation in 663 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3087 ms. Remains : 554/554 places, 1384/1384 transitions.
Ending property specific reduction for ASLink-PT-07a-UpperBounds-15 in 10666 ms.
[2023-03-13 16:37:02] [INFO ] Flatten gal took : 222 ms
[2023-03-13 16:37:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-13 16:37:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 554 places, 1384 transitions and 5658 arcs took 5 ms.
Total runtime 201734 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running ASLink (PT), instance 07a
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: 554 places, 1384 transitions, 5658 arcs.
Final Score: 24758.48
Took : 61 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7106028 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16102072 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-07a"
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-07a, 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-167813599700109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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