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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:13 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 921K 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-06b-UpperBounds-00
FORMULA_NAME ASLink-PT-06b-UpperBounds-01
FORMULA_NAME ASLink-PT-06b-UpperBounds-02
FORMULA_NAME ASLink-PT-06b-UpperBounds-03
FORMULA_NAME ASLink-PT-06b-UpperBounds-04
FORMULA_NAME ASLink-PT-06b-UpperBounds-05
FORMULA_NAME ASLink-PT-06b-UpperBounds-06
FORMULA_NAME ASLink-PT-06b-UpperBounds-07
FORMULA_NAME ASLink-PT-06b-UpperBounds-08
FORMULA_NAME ASLink-PT-06b-UpperBounds-09
FORMULA_NAME ASLink-PT-06b-UpperBounds-10
FORMULA_NAME ASLink-PT-06b-UpperBounds-11
FORMULA_NAME ASLink-PT-06b-UpperBounds-12
FORMULA_NAME ASLink-PT-06b-UpperBounds-13
FORMULA_NAME ASLink-PT-06b-UpperBounds-14
FORMULA_NAME ASLink-PT-06b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678610425376

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 08:40:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 08:40:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:40:28] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2023-03-12 08:40:29] [INFO ] Transformed 2826 places.
[2023-03-12 08:40:29] [INFO ] Transformed 3513 transitions.
[2023-03-12 08:40:29] [INFO ] Found NUPN structural information;
[2023-03-12 08:40:29] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 3513 rows 2826 cols
[2023-03-12 08:40:29] [INFO ] Computed 277 place invariants in 235 ms
Incomplete random walk after 10000 steps, including 19 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 16) seen :12
FORMULA ASLink-PT-06b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
[2023-03-12 08:40:29] [INFO ] Invariant cache hit.
[2023-03-12 08:40:30] [INFO ] [Real]Absence check using 65 positive place invariants in 56 ms returned sat
[2023-03-12 08:40:30] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 161 ms returned sat
[2023-03-12 08:40:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:40:33] [INFO ] [Real]Absence check using state equation in 2529 ms returned sat
[2023-03-12 08:40:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:40:34] [INFO ] [Nat]Absence check using 65 positive place invariants in 58 ms returned sat
[2023-03-12 08:40:34] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 173 ms returned sat
[2023-03-12 08:40:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:40:36] [INFO ] [Nat]Absence check using state equation in 2581 ms returned sat
[2023-03-12 08:40:40] [INFO ] Deduced a trap composed of 43 places in 3576 ms of which 11 ms to minimize.
[2023-03-12 08:40:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-12 08:40:41] [INFO ] [Real]Absence check using 65 positive place invariants in 55 ms returned sat
[2023-03-12 08:40:41] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 279 ms returned sat
[2023-03-12 08:40:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:40:44] [INFO ] [Real]Absence check using state equation in 2351 ms returned sat
[2023-03-12 08:40:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:40:45] [INFO ] [Nat]Absence check using 65 positive place invariants in 92 ms returned sat
[2023-03-12 08:40:45] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 124 ms returned sat
[2023-03-12 08:40:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:40:49] [INFO ] [Nat]Absence check using state equation in 3967 ms returned unknown
[2023-03-12 08:40:49] [INFO ] [Real]Absence check using 65 positive place invariants in 52 ms returned sat
[2023-03-12 08:40:50] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 110 ms returned sat
[2023-03-12 08:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:40:52] [INFO ] [Real]Absence check using state equation in 2571 ms returned sat
[2023-03-12 08:40:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:40:53] [INFO ] [Nat]Absence check using 65 positive place invariants in 81 ms returned sat
[2023-03-12 08:40:53] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 107 ms returned sat
[2023-03-12 08:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:40:57] [INFO ] [Nat]Absence check using state equation in 4192 ms returned unknown
[2023-03-12 08:40:58] [INFO ] [Real]Absence check using 65 positive place invariants in 53 ms returned sat
[2023-03-12 08:40:58] [INFO ] [Real]Absence check using 65 positive and 212 generalized place invariants in 126 ms returned sat
[2023-03-12 08:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:00] [INFO ] [Real]Absence check using state equation in 2100 ms returned sat
[2023-03-12 08:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:41:01] [INFO ] [Nat]Absence check using 65 positive place invariants in 58 ms returned sat
[2023-03-12 08:41:01] [INFO ] [Nat]Absence check using 65 positive and 212 generalized place invariants in 99 ms returned sat
[2023-03-12 08:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:05] [INFO ] [Nat]Absence check using state equation in 4390 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 2826 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Drop transitions removed 655 transitions
Trivial Post-agglo rules discarded 655 transitions
Performed 655 trivial Post agglomeration. Transition count delta: 655
Iterating post reduction 0 with 655 rules applied. Total rules applied 655 place count 2826 transition count 2858
Reduce places removed 655 places and 0 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 685 rules applied. Total rules applied 1340 place count 2171 transition count 2828
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 1349 place count 2163 transition count 2827
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1350 place count 2162 transition count 2827
Performed 655 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 655 Pre rules applied. Total rules applied 1350 place count 2162 transition count 2172
Deduced a syphon composed of 655 places in 5 ms
Ensure Unique test removed 63 places
Reduce places removed 718 places and 0 transitions.
Iterating global reduction 4 with 1373 rules applied. Total rules applied 2723 place count 1444 transition count 2172
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2769 place count 1438 transition count 2132
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2809 place count 1398 transition count 2132
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2809 place count 1398 transition count 2108
Deduced a syphon composed of 24 places in 16 ms
Ensure Unique test removed 24 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 2881 place count 1350 transition count 2108
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2881 place count 1350 transition count 2084
Deduced a syphon composed of 24 places in 10 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2929 place count 1326 transition count 2084
Discarding 90 places :
Symmetric choice reduction at 6 with 90 rule applications. Total rules 3019 place count 1236 transition count 1994
Iterating global reduction 6 with 90 rules applied. Total rules applied 3109 place count 1236 transition count 1994
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3110 place count 1236 transition count 1993
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 3110 place count 1236 transition count 1963
Deduced a syphon composed of 30 places in 11 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 61 rules applied. Total rules applied 3171 place count 1205 transition count 1963
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 3171 place count 1205 transition count 1962
Deduced a syphon composed of 1 places in 10 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 3174 place count 1203 transition count 1962
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 3181 place count 1196 transition count 1917
Iterating global reduction 7 with 7 rules applied. Total rules applied 3188 place count 1196 transition count 1917
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 3188 place count 1196 transition count 1911
Deduced a syphon composed of 6 places in 10 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 3200 place count 1190 transition count 1911
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3201 place count 1189 transition count 1903
Iterating global reduction 7 with 1 rules applied. Total rules applied 3202 place count 1189 transition count 1903
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3203 place count 1188 transition count 1895
Iterating global reduction 7 with 1 rules applied. Total rules applied 3204 place count 1188 transition count 1895
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3205 place count 1187 transition count 1887
Iterating global reduction 7 with 1 rules applied. Total rules applied 3206 place count 1187 transition count 1887
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3207 place count 1186 transition count 1879
Iterating global reduction 7 with 1 rules applied. Total rules applied 3208 place count 1186 transition count 1879
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3209 place count 1185 transition count 1871
Iterating global reduction 7 with 1 rules applied. Total rules applied 3210 place count 1185 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3211 place count 1184 transition count 1863
Iterating global reduction 7 with 1 rules applied. Total rules applied 3212 place count 1184 transition count 1863
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3213 place count 1183 transition count 1855
Iterating global reduction 7 with 1 rules applied. Total rules applied 3214 place count 1183 transition count 1855
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3215 place count 1182 transition count 1847
Iterating global reduction 7 with 1 rules applied. Total rules applied 3216 place count 1182 transition count 1847
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3217 place count 1181 transition count 1839
Iterating global reduction 7 with 1 rules applied. Total rules applied 3218 place count 1181 transition count 1839
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3219 place count 1180 transition count 1831
Iterating global reduction 7 with 1 rules applied. Total rules applied 3220 place count 1180 transition count 1831
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3221 place count 1179 transition count 1823
Iterating global reduction 7 with 1 rules applied. Total rules applied 3222 place count 1179 transition count 1823
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3223 place count 1178 transition count 1815
Iterating global reduction 7 with 1 rules applied. Total rules applied 3224 place count 1178 transition count 1815
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3225 place count 1177 transition count 1807
Iterating global reduction 7 with 1 rules applied. Total rules applied 3226 place count 1177 transition count 1807
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3227 place count 1176 transition count 1799
Iterating global reduction 7 with 1 rules applied. Total rules applied 3228 place count 1176 transition count 1799
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3229 place count 1175 transition count 1791
Iterating global reduction 7 with 1 rules applied. Total rules applied 3230 place count 1175 transition count 1791
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3231 place count 1174 transition count 1783
Iterating global reduction 7 with 1 rules applied. Total rules applied 3232 place count 1174 transition count 1783
Performed 162 Post agglomeration using F-continuation condition.Transition count delta: 162
Deduced a syphon composed of 162 places in 5 ms
Reduce places removed 162 places and 0 transitions.
Iterating global reduction 7 with 324 rules applied. Total rules applied 3556 place count 1012 transition count 1621
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3557 place count 1011 transition count 1620
Ensure Unique test removed 1 places
Iterating global reduction 7 with 2 rules applied. Total rules applied 3559 place count 1010 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 3560 place count 1009 transition count 1619
Iterating global reduction 7 with 1 rules applied. Total rules applied 3561 place count 1009 transition count 1619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 3563 place count 1009 transition count 1617
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 3564 place count 1008 transition count 1617
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
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 3566 place count 1007 transition count 1626
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 3573 place count 1007 transition count 1619
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 3580 place count 1000 transition count 1619
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 3585 place count 1000 transition count 1614
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 3590 place count 995 transition count 1614
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 3591 place count 994 transition count 1613
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 18 rules applied. Total rules applied 3609 place count 982 transition count 1607
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3615 place count 976 transition count 1607
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 18 Pre rules applied. Total rules applied 3615 place count 976 transition count 1589
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 37 rules applied. Total rules applied 3652 place count 957 transition count 1589
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 13 with 7 rules applied. Total rules applied 3659 place count 950 transition count 1589
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3659 place count 950 transition count 1588
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3661 place count 949 transition count 1588
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 3687 place count 936 transition count 1575
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 3693 place count 930 transition count 1569
Iterating global reduction 14 with 6 rules applied. Total rules applied 3699 place count 930 transition count 1569
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3705 place count 930 transition count 1563
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3711 place count 924 transition count 1563
Applied a total of 3711 rules in 2279 ms. Remains 924 /2826 variables (removed 1902) and now considering 1563/3513 (removed 1950) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2279 ms. Remains : 924/2826 places, 1563/3513 transitions.
// Phase 1: matrix 1563 rows 924 cols
[2023-03-12 08:41:08] [INFO ] Computed 161 place invariants in 64 ms
Incomplete random walk after 1000000 steps, including 11445 resets, run finished after 3566 ms. (steps per millisecond=280 ) properties (out of 4) seen :3
FORMULA ASLink-PT-06b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000000 steps, including 1862 resets, run finished after 1592 ms. (steps per millisecond=628 ) properties (out of 1) seen :0
[2023-03-12 08:41:13] [INFO ] Invariant cache hit.
[2023-03-12 08:41:13] [INFO ] [Real]Absence check using 43 positive place invariants in 27 ms returned sat
[2023-03-12 08:41:13] [INFO ] [Real]Absence check using 43 positive and 118 generalized place invariants in 38 ms returned sat
[2023-03-12 08:41:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:14] [INFO ] [Real]Absence check using state equation in 695 ms returned sat
[2023-03-12 08:41:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:41:14] [INFO ] [Nat]Absence check using 43 positive place invariants in 15 ms returned sat
[2023-03-12 08:41:14] [INFO ] [Nat]Absence check using 43 positive and 118 generalized place invariants in 63 ms returned sat
[2023-03-12 08:41:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:15] [INFO ] [Nat]Absence check using state equation in 878 ms returned sat
[2023-03-12 08:41:15] [INFO ] Computed and/alt/rep : 619/2419/619 causal constraints (skipped 911 transitions) in 135 ms.
[2023-03-12 08:41:18] [INFO ] Added : 129 causal constraints over 26 iterations in 3223 ms. Result :sat
Minimization took 645 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 924 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 924/924 places, 1563/1563 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 924 transition count 1562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 923 transition count 1562
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 923 transition count 1560
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 921 transition count 1560
Applied a total of 6 rules in 40 ms. Remains 921 /924 variables (removed 3) and now considering 1560/1563 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 921/924 places, 1560/1563 transitions.
// Phase 1: matrix 1560 rows 921 cols
[2023-03-12 08:41:20] [INFO ] Computed 161 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 11370 resets, run finished after 3059 ms. (steps per millisecond=326 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1867 resets, run finished after 1424 ms. (steps per millisecond=702 ) properties (out of 1) seen :0
[2023-03-12 08:41:24] [INFO ] Invariant cache hit.
[2023-03-12 08:41:25] [INFO ] [Real]Absence check using 43 positive place invariants in 33 ms returned sat
[2023-03-12 08:41:25] [INFO ] [Real]Absence check using 43 positive and 118 generalized place invariants in 78 ms returned sat
[2023-03-12 08:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:25] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2023-03-12 08:41:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:41:26] [INFO ] [Nat]Absence check using 43 positive place invariants in 17 ms returned sat
[2023-03-12 08:41:26] [INFO ] [Nat]Absence check using 43 positive and 118 generalized place invariants in 83 ms returned sat
[2023-03-12 08:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:26] [INFO ] [Nat]Absence check using state equation in 704 ms returned sat
[2023-03-12 08:41:27] [INFO ] Computed and/alt/rep : 608/2337/608 causal constraints (skipped 919 transitions) in 173 ms.
[2023-03-12 08:41:31] [INFO ] Added : 173 causal constraints over 35 iterations in 4148 ms. Result :sat
Minimization took 348 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 921 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 1560/1560 transitions.
Applied a total of 0 rules in 51 ms. Remains 921 /921 variables (removed 0) and now considering 1560/1560 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 921/921 places, 1560/1560 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 921/921 places, 1560/1560 transitions.
Applied a total of 0 rules in 32 ms. Remains 921 /921 variables (removed 0) and now considering 1560/1560 (removed 0) transitions.
[2023-03-12 08:41:32] [INFO ] Invariant cache hit.
[2023-03-12 08:41:33] [INFO ] Implicit Places using invariants in 1132 ms returned [1, 18, 19, 31, 48, 66, 135, 139, 148, 149, 151, 168, 186, 255, 259, 260, 271, 272, 274, 291, 309, 378, 382, 383, 394, 395, 397, 414, 432, 501, 505, 506, 517, 518, 520, 537, 555, 624, 628, 629, 640, 641, 643, 660, 678, 747, 751, 752, 755, 766, 767, 768, 786, 788, 792, 810, 811, 812, 813, 825, 831, 837, 843, 849, 855, 861, 867, 873, 879, 885]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 1142 ms to find 70 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 851/921 places, 1560/1560 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 851 transition count 1434
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 132 rules applied. Total rules applied 258 place count 725 transition count 1428
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 258 place count 725 transition count 1397
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 321 place count 693 transition count 1397
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 333 place count 689 transition count 1389
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 341 place count 681 transition count 1389
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 356 place count 666 transition count 1374
Iterating global reduction 4 with 15 rules applied. Total rules applied 371 place count 666 transition count 1374
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 374 place count 666 transition count 1371
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 374 place count 666 transition count 1370
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 376 place count 665 transition count 1370
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 379 place count 662 transition count 1364
Iterating global reduction 5 with 3 rules applied. Total rules applied 382 place count 662 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 383 place count 661 transition count 1363
Iterating global reduction 5 with 1 rules applied. Total rules applied 384 place count 661 transition count 1363
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 385 place count 660 transition count 1361
Iterating global reduction 5 with 1 rules applied. Total rules applied 386 place count 660 transition count 1361
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 476 place count 615 transition count 1316
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 482 place count 609 transition count 1310
Iterating global reduction 5 with 6 rules applied. Total rules applied 488 place count 609 transition count 1310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 493 place count 609 transition count 1305
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 494 place count 608 transition count 1304
Iterating global reduction 6 with 1 rules applied. Total rules applied 495 place count 608 transition count 1304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 496 place count 608 transition count 1303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 500 place count 606 transition count 1304
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 513 place count 606 transition count 1291
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 7 with 14 rules applied. Total rules applied 527 place count 592 transition count 1291
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 545 place count 592 transition count 1291
Applied a total of 545 rules in 270 ms. Remains 592 /851 variables (removed 259) and now considering 1291/1560 (removed 269) transitions.
// Phase 1: matrix 1291 rows 592 cols
[2023-03-12 08:41:33] [INFO ] Computed 85 place invariants in 10 ms
[2023-03-12 08:41:34] [INFO ] Implicit Places using invariants in 605 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, 517, 523, 526, 528]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 608 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 552/921 places, 1291/1560 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 534 transition count 1273
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 534 transition count 1273
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 528 transition count 1267
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 528 transition count 1267
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 72 place count 516 transition count 1255
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 516 transition count 1237
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 108 place count 498 transition count 1237
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 113 place count 498 transition count 1232
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 118 place count 493 transition count 1232
Applied a total of 118 rules in 93 ms. Remains 493 /552 variables (removed 59) and now considering 1232/1291 (removed 59) transitions.
// Phase 1: matrix 1232 rows 493 cols
[2023-03-12 08:41:34] [INFO ] Computed 45 place invariants in 24 ms
[2023-03-12 08:41:34] [INFO ] Implicit Places using invariants in 515 ms returned []
[2023-03-12 08:41:34] [INFO ] Invariant cache hit.
[2023-03-12 08:41:35] [INFO ] Implicit Places using invariants and state equation in 1323 ms returned []
Implicit Place search using SMT with State Equation took 1879 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 493/921 places, 1232/1560 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4037 ms. Remains : 493/921 places, 1232/1560 transitions.
Successfully produced net in file /tmp/petri1000_45281676522465104.dot
Successfully produced net in file /tmp/petri1001_3707818619439886448.dot
Successfully produced net in file /tmp/petri1002_6191829056822680794.dot
Successfully produced net in file /tmp/petri1003_643694274653938989.dot
Successfully produced net in file /tmp/petri1004_882078021085894205.dot
Successfully produced net in file /tmp/petri1005_12650139491105711062.dot
Drop transitions removed 6 transitions
Dominated transitions for bounds rules discarded 6 transitions
// Phase 1: matrix 1226 rows 493 cols
[2023-03-12 08:41:36] [INFO ] Computed 45 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 17805 resets, run finished after 2408 ms. (steps per millisecond=415 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3792 resets, run finished after 947 ms. (steps per millisecond=1055 ) properties (out of 1) seen :0
[2023-03-12 08:41:39] [INFO ] Invariant cache hit.
[2023-03-12 08:41:39] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-12 08:41:39] [INFO ] [Real]Absence check using 13 positive and 32 generalized place invariants in 12 ms returned sat
[2023-03-12 08:41:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:40] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-12 08:41:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:41:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 08:41:40] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 21 ms returned sat
[2023-03-12 08:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:40] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2023-03-12 08:41:40] [INFO ] Computed and/alt/rep : 275/1281/275 causal constraints (skipped 918 transitions) in 87 ms.
[2023-03-12 08:41:41] [INFO ] Added : 13 causal constraints over 4 iterations in 592 ms. Result :sat
Minimization took 434 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 493 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 493/493 places, 1226/1226 transitions.
Graph (complete) has 3030 edges and 493 vertex of which 487 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 487 transition count 1226
Applied a total of 7 rules in 36 ms. Remains 487 /493 variables (removed 6) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 487/493 places, 1226/1226 transitions.
// Phase 1: matrix 1226 rows 487 cols
[2023-03-12 08:41:42] [INFO ] Computed 45 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 17927 resets, run finished after 2295 ms. (steps per millisecond=435 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3797 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :0
[2023-03-12 08:41:45] [INFO ] Invariant cache hit.
[2023-03-12 08:41:45] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 08:41:45] [INFO ] [Real]Absence check using 13 positive and 32 generalized place invariants in 8 ms returned sat
[2023-03-12 08:41:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:45] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-12 08:41:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:41:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-12 08:41:45] [INFO ] [Nat]Absence check using 13 positive and 32 generalized place invariants in 41 ms returned sat
[2023-03-12 08:41:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:41:46] [INFO ] [Nat]Absence check using state equation in 563 ms returned sat
[2023-03-12 08:41:46] [INFO ] Computed and/alt/rep : 275/1279/275 causal constraints (skipped 918 transitions) in 106 ms.
[2023-03-12 08:41:47] [INFO ] Added : 36 causal constraints over 9 iterations in 1050 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
FORMULA ASLink-PT-06b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 79218 ms.
ITS solved all properties within timeout

BK_STOP 1678610508233

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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