Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 8.3K Feb 26 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15: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 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:03 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 357K 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-03a-UpperBounds-00
FORMULA_NAME ASLink-PT-03a-UpperBounds-01
FORMULA_NAME ASLink-PT-03a-UpperBounds-02
FORMULA_NAME ASLink-PT-03a-UpperBounds-03
FORMULA_NAME ASLink-PT-03a-UpperBounds-04
FORMULA_NAME ASLink-PT-03a-UpperBounds-05
FORMULA_NAME ASLink-PT-03a-UpperBounds-06
FORMULA_NAME ASLink-PT-03a-UpperBounds-07
FORMULA_NAME ASLink-PT-03a-UpperBounds-08
FORMULA_NAME ASLink-PT-03a-UpperBounds-09
FORMULA_NAME ASLink-PT-03a-UpperBounds-10
FORMULA_NAME ASLink-PT-03a-UpperBounds-11
FORMULA_NAME ASLink-PT-03a-UpperBounds-12
FORMULA_NAME ASLink-PT-03a-UpperBounds-13
FORMULA_NAME ASLink-PT-03a-UpperBounds-14
FORMULA_NAME ASLink-PT-03a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678486184793

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03a
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202303021504
[2023-03-10 22:09:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 22:09:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:09:48] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-10 22:09:48] [INFO ] Transformed 821 places.
[2023-03-10 22:09:48] [INFO ] Transformed 1281 transitions.
[2023-03-10 22:09:48] [INFO ] Found NUPN structural information;
[2023-03-10 22:09:48] [INFO ] Parsed PT model containing 821 places and 1281 transitions and 4839 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Ensure Unique test removed 13 transitions
Reduce redundant transitions removed 13 transitions.
// Phase 1: matrix 1268 rows 821 cols
[2023-03-10 22:09:48] [INFO ] Computed 156 place invariants in 49 ms
Incomplete random walk after 10000 steps, including 92 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 16) seen :8
FORMULA ASLink-PT-03a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :1
FORMULA ASLink-PT-03a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 7) seen :0
[2023-03-10 22:09:48] [INFO ] Invariant cache hit.
[2023-03-10 22:09:49] [INFO ] [Real]Absence check using 36 positive place invariants in 180 ms returned sat
[2023-03-10 22:09:49] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 290 ms returned sat
[2023-03-10 22:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:09:50] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2023-03-10 22:09:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:09:51] [INFO ] [Nat]Absence check using 36 positive place invariants in 89 ms returned sat
[2023-03-10 22:09:51] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 69 ms returned sat
[2023-03-10 22:09:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:09:52] [INFO ] [Nat]Absence check using state equation in 1169 ms returned sat
[2023-03-10 22:09:52] [INFO ] Deduced a trap composed of 88 places in 333 ms of which 5 ms to minimize.
[2023-03-10 22:09:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 640 ms
[2023-03-10 22:09:53] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 122 ms.
[2023-03-10 22:09:56] [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.refineWithCausalOrder(DeadlockTester.java:1186)
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-10 22:09:56] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-10 22:09:56] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 105 ms returned sat
[2023-03-10 22:09:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:09:56] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2023-03-10 22:09:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:09:57] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2023-03-10 22:09:57] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 26 ms returned sat
[2023-03-10 22:09:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:01] [INFO ] [Nat]Absence check using state equation in 4757 ms returned unknown
[2023-03-10 22:10:02] [INFO ] [Real]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-10 22:10:02] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 79 ms returned sat
[2023-03-10 22:10:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:02] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-10 22:10:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 19 ms returned sat
[2023-03-10 22:10:03] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 36 ms returned sat
[2023-03-10 22:10:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:07] [INFO ] [Nat]Absence check using state equation in 4710 ms returned sat
[2023-03-10 22:10:08] [INFO ] Deduced a trap composed of 41 places in 317 ms of which 1 ms to minimize.
[2023-03-10 22:10:08] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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-10 22:10:08] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-10 22:10:08] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 31 ms returned sat
[2023-03-10 22:10:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:08] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2023-03-10 22:10:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 17 ms returned sat
[2023-03-10 22:10:09] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 75 ms returned sat
[2023-03-10 22:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:13] [INFO ] [Nat]Absence check using state equation in 4711 ms returned unknown
[2023-03-10 22:10:14] [INFO ] [Real]Absence check using 36 positive place invariants in 16 ms returned sat
[2023-03-10 22:10:14] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 32 ms returned sat
[2023-03-10 22:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:14] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2023-03-10 22:10:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:14] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-10 22:10:14] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 31 ms returned sat
[2023-03-10 22:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:19] [INFO ] [Nat]Absence check using state equation in 4764 ms returned unknown
[2023-03-10 22:10:19] [INFO ] [Real]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-10 22:10:20] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 32 ms returned sat
[2023-03-10 22:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:20] [INFO ] [Real]Absence check using state equation in 584 ms returned sat
[2023-03-10 22:10:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 15 ms returned sat
[2023-03-10 22:10:20] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 26 ms returned sat
[2023-03-10 22:10:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:22] [INFO ] [Nat]Absence check using state equation in 1192 ms returned sat
[2023-03-10 22:10:22] [INFO ] Deduced a trap composed of 24 places in 344 ms of which 2 ms to minimize.
[2023-03-10 22:10:25] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 2 ms to minimize.
[2023-03-10 22:10:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2944 ms
[2023-03-10 22:10:25] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 149 ms.
[2023-03-10 22:10:25] [INFO ] Added : 5 causal constraints over 1 iterations in 638 ms. Result :unknown
[2023-03-10 22:10:26] [INFO ] [Real]Absence check using 36 positive place invariants in 19 ms returned sat
[2023-03-10 22:10:26] [INFO ] [Real]Absence check using 36 positive and 120 generalized place invariants in 39 ms returned sat
[2023-03-10 22:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:26] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2023-03-10 22:10:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 14 ms returned sat
[2023-03-10 22:10:27] [INFO ] [Nat]Absence check using 36 positive and 120 generalized place invariants in 54 ms returned sat
[2023-03-10 22:10:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:28] [INFO ] [Nat]Absence check using state equation in 1632 ms returned sat
[2023-03-10 22:10:28] [INFO ] Computed and/alt/rep : 486/1798/486 causal constraints (skipped 781 transitions) in 104 ms.
[2023-03-10 22:10:32] [INFO ] Deduced a trap composed of 5 places in 410 ms of which 1 ms to minimize.
[2023-03-10 22:10:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-03a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 6 out of 821 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 821/821 places, 1268/1268 transitions.
Ensure Unique test removed 12 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 87 rules applied. Total rules applied 87 place count 803 transition count 1199
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 157 place count 734 transition count 1198
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 158 place count 733 transition count 1198
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 158 place count 733 transition count 1129
Deduced a syphon composed of 69 places in 3 ms
Ensure Unique test removed 27 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 165 rules applied. Total rules applied 323 place count 637 transition count 1129
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 637 transition count 1128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 636 transition count 1128
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 331 place count 630 transition count 1099
Ensure Unique test removed 1 places
Iterating global reduction 5 with 7 rules applied. Total rules applied 338 place count 629 transition count 1099
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 5 with 6 rules applied. Total rules applied 344 place count 628 transition count 1094
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 347 place count 625 transition count 1094
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 348 place count 624 transition count 1086
Iterating global reduction 7 with 1 rules applied. Total rules applied 349 place count 624 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 350 place count 623 transition count 1078
Iterating global reduction 7 with 1 rules applied. Total rules applied 351 place count 623 transition count 1078
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 352 place count 622 transition count 1070
Iterating global reduction 7 with 1 rules applied. Total rules applied 353 place count 622 transition count 1070
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 354 place count 621 transition count 1062
Iterating global reduction 7 with 1 rules applied. Total rules applied 355 place count 621 transition count 1062
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 356 place count 620 transition count 1054
Iterating global reduction 7 with 1 rules applied. Total rules applied 357 place count 620 transition count 1054
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 358 place count 619 transition count 1046
Iterating global reduction 7 with 1 rules applied. Total rules applied 359 place count 619 transition count 1046
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 360 place count 618 transition count 1038
Iterating global reduction 7 with 1 rules applied. Total rules applied 361 place count 618 transition count 1038
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 362 place count 617 transition count 1030
Iterating global reduction 7 with 1 rules applied. Total rules applied 363 place count 617 transition count 1030
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 364 place count 616 transition count 1022
Iterating global reduction 7 with 1 rules applied. Total rules applied 365 place count 616 transition count 1022
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 366 place count 615 transition count 1014
Iterating global reduction 7 with 1 rules applied. Total rules applied 367 place count 615 transition count 1014
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 368 place count 614 transition count 1006
Iterating global reduction 7 with 1 rules applied. Total rules applied 369 place count 614 transition count 1006
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 370 place count 613 transition count 998
Iterating global reduction 7 with 1 rules applied. Total rules applied 371 place count 613 transition count 998
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 372 place count 612 transition count 990
Iterating global reduction 7 with 1 rules applied. Total rules applied 373 place count 612 transition count 990
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 374 place count 611 transition count 982
Iterating global reduction 7 with 1 rules applied. Total rules applied 375 place count 611 transition count 982
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 376 place count 610 transition count 974
Iterating global reduction 7 with 1 rules applied. Total rules applied 377 place count 610 transition count 974
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 378 place count 609 transition count 966
Iterating global reduction 7 with 1 rules applied. Total rules applied 379 place count 609 transition count 966
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 421 place count 588 transition count 945
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 423 place count 588 transition count 943
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 425 place count 586 transition count 943
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 429 place count 586 transition count 943
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 585 transition count 942
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 436 place count 579 transition count 942
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 11 Pre rules applied. Total rules applied 436 place count 579 transition count 931
Deduced a syphon composed of 11 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 9 with 23 rules applied. Total rules applied 459 place count 567 transition count 931
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 9 with 4 rules applied. Total rules applied 463 place count 563 transition count 931
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 463 place count 563 transition count 930
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 465 place count 562 transition count 930
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 473 place count 558 transition count 926
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 476 place count 555 transition count 923
Iterating global reduction 10 with 3 rules applied. Total rules applied 479 place count 555 transition count 923
Free-agglomeration rule applied 3 times.
Iterating global reduction 10 with 3 rules applied. Total rules applied 482 place count 555 transition count 920
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 485 place count 552 transition count 920
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 488 place count 552 transition count 920
Applied a total of 488 rules in 739 ms. Remains 552 /821 variables (removed 269) and now considering 920/1268 (removed 348) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 739 ms. Remains : 552/821 places, 920/1268 transitions.
// Phase 1: matrix 920 rows 552 cols
[2023-03-10 22:10:33] [INFO ] Computed 98 place invariants in 46 ms
Incomplete random walk after 1000000 steps, including 14077 resets, run finished after 2255 ms. (steps per millisecond=443 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3945 resets, run finished after 1046 ms. (steps per millisecond=956 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3932 resets, run finished after 1098 ms. (steps per millisecond=910 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3878 resets, run finished after 1103 ms. (steps per millisecond=906 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3848 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3862 resets, run finished after 1058 ms. (steps per millisecond=945 ) properties (out of 6) seen :2
FORMULA ASLink-PT-03a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ASLink-PT-03a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-10 22:10:41] [INFO ] Invariant cache hit.
[2023-03-10 22:10:41] [INFO ] [Real]Absence check using 26 positive place invariants in 68 ms returned sat
[2023-03-10 22:10:41] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 18 ms returned sat
[2023-03-10 22:10:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:41] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-10 22:10:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:42] [INFO ] [Nat]Absence check using 26 positive place invariants in 72 ms returned sat
[2023-03-10 22:10:42] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 58 ms returned sat
[2023-03-10 22:10:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:42] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2023-03-10 22:10:42] [INFO ] Deduced a trap composed of 105 places in 396 ms of which 1 ms to minimize.
[2023-03-10 22:10:43] [INFO ] Deduced a trap composed of 110 places in 290 ms of which 0 ms to minimize.
[2023-03-10 22:10:43] [INFO ] Deduced a trap composed of 105 places in 253 ms of which 1 ms to minimize.
[2023-03-10 22:10:43] [INFO ] Deduced a trap composed of 106 places in 202 ms of which 1 ms to minimize.
[2023-03-10 22:10:43] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 1 ms to minimize.
[2023-03-10 22:10:44] [INFO ] Deduced a trap composed of 98 places in 157 ms of which 0 ms to minimize.
[2023-03-10 22:10:44] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1738 ms
[2023-03-10 22:10:44] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 84 ms.
[2023-03-10 22:10:47] [INFO ] Added : 205 causal constraints over 41 iterations in 3660 ms. Result :sat
Minimization took 295 ms.
[2023-03-10 22:10:48] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-10 22:10:48] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 25 ms returned sat
[2023-03-10 22:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:48] [INFO ] [Real]Absence check using state equation in 273 ms returned sat
[2023-03-10 22:10:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:48] [INFO ] [Nat]Absence check using 26 positive place invariants in 10 ms returned sat
[2023-03-10 22:10:48] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 22 ms returned sat
[2023-03-10 22:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:49] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-10 22:10:49] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 65 ms.
[2023-03-10 22:10:51] [INFO ] Added : 124 causal constraints over 25 iterations in 2250 ms. Result :sat
Minimization took 198 ms.
[2023-03-10 22:10:51] [INFO ] [Real]Absence check using 26 positive place invariants in 13 ms returned sat
[2023-03-10 22:10:51] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 22 ms returned sat
[2023-03-10 22:10:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:52] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-03-10 22:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:10:52] [INFO ] [Nat]Absence check using 26 positive place invariants in 72 ms returned sat
[2023-03-10 22:10:52] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 46 ms returned sat
[2023-03-10 22:10:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:10:52] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2023-03-10 22:10:53] [INFO ] Deduced a trap composed of 97 places in 283 ms of which 1 ms to minimize.
[2023-03-10 22:10:53] [INFO ] Deduced a trap composed of 107 places in 264 ms of which 0 ms to minimize.
[2023-03-10 22:10:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 699 ms
[2023-03-10 22:10:53] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 89 ms.
[2023-03-10 22:11:00] [INFO ] Deduced a trap composed of 95 places in 293 ms of which 1 ms to minimize.
[2023-03-10 22:11:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 427 ms
[2023-03-10 22:11:00] [INFO ] Added : 251 causal constraints over 51 iterations in 6640 ms. Result :sat
Minimization took 314 ms.
[2023-03-10 22:11:00] [INFO ] [Real]Absence check using 26 positive place invariants in 34 ms returned sat
[2023-03-10 22:11:00] [INFO ] [Real]Absence check using 26 positive and 72 generalized place invariants in 39 ms returned sat
[2023-03-10 22:11:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:01] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2023-03-10 22:11:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:01] [INFO ] [Nat]Absence check using 26 positive place invariants in 36 ms returned sat
[2023-03-10 22:11:01] [INFO ] [Nat]Absence check using 26 positive and 72 generalized place invariants in 20 ms returned sat
[2023-03-10 22:11:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:02] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2023-03-10 22:11:02] [INFO ] Computed and/alt/rep : 352/1376/352 causal constraints (skipped 547 transitions) in 80 ms.
[2023-03-10 22:11:04] [INFO ] Added : 124 causal constraints over 25 iterations in 2297 ms. Result :sat
Minimization took 198 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 920/920 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 552 transition count 919
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 551 transition count 919
Applied a total of 2 rules in 28 ms. Remains 551 /552 variables (removed 1) and now considering 919/920 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 551/552 places, 919/920 transitions.
// Phase 1: matrix 919 rows 551 cols
[2023-03-10 22:11:05] [INFO ] Computed 98 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 13941 resets, run finished after 2192 ms. (steps per millisecond=456 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3827 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3874 resets, run finished after 1011 ms. (steps per millisecond=989 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3916 resets, run finished after 1015 ms. (steps per millisecond=985 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3876 resets, run finished after 1084 ms. (steps per millisecond=922 ) properties (out of 4) seen :0
[2023-03-10 22:11:12] [INFO ] Invariant cache hit.
[2023-03-10 22:11:12] [INFO ] [Real]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-10 22:11:12] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 15 ms returned sat
[2023-03-10 22:11:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:12] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2023-03-10 22:11:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 10 ms returned sat
[2023-03-10 22:11:12] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 44 ms returned sat
[2023-03-10 22:11:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:13] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2023-03-10 22:11:13] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 122 ms.
[2023-03-10 22:11:16] [INFO ] Added : 209 causal constraints over 42 iterations in 3478 ms. Result :sat
Minimization took 195 ms.
[2023-03-10 22:11:16] [INFO ] [Real]Absence check using 23 positive place invariants in 10 ms returned sat
[2023-03-10 22:11:17] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 37 ms returned sat
[2023-03-10 22:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:17] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2023-03-10 22:11:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-10 22:11:17] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 18 ms returned sat
[2023-03-10 22:11:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:17] [INFO ] [Nat]Absence check using state equation in 379 ms returned sat
[2023-03-10 22:11:18] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 90 ms.
[2023-03-10 22:11:20] [INFO ] Added : 150 causal constraints over 30 iterations in 2671 ms. Result :sat
Minimization took 219 ms.
[2023-03-10 22:11:21] [INFO ] [Real]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-10 22:11:21] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 34 ms returned sat
[2023-03-10 22:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:21] [INFO ] [Real]Absence check using state equation in 465 ms returned sat
[2023-03-10 22:11:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 8 ms returned sat
[2023-03-10 22:11:21] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 56 ms returned sat
[2023-03-10 22:11:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:22] [INFO ] [Nat]Absence check using state equation in 430 ms returned sat
[2023-03-10 22:11:22] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 67 ms.
[2023-03-10 22:11:26] [INFO ] Deduced a trap composed of 136 places in 303 ms of which 1 ms to minimize.
[2023-03-10 22:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 408 ms
[2023-03-10 22:11:26] [INFO ] Added : 234 causal constraints over 47 iterations in 4392 ms. Result :sat
Minimization took 359 ms.
[2023-03-10 22:11:27] [INFO ] [Real]Absence check using 23 positive place invariants in 14 ms returned sat
[2023-03-10 22:11:27] [INFO ] [Real]Absence check using 23 positive and 75 generalized place invariants in 30 ms returned sat
[2023-03-10 22:11:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:27] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2023-03-10 22:11:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2023-03-10 22:11:27] [INFO ] [Nat]Absence check using 23 positive and 75 generalized place invariants in 83 ms returned sat
[2023-03-10 22:11:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:28] [INFO ] [Nat]Absence check using state equation in 378 ms returned sat
[2023-03-10 22:11:28] [INFO ] Computed and/alt/rep : 351/1375/351 causal constraints (skipped 547 transitions) in 64 ms.
[2023-03-10 22:11:33] [INFO ] Added : 271 causal constraints over 55 iterations in 4988 ms. Result :sat
Minimization took 229 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Support contains 4 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 24 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 551/551 places, 919/919 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 919/919 transitions.
Applied a total of 0 rules in 45 ms. Remains 551 /551 variables (removed 0) and now considering 919/919 (removed 0) transitions.
[2023-03-10 22:11:34] [INFO ] Invariant cache hit.
[2023-03-10 22:11:34] [INFO ] Implicit Places using invariants in 603 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, 386, 397, 398, 399, 417, 419, 422, 440, 441, 442, 443, 455, 461, 467, 473, 479, 485, 491, 497, 503, 509, 515]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 614 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 505/551 places, 919/919 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 75 place count 505 transition count 844
Reduce places removed 75 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 76 rules applied. Total rules applied 151 place count 430 transition count 843
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 152 place count 429 transition count 843
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 152 place count 429 transition count 824
Deduced a syphon composed of 19 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 39 rules applied. Total rules applied 191 place count 409 transition count 824
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 203 place count 405 transition count 816
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 211 place count 397 transition count 816
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 226 place count 382 transition count 801
Iterating global reduction 5 with 15 rules applied. Total rules applied 241 place count 382 transition count 801
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 244 place count 382 transition count 798
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 244 place count 382 transition count 797
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 246 place count 381 transition count 797
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 249 place count 378 transition count 794
Iterating global reduction 6 with 3 rules applied. Total rules applied 252 place count 378 transition count 794
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 253 place count 377 transition count 793
Iterating global reduction 6 with 1 rules applied. Total rules applied 254 place count 377 transition count 793
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 255 place count 376 transition count 792
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 376 transition count 792
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 320 place count 344 transition count 760
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 323 place count 344 transition count 757
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 326 place count 341 transition count 754
Iterating global reduction 7 with 3 rules applied. Total rules applied 329 place count 341 transition count 754
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 332 place count 341 transition count 751
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 338 place count 341 transition count 745
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 345 place count 334 transition count 745
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 9 with 10 rules applied. Total rules applied 355 place count 334 transition count 745
Applied a total of 355 rules in 205 ms. Remains 334 /505 variables (removed 171) and now considering 745/919 (removed 174) transitions.
// Phase 1: matrix 745 rows 334 cols
[2023-03-10 22:11:35] [INFO ] Computed 46 place invariants in 14 ms
[2023-03-10 22:11:35] [INFO ] Implicit Places using invariants in 290 ms returned [72, 90, 96, 99, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 243, 260, 266, 269, 271]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 292 ms to find 19 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 315/551 places, 745/919 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 306 transition count 736
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 306 transition count 736
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 303 transition count 733
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 303 transition count 733
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 36 place count 297 transition count 727
Free-agglomeration rule applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 45 place count 297 transition count 718
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 54 place count 288 transition count 718
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 288 transition count 715
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 285 transition count 715
Applied a total of 60 rules in 118 ms. Remains 285 /315 variables (removed 30) and now considering 715/745 (removed 30) transitions.
// Phase 1: matrix 715 rows 285 cols
[2023-03-10 22:11:35] [INFO ] Computed 27 place invariants in 11 ms
[2023-03-10 22:11:35] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-10 22:11:35] [INFO ] Invariant cache hit.
[2023-03-10 22:11:36] [INFO ] Implicit Places using invariants and state equation in 553 ms returned []
Implicit Place search using SMT with State Equation took 766 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 285/551 places, 715/919 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2042 ms. Remains : 285/551 places, 715/919 transitions.
Successfully produced net in file /tmp/petri1000_17176185533857432503.dot
Successfully produced net in file /tmp/petri1001_13080811871247799618.dot
Successfully produced net in file /tmp/petri1002_13426778197327081443.dot
Drop transitions removed 3 transitions
Dominated transitions for bounds rules discarded 3 transitions
// Phase 1: matrix 712 rows 285 cols
[2023-03-10 22:11:36] [INFO ] Computed 27 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 21117 resets, run finished after 1594 ms. (steps per millisecond=627 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7321 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7232 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7288 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7314 resets, run finished after 715 ms. (steps per millisecond=1398 ) properties (out of 4) seen :0
[2023-03-10 22:11:40] [INFO ] Invariant cache hit.
[2023-03-10 22:11:41] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 22:11:41] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-10 22:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:41] [INFO ] [Real]Absence check using state equation in 323 ms returned sat
[2023-03-10 22:11:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 22:11:41] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-10 22:11:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:41] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-10 22:11:41] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 62 ms.
[2023-03-10 22:11:42] [INFO ] Added : 43 causal constraints over 9 iterations in 676 ms. Result :sat
Minimization took 133 ms.
[2023-03-10 22:11:42] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 22:11:42] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 22:11:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:42] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-10 22:11:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:43] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 22:11:43] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 12 ms returned sat
[2023-03-10 22:11:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:43] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-03-10 22:11:43] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 82 ms.
[2023-03-10 22:11:43] [INFO ] Added : 16 causal constraints over 4 iterations in 447 ms. Result :sat
Minimization took 144 ms.
[2023-03-10 22:11:43] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-10 22:11:44] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 14 ms returned sat
[2023-03-10 22:11:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:44] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2023-03-10 22:11:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:44] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-10 22:11:44] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-10 22:11:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:44] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2023-03-10 22:11:44] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 58 ms.
[2023-03-10 22:11:45] [INFO ] Added : 38 causal constraints over 8 iterations in 1058 ms. Result :sat
Minimization took 134 ms.
[2023-03-10 22:11:45] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-10 22:11:45] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-10 22:11:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:46] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-10 22:11:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:46] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:11:46] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 22:11:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:46] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2023-03-10 22:11:46] [INFO ] Computed and/alt/rep : 134/677/134 causal constraints (skipped 560 transitions) in 90 ms.
[2023-03-10 22:11:47] [INFO ] Added : 13 causal constraints over 3 iterations in 349 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA ASLink-PT-03a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-03a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 712/712 transitions.
Graph (complete) has 1769 edges and 285 vertex of which 282 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 282 transition count 712
Applied a total of 4 rules in 17 ms. Remains 282 /285 variables (removed 3) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 282/285 places, 712/712 transitions.
// Phase 1: matrix 712 rows 282 cols
[2023-03-10 22:11:47] [INFO ] Computed 27 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 21196 resets, run finished after 1608 ms. (steps per millisecond=621 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7251 resets, run finished after 742 ms. (steps per millisecond=1347 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7284 resets, run finished after 747 ms. (steps per millisecond=1338 ) properties (out of 2) seen :0
[2023-03-10 22:11:50] [INFO ] Invariant cache hit.
[2023-03-10 22:11:50] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 22:11:50] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-10 22:11:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:50] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-10 22:11:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 22:11:51] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 9 ms returned sat
[2023-03-10 22:11:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:51] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-10 22:11:51] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 89 ms.
[2023-03-10 22:11:52] [INFO ] Deduced a trap composed of 24 places in 149 ms of which 1 ms to minimize.
[2023-03-10 22:11:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 234 ms
[2023-03-10 22:11:52] [INFO ] Added : 48 causal constraints over 10 iterations in 963 ms. Result :sat
Minimization took 100 ms.
[2023-03-10 22:11:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 22:11:52] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-10 22:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:52] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2023-03-10 22:11:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 22:11:52] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 20 ms returned sat
[2023-03-10 22:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:53] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-10 22:11:53] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 73 ms.
[2023-03-10 22:11:53] [INFO ] Added : 16 causal constraints over 4 iterations in 375 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 282/282 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2023-03-10 22:11:54] [INFO ] Invariant cache hit.
[2023-03-10 22:11:54] [INFO ] Implicit Places using invariants in 204 ms returned []
[2023-03-10 22:11:54] [INFO ] Invariant cache hit.
[2023-03-10 22:11:55] [INFO ] Implicit Places using invariants and state equation in 818 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2023-03-10 22:11:55] [INFO ] Redundant transitions in 40 ms returned []
[2023-03-10 22:11:55] [INFO ] Invariant cache hit.
[2023-03-10 22:11:55] [INFO ] Dead Transitions using invariants and state equation in 348 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1465 ms. Remains : 282/282 places, 712/712 transitions.
Starting property specific reduction for ASLink-PT-03a-UpperBounds-04
[2023-03-10 22:11:55] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 225 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 22:11:55] [INFO ] Invariant cache hit.
[2023-03-10 22:11:55] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:11:55] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 11 ms returned sat
[2023-03-10 22:11:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:55] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-10 22:11:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:11:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 14 ms returned sat
[2023-03-10 22:11:55] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 8 ms returned sat
[2023-03-10 22:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:11:56] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2023-03-10 22:11:56] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 50 ms.
[2023-03-10 22:11:57] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 1 ms to minimize.
[2023-03-10 22:11:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2023-03-10 22:11:57] [INFO ] Added : 48 causal constraints over 10 iterations in 1092 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 282/282 places, 712/712 transitions.
[2023-03-10 22:11:57] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 21211 resets, run finished after 1556 ms. (steps per millisecond=642 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 7256 resets, run finished after 652 ms. (steps per millisecond=1533 ) properties (out of 1) seen :0
[2023-03-10 22:11:59] [INFO ] Invariant cache hit.
[2023-03-10 22:11:59] [INFO ] [Real]Absence check using 10 positive place invariants in 7 ms returned sat
[2023-03-10 22:12:00] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 68 ms returned sat
[2023-03-10 22:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:12:00] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-10 22:12:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:12:00] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-10 22:12:00] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 6 ms returned sat
[2023-03-10 22:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:12:00] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-03-10 22:12:00] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 71 ms.
[2023-03-10 22:12:01] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 1 ms to minimize.
[2023-03-10 22:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2023-03-10 22:12:01] [INFO ] Added : 48 causal constraints over 10 iterations in 1235 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 8 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 282/282 places, 712/712 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Applied a total of 0 rules in 7 ms. Remains 282 /282 variables (removed 0) and now considering 712/712 (removed 0) transitions.
[2023-03-10 22:12:02] [INFO ] Invariant cache hit.
[2023-03-10 22:12:03] [INFO ] Implicit Places using invariants in 912 ms returned []
[2023-03-10 22:12:03] [INFO ] Invariant cache hit.
[2023-03-10 22:12:03] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 1521 ms to find 0 implicit places.
[2023-03-10 22:12:03] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-10 22:12:03] [INFO ] Invariant cache hit.
[2023-03-10 22:12:04] [INFO ] Dead Transitions using invariants and state equation in 295 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1848 ms. Remains : 282/282 places, 712/712 transitions.
Ending property specific reduction for ASLink-PT-03a-UpperBounds-04 in 8517 ms.
Starting property specific reduction for ASLink-PT-03a-UpperBounds-13
[2023-03-10 22:12:04] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
[2023-03-10 22:12:04] [INFO ] Invariant cache hit.
[2023-03-10 22:12:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2023-03-10 22:12:04] [INFO ] [Real]Absence check using 10 positive and 17 generalized place invariants in 10 ms returned sat
[2023-03-10 22:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:12:04] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-10 22:12:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:12:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-10 22:12:04] [INFO ] [Nat]Absence check using 10 positive and 17 generalized place invariants in 7 ms returned sat
[2023-03-10 22:12:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:12:04] [INFO ] [Nat]Absence check using state equation in 380 ms returned sat
[2023-03-10 22:12:04] [INFO ] Computed and/alt/rep : 134/675/134 causal constraints (skipped 560 transitions) in 70 ms.
[2023-03-10 22:12:05] [INFO ] Added : 16 causal constraints over 4 iterations in 382 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 712/712 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 282 transition count 711
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 281 transition count 711
Applied a total of 2 rules in 16 ms. Remains 281 /282 variables (removed 1) and now considering 711/712 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 281/282 places, 711/712 transitions.
// Phase 1: matrix 711 rows 281 cols
[2023-03-10 22:12:05] [INFO ] Computed 27 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 21223 resets, run finished after 1708 ms. (steps per millisecond=585 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 7265 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties (out of 1) seen :0
[2023-03-10 22:12:08] [INFO ] Invariant cache hit.
[2023-03-10 22:12:08] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-10 22:12:08] [INFO ] [Real]Absence check using 8 positive and 19 generalized place invariants in 13 ms returned sat
[2023-03-10 22:12:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:12:08] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-10 22:12:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:12:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-10 22:12:08] [INFO ] [Nat]Absence check using 8 positive and 19 generalized place invariants in 14 ms returned sat
[2023-03-10 22:12:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:12:08] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2023-03-10 22:12:08] [INFO ] Computed and/alt/rep : 133/674/133 causal constraints (skipped 560 transitions) in 99 ms.
[2023-03-10 22:12:09] [INFO ] Added : 10 causal constraints over 2 iterations in 330 ms. Result :sat
Minimization took 154 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Support contains 1 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 711/711 transitions.
Applied a total of 0 rules in 7 ms. Remains 281 /281 variables (removed 0) and now considering 711/711 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 281/281 places, 711/711 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 711/711 transitions.
Applied a total of 0 rules in 7 ms. Remains 281 /281 variables (removed 0) and now considering 711/711 (removed 0) transitions.
[2023-03-10 22:12:09] [INFO ] Invariant cache hit.
[2023-03-10 22:12:09] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-10 22:12:09] [INFO ] Invariant cache hit.
[2023-03-10 22:12:10] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-10 22:12:10] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-10 22:12:10] [INFO ] Invariant cache hit.
[2023-03-10 22:12:10] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1225 ms. Remains : 281/281 places, 711/711 transitions.
Ending property specific reduction for ASLink-PT-03a-UpperBounds-13 in 6592 ms.
[2023-03-10 22:12:11] [INFO ] Flatten gal took : 93 ms
[2023-03-10 22:12:11] [INFO ] Applying decomposition
[2023-03-10 22:12:11] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph15169229560124878960.txt' '-o' '/tmp/graph15169229560124878960.bin' '-w' '/tmp/graph15169229560124878960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15169229560124878960.bin' '-l' '-1' '-v' '-w' '/tmp/graph15169229560124878960.weights' '-q' '0' '-e' '0.001'
[2023-03-10 22:12:11] [INFO ] Decomposing Gal with order
[2023-03-10 22:12:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:12:11] [INFO ] Removed a total of 1526 redundant transitions.
[2023-03-10 22:12:11] [INFO ] Flatten gal took : 104 ms
[2023-03-10 22:12:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 77 labels/synchronizations in 15 ms.
[2023-03-10 22:12:11] [INFO ] Time to serialize gal into /tmp/UpperBounds1630969268482152532.gal : 12 ms
[2023-03-10 22:12:11] [INFO ] Time to serialize properties into /tmp/UpperBounds15308894024905060412.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds1630969268482152532.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15308894024905060412.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds15308894024905060412.prop.
Detected timeout of ITS tools.
[2023-03-10 22:32:58] [INFO ] Applying decomposition
[2023-03-10 22:32:58] [INFO ] Flatten gal took : 34 ms
[2023-03-10 22:32:58] [INFO ] Decomposing Gal with order
[2023-03-10 22:32:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 22:32:59] [INFO ] Removed a total of 1313 redundant transitions.
[2023-03-10 22:32:59] [INFO ] Flatten gal took : 72 ms
[2023-03-10 22:32:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 251 labels/synchronizations in 11 ms.
[2023-03-10 22:32:59] [INFO ] Time to serialize gal into /tmp/UpperBounds7642469557236372525.gal : 4 ms
[2023-03-10 22:32:59] [INFO ] Time to serialize properties into /tmp/UpperBounds13947279872033500215.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7642469557236372525.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13947279872033500215.prop' '--nowitness'

its-reach command run as :

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

its-reach command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ASLink-PT-03a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r005-oct2-167813592600045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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