About the Execution of ITS-Tools for ASLink-PT-08b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16247.823 | 3600000.00 | 2775026.00 | 352962.60 | 1 ? 1 1 1 1 1 1 1 1 1 1 ? 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989600133.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-08b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989600133
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 01:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 01:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 1.2M May 5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-08b-UpperBounds-00
FORMULA_NAME ASLink-PT-08b-UpperBounds-01
FORMULA_NAME ASLink-PT-08b-UpperBounds-02
FORMULA_NAME ASLink-PT-08b-UpperBounds-03
FORMULA_NAME ASLink-PT-08b-UpperBounds-04
FORMULA_NAME ASLink-PT-08b-UpperBounds-05
FORMULA_NAME ASLink-PT-08b-UpperBounds-06
FORMULA_NAME ASLink-PT-08b-UpperBounds-07
FORMULA_NAME ASLink-PT-08b-UpperBounds-08
FORMULA_NAME ASLink-PT-08b-UpperBounds-09
FORMULA_NAME ASLink-PT-08b-UpperBounds-10
FORMULA_NAME ASLink-PT-08b-UpperBounds-11
FORMULA_NAME ASLink-PT-08b-UpperBounds-12
FORMULA_NAME ASLink-PT-08b-UpperBounds-13
FORMULA_NAME ASLink-PT-08b-UpperBounds-14
FORMULA_NAME ASLink-PT-08b-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1620433010236
Running Version 0
[2021-05-08 00:16:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-08 00:16:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 00:16:51] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2021-05-08 00:16:51] [INFO ] Transformed 3618 places.
[2021-05-08 00:16:51] [INFO ] Transformed 4459 transitions.
[2021-05-08 00:16:51] [INFO ] Found NUPN structural information;
[2021-05-08 00:16:51] [INFO ] Parsed PT model containing 3618 places and 4459 transitions in 276 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 73 ms.
// Phase 1: matrix 4459 rows 3618 cols
[2021-05-08 00:16:52] [INFO ] Computed 355 place invariants in 338 ms
Incomplete random walk after 10000 steps, including 13 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 16) seen :6
FORMULA ASLink-PT-08b-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
// Phase 1: matrix 4459 rows 3618 cols
[2021-05-08 00:16:53] [INFO ] Computed 355 place invariants in 187 ms
[2021-05-08 00:16:54] [INFO ] [Real]Absence check using 83 positive place invariants in 121 ms returned sat
[2021-05-08 00:16:54] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 111 ms returned sat
[2021-05-08 00:16:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:16:56] [INFO ] [Real]Absence check using state equation in 2536 ms returned sat
[2021-05-08 00:17:04] [INFO ] Deduced a trap composed of 15 places in 6395 ms of which 7 ms to minimize.
[2021-05-08 00:17:04] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-08 00:17:05] [INFO ] [Real]Absence check using 83 positive place invariants in 79 ms returned sat
[2021-05-08 00:17:05] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 109 ms returned sat
[2021-05-08 00:17:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:07] [INFO ] [Real]Absence check using state equation in 2619 ms returned sat
[2021-05-08 00:17:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:17:08] [INFO ] [Nat]Absence check using 83 positive place invariants in 80 ms returned sat
[2021-05-08 00:17:08] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 101 ms returned sat
[2021-05-08 00:17:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:18] [INFO ] [Nat]Absence check using state equation in 9214 ms returned unknown
[2021-05-08 00:17:18] [INFO ] [Real]Absence check using 83 positive place invariants in 103 ms returned sat
[2021-05-08 00:17:18] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 102 ms returned sat
[2021-05-08 00:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:21] [INFO ] [Real]Absence check using state equation in 2497 ms returned sat
[2021-05-08 00:17:21] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:17:21] [INFO ] [Nat]Absence check using 83 positive place invariants in 77 ms returned sat
[2021-05-08 00:17:22] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 128 ms returned sat
[2021-05-08 00:17:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:26] [INFO ] [Nat]Absence check using state equation in 4322 ms returned unknown
[2021-05-08 00:17:27] [INFO ] [Real]Absence check using 83 positive place invariants in 74 ms returned sat
[2021-05-08 00:17:27] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 101 ms returned sat
[2021-05-08 00:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:29] [INFO ] [Real]Absence check using state equation in 2419 ms returned sat
[2021-05-08 00:17:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:17:30] [INFO ] [Nat]Absence check using 83 positive place invariants in 77 ms returned sat
[2021-05-08 00:17:30] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 97 ms returned sat
[2021-05-08 00:17:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:34] [INFO ] [Nat]Absence check using state equation in 4372 ms returned unknown
[2021-05-08 00:17:35] [INFO ] [Real]Absence check using 83 positive place invariants in 76 ms returned sat
[2021-05-08 00:17:35] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 103 ms returned sat
[2021-05-08 00:17:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:37] [INFO ] [Real]Absence check using state equation in 2366 ms returned sat
[2021-05-08 00:17:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:17:38] [INFO ] [Nat]Absence check using 83 positive place invariants in 78 ms returned sat
[2021-05-08 00:17:38] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 99 ms returned sat
[2021-05-08 00:17:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:42] [INFO ] [Nat]Absence check using state equation in 4357 ms returned unknown
[2021-05-08 00:17:43] [INFO ] [Real]Absence check using 83 positive place invariants in 76 ms returned sat
[2021-05-08 00:17:43] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 102 ms returned sat
[2021-05-08 00:17:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:45] [INFO ] [Real]Absence check using state equation in 2227 ms returned sat
[2021-05-08 00:17:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:17:46] [INFO ] [Nat]Absence check using 83 positive place invariants in 76 ms returned sat
[2021-05-08 00:17:46] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 98 ms returned sat
[2021-05-08 00:17:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:50] [INFO ] [Nat]Absence check using state equation in 4374 ms returned unknown
[2021-05-08 00:17:51] [INFO ] [Real]Absence check using 83 positive place invariants in 75 ms returned sat
[2021-05-08 00:17:51] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 102 ms returned sat
[2021-05-08 00:17:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:53] [INFO ] [Real]Absence check using state equation in 2345 ms returned sat
[2021-05-08 00:17:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:17:54] [INFO ] [Nat]Absence check using 83 positive place invariants in 78 ms returned sat
[2021-05-08 00:17:54] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 99 ms returned sat
[2021-05-08 00:17:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:17:59] [INFO ] [Nat]Absence check using state equation in 4358 ms returned unknown
[2021-05-08 00:18:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:546)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-08 00:18:05] [INFO ] [Real]Absence check using 83 positive place invariants in 74 ms returned sat
[2021-05-08 00:18:05] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 102 ms returned sat
[2021-05-08 00:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:07] [INFO ] [Real]Absence check using state equation in 2266 ms returned sat
[2021-05-08 00:18:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:18:08] [INFO ] [Nat]Absence check using 83 positive place invariants in 77 ms returned sat
[2021-05-08 00:18:08] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 100 ms returned sat
[2021-05-08 00:18:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:12] [INFO ] [Nat]Absence check using state equation in 4358 ms returned unknown
[2021-05-08 00:18:13] [INFO ] [Real]Absence check using 83 positive place invariants in 75 ms returned sat
[2021-05-08 00:18:13] [INFO ] [Real]Absence check using 83 positive and 272 generalized place invariants in 105 ms returned sat
[2021-05-08 00:18:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:15] [INFO ] [Real]Absence check using state equation in 2387 ms returned sat
[2021-05-08 00:18:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:18:16] [INFO ] [Nat]Absence check using 83 positive place invariants in 77 ms returned sat
[2021-05-08 00:18:16] [INFO ] [Nat]Absence check using 83 positive and 272 generalized place invariants in 99 ms returned sat
[2021-05-08 00:18:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:20] [INFO ] [Nat]Absence check using state equation in 4356 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 10 out of 3618 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions removed 835 transitions
Trivial Post-agglo rules discarded 835 transitions
Performed 835 trivial Post agglomeration. Transition count delta: 835
Iterating post reduction 0 with 835 rules applied. Total rules applied 835 place count 3618 transition count 3624
Reduce places removed 835 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 871 rules applied. Total rules applied 1706 place count 2783 transition count 3588
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 1719 place count 2774 transition count 3584
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1723 place count 2770 transition count 3584
Performed 838 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 838 Pre rules applied. Total rules applied 1723 place count 2770 transition count 2746
Deduced a syphon composed of 838 places in 7 ms
Ensure Unique test removed 81 places
Reduce places removed 919 places and 0 transitions.
Iterating global reduction 4 with 1757 rules applied. Total rules applied 3480 place count 1851 transition count 2746
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 59 rules applied. Total rules applied 3539 place count 1842 transition count 2696
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 51 rules applied. Total rules applied 3590 place count 1792 transition count 2695
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 3591 place count 1791 transition count 2695
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3591 place count 1791 transition count 2663
Deduced a syphon composed of 32 places in 6 ms
Ensure Unique test removed 32 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 7 with 96 rules applied. Total rules applied 3687 place count 1727 transition count 2663
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 32 Pre rules applied. Total rules applied 3687 place count 1727 transition count 2631
Deduced a syphon composed of 32 places in 63 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 7 with 64 rules applied. Total rules applied 3751 place count 1695 transition count 2631
Discarding 116 places :
Symmetric choice reduction at 7 with 116 rule applications. Total rules 3867 place count 1579 transition count 2515
Iterating global reduction 7 with 116 rules applied. Total rules applied 3983 place count 1579 transition count 2515
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3984 place count 1579 transition count 2514
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 38 Pre rules applied. Total rules applied 3984 place count 1579 transition count 2476
Deduced a syphon composed of 38 places in 63 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 8 with 77 rules applied. Total rules applied 4061 place count 1540 transition count 2476
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 4061 place count 1540 transition count 2475
Deduced a syphon composed of 1 places in 65 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 4064 place count 1538 transition count 2475
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 4072 place count 1530 transition count 2424
Iterating global reduction 8 with 8 rules applied. Total rules applied 4080 place count 1530 transition count 2424
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 4080 place count 1530 transition count 2418
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 4092 place count 1524 transition count 2418
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4093 place count 1523 transition count 2410
Iterating global reduction 8 with 1 rules applied. Total rules applied 4094 place count 1523 transition count 2410
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4095 place count 1522 transition count 2402
Iterating global reduction 8 with 1 rules applied. Total rules applied 4096 place count 1522 transition count 2402
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4097 place count 1521 transition count 2394
Iterating global reduction 8 with 1 rules applied. Total rules applied 4098 place count 1521 transition count 2394
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4099 place count 1520 transition count 2386
Iterating global reduction 8 with 1 rules applied. Total rules applied 4100 place count 1520 transition count 2386
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4101 place count 1519 transition count 2378
Iterating global reduction 8 with 1 rules applied. Total rules applied 4102 place count 1519 transition count 2378
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4103 place count 1518 transition count 2370
Iterating global reduction 8 with 1 rules applied. Total rules applied 4104 place count 1518 transition count 2370
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4105 place count 1517 transition count 2362
Iterating global reduction 8 with 1 rules applied. Total rules applied 4106 place count 1517 transition count 2362
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4107 place count 1516 transition count 2354
Iterating global reduction 8 with 1 rules applied. Total rules applied 4108 place count 1516 transition count 2354
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4109 place count 1515 transition count 2346
Iterating global reduction 8 with 1 rules applied. Total rules applied 4110 place count 1515 transition count 2346
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4111 place count 1514 transition count 2338
Iterating global reduction 8 with 1 rules applied. Total rules applied 4112 place count 1514 transition count 2338
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4113 place count 1513 transition count 2330
Iterating global reduction 8 with 1 rules applied. Total rules applied 4114 place count 1513 transition count 2330
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4115 place count 1512 transition count 2322
Iterating global reduction 8 with 1 rules applied. Total rules applied 4116 place count 1512 transition count 2322
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4117 place count 1511 transition count 2314
Iterating global reduction 8 with 1 rules applied. Total rules applied 4118 place count 1511 transition count 2314
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4119 place count 1510 transition count 2306
Iterating global reduction 8 with 1 rules applied. Total rules applied 4120 place count 1510 transition count 2306
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4121 place count 1509 transition count 2298
Iterating global reduction 8 with 1 rules applied. Total rules applied 4122 place count 1509 transition count 2298
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4123 place count 1508 transition count 2290
Iterating global reduction 8 with 1 rules applied. Total rules applied 4124 place count 1508 transition count 2290
Performed 212 Post agglomeration using F-continuation condition.Transition count delta: 212
Deduced a syphon composed of 212 places in 4 ms
Reduce places removed 212 places and 0 transitions.
Iterating global reduction 8 with 424 rules applied. Total rules applied 4548 place count 1296 transition count 2078
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4549 place count 1295 transition count 2077
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4551 place count 1294 transition count 2077
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4552 place count 1293 transition count 2076
Iterating global reduction 8 with 1 rules applied. Total rules applied 4553 place count 1293 transition count 2076
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 4555 place count 1293 transition count 2074
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 4556 place count 1292 transition count 2074
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 4558 place count 1291 transition count 2083
Free-agglomeration rule applied 9 times.
Iterating global reduction 10 with 9 rules applied. Total rules applied 4567 place count 1291 transition count 2074
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 10 with 9 rules applied. Total rules applied 4576 place count 1282 transition count 2074
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 11 with 7 rules applied. Total rules applied 4583 place count 1282 transition count 2067
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 11 with 7 rules applied. Total rules applied 4590 place count 1275 transition count 2067
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 4591 place count 1274 transition count 2066
Reduce places removed 14 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 12 with 20 rules applied. Total rules applied 4611 place count 1260 transition count 2060
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 4617 place count 1254 transition count 2060
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 22 Pre rules applied. Total rules applied 4617 place count 1254 transition count 2038
Deduced a syphon composed of 22 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 14 with 45 rules applied. Total rules applied 4662 place count 1231 transition count 2038
Discarding 9 places :
Implicit places reduction removed 9 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 4671 place count 1222 transition count 2038
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 4671 place count 1222 transition count 2037
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 4673 place count 1221 transition count 2037
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 15 with 30 rules applied. Total rules applied 4703 place count 1206 transition count 2022
Discarding 6 places :
Symmetric choice reduction at 15 with 6 rule applications. Total rules 4709 place count 1200 transition count 2016
Iterating global reduction 15 with 6 rules applied. Total rules applied 4715 place count 1200 transition count 2016
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 4716 place count 1199 transition count 2015
Iterating global reduction 15 with 1 rules applied. Total rules applied 4717 place count 1199 transition count 2015
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 4718 place count 1199 transition count 2014
Free-agglomeration rule applied 6 times.
Iterating global reduction 16 with 6 rules applied. Total rules applied 4724 place count 1199 transition count 2008
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 16 with 6 rules applied. Total rules applied 4730 place count 1193 transition count 2008
Applied a total of 4730 rules in 6432 ms. Remains 1193 /3618 variables (removed 2425) and now considering 2008/4459 (removed 2451) transitions.
Finished structural reductions, in 1 iterations. Remains : 1193/3618 places, 2008/4459 transitions.
// Phase 1: matrix 2008 rows 1193 cols
[2021-05-08 00:18:27] [INFO ] Computed 206 place invariants in 35 ms
Incomplete random walk after 1000000 steps, including 10193 resets, run finished after 4473 ms. (steps per millisecond=223 ) properties (out of 10) seen :3
FORMULA ASLink-PT-08b-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 1259 resets, run finished after 1615 ms. (steps per millisecond=619 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1262 resets, run finished after 1600 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1279 resets, run finished after 1599 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1272 resets, run finished after 1598 ms. (steps per millisecond=625 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1277 resets, run finished after 1617 ms. (steps per millisecond=618 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1270 resets, run finished after 1602 ms. (steps per millisecond=624 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1268 resets, run finished after 1605 ms. (steps per millisecond=623 ) properties (out of 7) seen :0
// Phase 1: matrix 2008 rows 1193 cols
[2021-05-08 00:18:43] [INFO ] Computed 206 place invariants in 34 ms
[2021-05-08 00:18:43] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned sat
[2021-05-08 00:18:43] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 32 ms returned sat
[2021-05-08 00:18:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:44] [INFO ] [Real]Absence check using state equation in 707 ms returned sat
[2021-05-08 00:18:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:18:44] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-08 00:18:44] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 29 ms returned sat
[2021-05-08 00:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:45] [INFO ] [Nat]Absence check using state equation in 807 ms returned sat
[2021-05-08 00:18:45] [INFO ] Computed and/alt/rep : 825/3209/825 causal constraints (skipped 1140 transitions) in 134 ms.
[2021-05-08 00:18:49] [INFO ] Added : 175 causal constraints over 35 iterations in 4054 ms. Result :sat
Minimization took 662 ms.
[2021-05-08 00:18:50] [INFO ] [Real]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-08 00:18:50] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 32 ms returned sat
[2021-05-08 00:18:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:50] [INFO ] [Real]Absence check using state equation in 735 ms returned sat
[2021-05-08 00:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:18:51] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-08 00:18:51] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 30 ms returned sat
[2021-05-08 00:18:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:18:52] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2021-05-08 00:18:52] [INFO ] Computed and/alt/rep : 825/3209/825 causal constraints (skipped 1140 transitions) in 113 ms.
[2021-05-08 00:19:05] [INFO ] Added : 654 causal constraints over 131 iterations in 13489 ms. Result :sat
Minimization took 755 ms.
[2021-05-08 00:19:06] [INFO ] [Real]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-08 00:19:06] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 30 ms returned sat
[2021-05-08 00:19:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:07] [INFO ] [Real]Absence check using state equation in 726 ms returned sat
[2021-05-08 00:19:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:19:07] [INFO ] [Nat]Absence check using 55 positive place invariants in 23 ms returned sat
[2021-05-08 00:19:07] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 28 ms returned sat
[2021-05-08 00:19:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:08] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2021-05-08 00:19:08] [INFO ] Computed and/alt/rep : 825/3209/825 causal constraints (skipped 1140 transitions) in 97 ms.
[2021-05-08 00:19:21] [INFO ] Added : 656 causal constraints over 132 iterations in 13580 ms. Result :sat
Minimization took 1009 ms.
[2021-05-08 00:19:23] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-08 00:19:23] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 30 ms returned sat
[2021-05-08 00:19:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:23] [INFO ] [Real]Absence check using state equation in 681 ms returned sat
[2021-05-08 00:19:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:19:23] [INFO ] [Nat]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-08 00:19:23] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 28 ms returned sat
[2021-05-08 00:19:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:24] [INFO ] [Nat]Absence check using state equation in 790 ms returned sat
[2021-05-08 00:19:24] [INFO ] Computed and/alt/rep : 825/3209/825 causal constraints (skipped 1140 transitions) in 96 ms.
[2021-05-08 00:19:30] [INFO ] Added : 202 causal constraints over 41 iterations in 5277 ms. Result :sat
Minimization took 819 ms.
[2021-05-08 00:19:31] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-08 00:19:31] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 29 ms returned sat
[2021-05-08 00:19:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:31] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2021-05-08 00:19:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:19:31] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-08 00:19:32] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 30 ms returned sat
[2021-05-08 00:19:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:32] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2021-05-08 00:19:33] [INFO ] Computed and/alt/rep : 825/3209/825 causal constraints (skipped 1140 transitions) in 125 ms.
[2021-05-08 00:19:36] [INFO ] Added : 162 causal constraints over 33 iterations in 3567 ms. Result :sat
Minimization took 799 ms.
[2021-05-08 00:19:37] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-08 00:19:37] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 29 ms returned sat
[2021-05-08 00:19:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:38] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2021-05-08 00:19:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:19:38] [INFO ] [Nat]Absence check using 55 positive place invariants in 17 ms returned sat
[2021-05-08 00:19:38] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 30 ms returned sat
[2021-05-08 00:19:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:39] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2021-05-08 00:19:39] [INFO ] Computed and/alt/rep : 825/3209/825 causal constraints (skipped 1140 transitions) in 119 ms.
[2021-05-08 00:19:53] [INFO ] Added : 662 causal constraints over 133 iterations in 14278 ms. Result :sat
Minimization took 981 ms.
[2021-05-08 00:19:54] [INFO ] [Real]Absence check using 55 positive place invariants in 16 ms returned sat
[2021-05-08 00:19:54] [INFO ] [Real]Absence check using 55 positive and 151 generalized place invariants in 31 ms returned sat
[2021-05-08 00:19:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:55] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2021-05-08 00:19:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:19:55] [INFO ] [Nat]Absence check using 55 positive place invariants in 18 ms returned sat
[2021-05-08 00:19:55] [INFO ] [Nat]Absence check using 55 positive and 151 generalized place invariants in 30 ms returned sat
[2021-05-08 00:19:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:19:56] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2021-05-08 00:19:56] [INFO ] Computed and/alt/rep : 825/3209/825 causal constraints (skipped 1140 transitions) in 118 ms.
[2021-05-08 00:20:00] [INFO ] Added : 179 causal constraints over 36 iterations in 3802 ms. Result :sat
Minimization took 700 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 294900 steps, including 4068 resets, run finished after 1397 ms. (steps per millisecond=211 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 556500 steps, including 8550 resets, run finished after 6157 ms. (steps per millisecond=90 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 355900 steps, including 3182 resets, run finished after 1557 ms. (steps per millisecond=228 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 329000 steps, including 3039 resets, run finished after 1400 ms. (steps per millisecond=235 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 480900 steps, including 6146 resets, run finished after 2135 ms. (steps per millisecond=225 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 940000 steps, including 7838 resets, run finished after 4186 ms. (steps per millisecond=224 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 436700 steps, including 1002 resets, run finished after 1646 ms. (steps per millisecond=265 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 7 out of 1193 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1193/1193 places, 2008/2008 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 1193 transition count 2007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1192 transition count 2007
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1192 transition count 2006
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1191 transition count 2006
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1190 transition count 2000
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1190 transition count 2000
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 11 place count 1187 transition count 1998
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 2 with 2 rules applied. Total rules applied 13 place count 1187 transition count 1996
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 15 place count 1185 transition count 1996
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 15 place count 1185 transition count 1995
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 17 place count 1184 transition count 1995
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 18 place count 1183 transition count 1995
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 22 place count 1181 transition count 1993
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 23 place count 1180 transition count 1992
Iterating global reduction 5 with 1 rules applied. Total rules applied 24 place count 1180 transition count 1992
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 25 place count 1180 transition count 1991
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 26 place count 1179 transition count 1991
Applied a total of 26 rules in 296 ms. Remains 1179 /1193 variables (removed 14) and now considering 1991/2008 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 1179/1193 places, 1991/2008 transitions.
// Phase 1: matrix 1991 rows 1179 cols
[2021-05-08 00:20:20] [INFO ] Computed 203 place invariants in 34 ms
Incomplete random walk after 1000000 steps, including 10235 resets, run finished after 4200 ms. (steps per millisecond=238 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1285 resets, run finished after 1554 ms. (steps per millisecond=643 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1278 resets, run finished after 1553 ms. (steps per millisecond=643 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1288 resets, run finished after 1552 ms. (steps per millisecond=644 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1271 resets, run finished after 1555 ms. (steps per millisecond=643 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1288 resets, run finished after 1553 ms. (steps per millisecond=643 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1275 resets, run finished after 1552 ms. (steps per millisecond=644 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1293 resets, run finished after 1537 ms. (steps per millisecond=650 ) properties (out of 7) seen :0
// Phase 1: matrix 1991 rows 1179 cols
[2021-05-08 00:20:35] [INFO ] Computed 203 place invariants in 35 ms
[2021-05-08 00:20:35] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:20:35] [INFO ] [Real]Absence check using 53 positive and 150 generalized place invariants in 30 ms returned sat
[2021-05-08 00:20:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:20:36] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2021-05-08 00:20:36] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:20:36] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2021-05-08 00:20:36] [INFO ] [Nat]Absence check using 53 positive and 150 generalized place invariants in 29 ms returned sat
[2021-05-08 00:20:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:20:37] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2021-05-08 00:20:37] [INFO ] Computed and/alt/rep : 812/3210/812 causal constraints (skipped 1137 transitions) in 95 ms.
[2021-05-08 00:20:49] [INFO ] Added : 612 causal constraints over 123 iterations in 12776 ms. Result :sat
Minimization took 770 ms.
[2021-05-08 00:20:50] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:20:50] [INFO ] [Real]Absence check using 53 positive and 150 generalized place invariants in 31 ms returned sat
[2021-05-08 00:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:20:51] [INFO ] [Real]Absence check using state equation in 634 ms returned sat
[2021-05-08 00:20:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:20:51] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2021-05-08 00:20:51] [INFO ] [Nat]Absence check using 53 positive and 150 generalized place invariants in 29 ms returned sat
[2021-05-08 00:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:20:52] [INFO ] [Nat]Absence check using state equation in 826 ms returned sat
[2021-05-08 00:20:52] [INFO ] Deduced a trap composed of 102 places in 309 ms of which 2 ms to minimize.
[2021-05-08 00:20:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 417 ms
[2021-05-08 00:20:53] [INFO ] Computed and/alt/rep : 812/3210/812 causal constraints (skipped 1137 transitions) in 120 ms.
[2021-05-08 00:21:04] [INFO ] Added : 575 causal constraints over 115 iterations in 11301 ms. Result :sat
Minimization took 1039 ms.
[2021-05-08 00:21:05] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:21:05] [INFO ] [Real]Absence check using 53 positive and 150 generalized place invariants in 31 ms returned sat
[2021-05-08 00:21:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:06] [INFO ] [Real]Absence check using state equation in 632 ms returned sat
[2021-05-08 00:21:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:21:06] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2021-05-08 00:21:06] [INFO ] [Nat]Absence check using 53 positive and 150 generalized place invariants in 29 ms returned sat
[2021-05-08 00:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:07] [INFO ] [Nat]Absence check using state equation in 1021 ms returned sat
[2021-05-08 00:21:07] [INFO ] Computed and/alt/rep : 812/3210/812 causal constraints (skipped 1137 transitions) in 99 ms.
[2021-05-08 00:21:18] [INFO ] Added : 593 causal constraints over 119 iterations in 11439 ms. Result :sat
Minimization took 1061 ms.
[2021-05-08 00:21:20] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:21:20] [INFO ] [Real]Absence check using 53 positive and 150 generalized place invariants in 30 ms returned sat
[2021-05-08 00:21:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:20] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2021-05-08 00:21:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:21:20] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2021-05-08 00:21:20] [INFO ] [Nat]Absence check using 53 positive and 150 generalized place invariants in 30 ms returned sat
[2021-05-08 00:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:21] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2021-05-08 00:21:21] [INFO ] Computed and/alt/rep : 812/3210/812 causal constraints (skipped 1137 transitions) in 99 ms.
[2021-05-08 00:21:33] [INFO ] Added : 510 causal constraints over 102 iterations in 11704 ms. Result :sat
Minimization took 971 ms.
[2021-05-08 00:21:34] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:21:34] [INFO ] [Real]Absence check using 53 positive and 150 generalized place invariants in 30 ms returned sat
[2021-05-08 00:21:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:35] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2021-05-08 00:21:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:21:35] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:21:35] [INFO ] [Nat]Absence check using 53 positive and 150 generalized place invariants in 29 ms returned sat
[2021-05-08 00:21:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:36] [INFO ] [Nat]Absence check using state equation in 686 ms returned sat
[2021-05-08 00:21:36] [INFO ] Computed and/alt/rep : 812/3210/812 causal constraints (skipped 1137 transitions) in 98 ms.
[2021-05-08 00:21:41] [INFO ] Added : 179 causal constraints over 37 iterations in 5408 ms. Result :sat
Minimization took 562 ms.
[2021-05-08 00:21:42] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:21:42] [INFO ] [Real]Absence check using 53 positive and 150 generalized place invariants in 31 ms returned sat
[2021-05-08 00:21:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:43] [INFO ] [Real]Absence check using state equation in 643 ms returned sat
[2021-05-08 00:21:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:21:43] [INFO ] [Nat]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:21:43] [INFO ] [Nat]Absence check using 53 positive and 150 generalized place invariants in 29 ms returned sat
[2021-05-08 00:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:44] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2021-05-08 00:21:44] [INFO ] Computed and/alt/rep : 812/3210/812 causal constraints (skipped 1137 transitions) in 98 ms.
[2021-05-08 00:21:47] [INFO ] Added : 147 causal constraints over 30 iterations in 3268 ms. Result :sat
Minimization took 501 ms.
[2021-05-08 00:21:48] [INFO ] [Real]Absence check using 53 positive place invariants in 16 ms returned sat
[2021-05-08 00:21:48] [INFO ] [Real]Absence check using 53 positive and 150 generalized place invariants in 30 ms returned sat
[2021-05-08 00:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:48] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2021-05-08 00:21:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:21:48] [INFO ] [Nat]Absence check using 53 positive place invariants in 17 ms returned sat
[2021-05-08 00:21:48] [INFO ] [Nat]Absence check using 53 positive and 150 generalized place invariants in 31 ms returned sat
[2021-05-08 00:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:21:49] [INFO ] [Nat]Absence check using state equation in 683 ms returned sat
[2021-05-08 00:21:49] [INFO ] Computed and/alt/rep : 812/3210/812 causal constraints (skipped 1137 transitions) in 97 ms.
[2021-05-08 00:22:03] [INFO ] Added : 679 causal constraints over 136 iterations in 13374 ms. Result :sat
Minimization took 1014 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 353500 steps, including 1002 resets, run finished after 1333 ms. (steps per millisecond=265 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 176600 steps, including 2650 resets, run finished after 734 ms. (steps per millisecond=240 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 114200 steps, including 1692 resets, run finished after 473 ms. (steps per millisecond=241 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 562100 steps, including 5954 resets, run finished after 2548 ms. (steps per millisecond=220 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 951400 steps, including 10450 resets, run finished after 4557 ms. (steps per millisecond=208 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 404000 steps, including 3050 resets, run finished after 1661 ms. (steps per millisecond=243 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 343200 steps, including 1002 resets, run finished after 1309 ms. (steps per millisecond=262 ) properties (out of 7) seen :0 could not realise parikh vector
Support contains 7 out of 1179 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1179/1179 places, 1991/1991 transitions.
Applied a total of 0 rules in 42 ms. Remains 1179 /1179 variables (removed 0) and now considering 1991/1991 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1179/1179 places, 1991/1991 transitions.
Starting structural reductions, iteration 0 : 1179/1179 places, 1991/1991 transitions.
Applied a total of 0 rules in 42 ms. Remains 1179 /1179 variables (removed 0) and now considering 1991/1991 (removed 0) transitions.
// Phase 1: matrix 1991 rows 1179 cols
[2021-05-08 00:22:16] [INFO ] Computed 203 place invariants in 33 ms
[2021-05-08 00:22:17] [INFO ] Implicit Places using invariants in 893 ms returned [1, 19, 20, 32, 49, 67, 136, 140, 149, 150, 152, 169, 187, 256, 260, 261, 272, 273, 275, 292, 310, 382, 386, 387, 398, 399, 401, 418, 436, 509, 513, 514, 525, 526, 528, 545, 563, 636, 637, 648, 649, 651, 668, 686, 706, 761, 762, 773, 775, 776, 778, 795, 813, 882, 886, 887, 898, 899, 901, 918, 936, 1005, 1009, 1010, 1013, 1024, 1025, 1026, 1044, 1046, 1050, 1068, 1069, 1070, 1071, 1083, 1089, 1095, 1101, 1107, 1113, 1119, 1125, 1131, 1137, 1143]
Discarding 86 places :
Implicit Place search using SMT only with invariants took 897 ms to find 86 implicit places.
[2021-05-08 00:22:17] [INFO ] Redundant transitions in 141 ms returned []
// Phase 1: matrix 1991 rows 1093 cols
[2021-05-08 00:22:17] [INFO ] Computed 117 place invariants in 20 ms
[2021-05-08 00:22:18] [INFO ] Dead Transitions using invariants and state equation in 818 ms returned []
Starting structural reductions, iteration 1 : 1093/1179 places, 1991/1991 transitions.
Drop transitions removed 156 transitions
Trivial Post-agglo rules discarded 156 transitions
Performed 156 trivial Post agglomeration. Transition count delta: 156
Iterating post reduction 0 with 156 rules applied. Total rules applied 156 place count 1093 transition count 1835
Reduce places removed 156 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 164 rules applied. Total rules applied 320 place count 937 transition count 1827
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 322 place count 935 transition count 1827
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 322 place count 935 transition count 1787
Deduced a syphon composed of 40 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 403 place count 894 transition count 1787
Discarding 5 places :
Implicit places reduction removed 5 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 13 rules applied. Total rules applied 416 place count 889 transition count 1779
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 424 place count 881 transition count 1779
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 439 place count 866 transition count 1764
Iterating global reduction 5 with 15 rules applied. Total rules applied 454 place count 866 transition count 1764
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 457 place count 866 transition count 1761
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 457 place count 866 transition count 1760
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 459 place count 865 transition count 1760
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 462 place count 862 transition count 1754
Iterating global reduction 6 with 3 rules applied. Total rules applied 465 place count 862 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 466 place count 861 transition count 1753
Iterating global reduction 6 with 1 rules applied. Total rules applied 467 place count 861 transition count 1753
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 468 place count 860 transition count 1751
Iterating global reduction 6 with 1 rules applied. Total rules applied 469 place count 860 transition count 1751
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 3 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 6 with 118 rules applied. Total rules applied 587 place count 801 transition count 1692
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 593 place count 795 transition count 1686
Iterating global reduction 6 with 6 rules applied. Total rules applied 599 place count 795 transition count 1686
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 605 place count 795 transition count 1680
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 609 place count 793 transition count 1681
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 610 place count 793 transition count 1680
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 611 place count 792 transition count 1680
Free-agglomeration rule (complex) applied 22 times.
Iterating global reduction 8 with 22 rules applied. Total rules applied 633 place count 792 transition count 1658
Ensure Unique test removed 1 places
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 8 with 23 rules applied. Total rules applied 656 place count 769 transition count 1658
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 658 place count 769 transition count 1656
Partial Free-agglomeration rule applied 24 times.
Drop transitions removed 24 transitions
Iterating global reduction 9 with 24 rules applied. Total rules applied 682 place count 769 transition count 1656
Applied a total of 682 rules in 392 ms. Remains 769 /1093 variables (removed 324) and now considering 1656/1991 (removed 335) transitions.
// Phase 1: matrix 1656 rows 769 cols
[2021-05-08 00:22:19] [INFO ] Computed 110 place invariants in 30 ms
[2021-05-08 00:22:19] [INFO ] Implicit Places using invariants in 523 ms returned [73, 90, 96, 99, 101, 104, 105, 157, 174, 180, 183, 185, 190, 191, 244, 261, 267, 270, 272, 278, 279, 331, 350, 356, 359, 361, 366, 367, 437, 443, 446, 448, 454, 455, 521, 527, 530, 532, 537, 538, 591, 608, 614, 617, 619, 624, 625, 677, 694, 700, 703, 705]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 536 ms to find 52 implicit places.
Starting structural reductions, iteration 2 : 717/1179 places, 1656/1991 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 693 transition count 1632
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 693 transition count 1632
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 56 place count 685 transition count 1624
Iterating global reduction 0 with 8 rules applied. Total rules applied 64 place count 685 transition count 1624
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 92 place count 671 transition count 1610
Free-agglomeration rule applied 24 times.
Iterating global reduction 0 with 24 rules applied. Total rules applied 116 place count 671 transition count 1586
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 140 place count 647 transition count 1586
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 146 place count 647 transition count 1580
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 152 place count 641 transition count 1580
Applied a total of 152 rules in 136 ms. Remains 641 /717 variables (removed 76) and now considering 1580/1656 (removed 76) transitions.
// Phase 1: matrix 1580 rows 641 cols
[2021-05-08 00:22:19] [INFO ] Computed 58 place invariants in 42 ms
[2021-05-08 00:22:20] [INFO ] Implicit Places using invariants in 410 ms returned []
// Phase 1: matrix 1580 rows 641 cols
[2021-05-08 00:22:20] [INFO ] Computed 58 place invariants in 15 ms
[2021-05-08 00:22:28] [INFO ] Implicit Places using invariants and state equation in 8707 ms returned []
Implicit Place search using SMT with State Equation took 9118 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 641/1179 places, 1580/1991 transitions.
Successfully produced net in file /tmp/petri1000_16608324117653450770.dot
Successfully produced net in file /tmp/petri1001_5519712014316490951.dot
Successfully produced net in file /tmp/petri1002_14343927493501096905.dot
Successfully produced net in file /tmp/petri1003_7508520923075202369.dot
Successfully produced net in file /tmp/petri1004_5036794931522695012.dot
Successfully produced net in file /tmp/petri1005_703034247033459407.dot
Successfully produced net in file /tmp/petri1006_11613351898237629462.dot
Successfully produced net in file /tmp/petri1007_12529287303684445807.dot
Drop transitions removed 8 transitions
Dominated transitions for bounds rules discarded 8 transitions
// Phase 1: matrix 1572 rows 641 cols
[2021-05-08 00:22:28] [INFO ] Computed 58 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 16677 resets, run finished after 3267 ms. (steps per millisecond=306 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2794 resets, run finished after 1011 ms. (steps per millisecond=989 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2820 resets, run finished after 989 ms. (steps per millisecond=1011 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2804 resets, run finished after 960 ms. (steps per millisecond=1041 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2810 resets, run finished after 988 ms. (steps per millisecond=1012 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2800 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2785 resets, run finished after 957 ms. (steps per millisecond=1044 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2802 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 7) seen :0
// Phase 1: matrix 1572 rows 641 cols
[2021-05-08 00:22:39] [INFO ] Computed 58 place invariants in 15 ms
[2021-05-08 00:22:39] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-08 00:22:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:39] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2021-05-08 00:22:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:22:39] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:39] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-08 00:22:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:40] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2021-05-08 00:22:40] [INFO ] Computed and/alt/rep : 380/1738/380 causal constraints (skipped 1151 transitions) in 77 ms.
[2021-05-08 00:22:41] [INFO ] Added : 47 causal constraints over 10 iterations in 941 ms. Result :sat
Minimization took 208 ms.
[2021-05-08 00:22:41] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:41] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-08 00:22:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:41] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2021-05-08 00:22:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:22:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:41] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 10 ms returned sat
[2021-05-08 00:22:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:42] [INFO ] [Nat]Absence check using state equation in 706 ms returned sat
[2021-05-08 00:22:42] [INFO ] Computed and/alt/rep : 380/1738/380 causal constraints (skipped 1151 transitions) in 78 ms.
[2021-05-08 00:22:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2021-05-08 00:22:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2021-05-08 00:22:44] [INFO ] Added : 58 causal constraints over 13 iterations in 1685 ms. Result :sat
Minimization took 291 ms.
[2021-05-08 00:22:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:44] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 12 ms returned sat
[2021-05-08 00:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:45] [INFO ] [Real]Absence check using state equation in 369 ms returned sat
[2021-05-08 00:22:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:22:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:45] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-08 00:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:45] [INFO ] [Nat]Absence check using state equation in 461 ms returned sat
[2021-05-08 00:22:45] [INFO ] Computed and/alt/rep : 380/1738/380 causal constraints (skipped 1151 transitions) in 77 ms.
[2021-05-08 00:22:46] [INFO ] Added : 69 causal constraints over 15 iterations in 1201 ms. Result :sat
Minimization took 258 ms.
[2021-05-08 00:22:47] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:47] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-08 00:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:47] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-08 00:22:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:22:47] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-08 00:22:47] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 12 ms returned sat
[2021-05-08 00:22:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:48] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2021-05-08 00:22:48] [INFO ] Computed and/alt/rep : 380/1738/380 causal constraints (skipped 1151 transitions) in 96 ms.
[2021-05-08 00:22:49] [INFO ] Added : 71 causal constraints over 15 iterations in 1534 ms. Result :sat
Minimization took 380 ms.
[2021-05-08 00:22:50] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-08 00:22:50] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-08 00:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:50] [INFO ] [Real]Absence check using state equation in 347 ms returned sat
[2021-05-08 00:22:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:22:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:50] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 11 ms returned sat
[2021-05-08 00:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:51] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2021-05-08 00:22:51] [INFO ] Computed and/alt/rep : 380/1738/380 causal constraints (skipped 1151 transitions) in 79 ms.
[2021-05-08 00:22:52] [INFO ] Added : 39 causal constraints over 8 iterations in 962 ms. Result :sat
Minimization took 222 ms.
[2021-05-08 00:22:52] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:52] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 12 ms returned sat
[2021-05-08 00:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:53] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2021-05-08 00:22:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:22:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:53] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 12 ms returned sat
[2021-05-08 00:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:53] [INFO ] [Nat]Absence check using state equation in 483 ms returned sat
[2021-05-08 00:22:53] [INFO ] Computed and/alt/rep : 380/1738/380 causal constraints (skipped 1151 transitions) in 77 ms.
[2021-05-08 00:22:54] [INFO ] Added : 43 causal constraints over 10 iterations in 819 ms. Result :sat
Minimization took 452 ms.
[2021-05-08 00:22:55] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:22:55] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 12 ms returned sat
[2021-05-08 00:22:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:55] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2021-05-08 00:22:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:22:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-08 00:22:55] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 12 ms returned sat
[2021-05-08 00:22:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:22:56] [INFO ] [Nat]Absence check using state equation in 614 ms returned sat
[2021-05-08 00:22:56] [INFO ] Computed and/alt/rep : 380/1738/380 causal constraints (skipped 1151 transitions) in 96 ms.
[2021-05-08 00:22:57] [INFO ] Added : 36 causal constraints over 8 iterations in 1172 ms. Result :sat
Minimization took 273 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 125100 steps, including 2333 resets, run finished after 416 ms. (steps per millisecond=300 ) properties (out of 7) seen :1 could not realise parikh vector
FORMULA ASLink-PT-08b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 113200 steps, including 2276 resets, run finished after 339 ms. (steps per millisecond=333 ) properties (out of 6) seen :3 could not realise parikh vector
FORMULA ASLink-PT-08b-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08b-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-08b-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 157000 steps, including 2229 resets, run finished after 488 ms. (steps per millisecond=321 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 176100 steps, including 3796 resets, run finished after 592 ms. (steps per millisecond=297 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA ASLink-PT-08b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 143100 steps, including 2055 resets, run finished after 452 ms. (steps per millisecond=316 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 126500 steps, including 5259 resets, run finished after 345 ms. (steps per millisecond=366 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 106300 steps, including 1003 resets, run finished after 299 ms. (steps per millisecond=355 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 641 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 641/641 places, 1572/1572 transitions.
Graph (complete) has 3881 edges and 641 vertex of which 633 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5471 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 633 transition count 1569
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 630 transition count 1569
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 630 transition count 1567
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 11 place count 628 transition count 1567
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 627 transition count 1566
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 627 transition count 1566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 627 transition count 1565
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 627 transition count 1565
Applied a total of 22 rules in 5547 ms. Remains 627 /641 variables (removed 14) and now considering 1565/1572 (removed 7) transitions.
Finished structural reductions, in 1 iterations. Remains : 627/641 places, 1565/1572 transitions.
// Phase 1: matrix 1565 rows 627 cols
[2021-05-08 00:23:06] [INFO ] Computed 58 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 16796 resets, run finished after 3287 ms. (steps per millisecond=304 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2773 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2779 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 2) seen :0
// Phase 1: matrix 1565 rows 627 cols
[2021-05-08 00:23:11] [INFO ] Computed 58 place invariants in 14 ms
[2021-05-08 00:23:11] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 00:23:11] [INFO ] [Real]Absence check using 15 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:11] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2021-05-08 00:23:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:23:12] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:12] [INFO ] [Nat]Absence check using 15 positive and 43 generalized place invariants in 13 ms returned sat
[2021-05-08 00:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:12] [INFO ] [Nat]Absence check using state equation in 455 ms returned sat
[2021-05-08 00:23:12] [INFO ] Computed and/alt/rep : 364/1618/364 causal constraints (skipped 1160 transitions) in 80 ms.
[2021-05-08 00:23:13] [INFO ] Added : 26 causal constraints over 6 iterations in 590 ms. Result :sat
Minimization took 210 ms.
[2021-05-08 00:23:13] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:13] [INFO ] [Real]Absence check using 15 positive and 43 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:13] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2021-05-08 00:23:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:23:13] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:13] [INFO ] [Nat]Absence check using 15 positive and 43 generalized place invariants in 10 ms returned sat
[2021-05-08 00:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:14] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2021-05-08 00:23:14] [INFO ] Computed and/alt/rep : 364/1618/364 causal constraints (skipped 1160 transitions) in 78 ms.
[2021-05-08 00:23:15] [INFO ] Added : 23 causal constraints over 5 iterations in 567 ms. Result :sat
Minimization took 539 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 220400 steps, including 5890 resets, run finished after 754 ms. (steps per millisecond=292 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 129200 steps, including 1003 resets, run finished after 355 ms. (steps per millisecond=363 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 627 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 627/627 places, 1565/1565 transitions.
Applied a total of 0 rules in 24 ms. Remains 627 /627 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 627/627 places, 1565/1565 transitions.
Starting structural reductions, iteration 0 : 627/627 places, 1565/1565 transitions.
Applied a total of 0 rules in 24 ms. Remains 627 /627 variables (removed 0) and now considering 1565/1565 (removed 0) transitions.
// Phase 1: matrix 1565 rows 627 cols
[2021-05-08 00:23:16] [INFO ] Computed 58 place invariants in 14 ms
[2021-05-08 00:23:17] [INFO ] Implicit Places using invariants in 343 ms returned [344]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 345 ms to find 1 implicit places.
[2021-05-08 00:23:17] [INFO ] Redundant transitions in 74 ms returned []
// Phase 1: matrix 1565 rows 626 cols
[2021-05-08 00:23:17] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-08 00:23:17] [INFO ] Dead Transitions using invariants and state equation in 572 ms returned []
Starting structural reductions, iteration 1 : 626/627 places, 1565/1565 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 625 transition count 1564
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 625 transition count 1563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 624 transition count 1563
Applied a total of 4 rules in 63 ms. Remains 624 /626 variables (removed 2) and now considering 1563/1565 (removed 2) transitions.
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:17] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-08 00:23:18] [INFO ] Implicit Places using invariants in 328 ms returned []
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:18] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-08 00:23:19] [INFO ] Implicit Places using invariants and state equation in 1222 ms returned []
Implicit Place search using SMT with State Equation took 1559 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 624/627 places, 1563/1565 transitions.
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:19] [INFO ] Computed 57 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 16841 resets, run finished after 3212 ms. (steps per millisecond=311 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2803 resets, run finished after 969 ms. (steps per millisecond=1031 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2806 resets, run finished after 958 ms. (steps per millisecond=1043 ) properties (out of 2) seen :0
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:24] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-08 00:23:24] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:24] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 10 ms returned sat
[2021-05-08 00:23:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:25] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2021-05-08 00:23:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:23:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 00:23:25] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 12 ms returned sat
[2021-05-08 00:23:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:25] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2021-05-08 00:23:26] [INFO ] Computed and/alt/rep : 355/1545/355 causal constraints (skipped 1167 transitions) in 79 ms.
[2021-05-08 00:23:26] [INFO ] Added : 21 causal constraints over 5 iterations in 591 ms. Result :sat
Minimization took 191 ms.
[2021-05-08 00:23:26] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:26] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:27] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2021-05-08 00:23:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:23:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:27] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:28] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2021-05-08 00:23:28] [INFO ] Computed and/alt/rep : 355/1545/355 causal constraints (skipped 1167 transitions) in 77 ms.
[2021-05-08 00:23:28] [INFO ] Added : 16 causal constraints over 4 iterations in 454 ms. Result :sat
Minimization took 394 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 106700 steps, including 2384 resets, run finished after 349 ms. (steps per millisecond=305 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 71700 steps, including 1003 resets, run finished after 207 ms. (steps per millisecond=346 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 places, 1563/1563 transitions.
Applied a total of 0 rules in 23 ms. Remains 624 /624 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 624/624 places, 1563/1563 transitions.
Starting structural reductions, iteration 0 : 624/624 places, 1563/1563 transitions.
Applied a total of 0 rules in 23 ms. Remains 624 /624 variables (removed 0) and now considering 1563/1563 (removed 0) transitions.
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:29] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:23:30] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:30] [INFO ] Computed 57 place invariants in 17 ms
[2021-05-08 00:23:31] [INFO ] Implicit Places using invariants and state equation in 1193 ms returned []
Implicit Place search using SMT with State Equation took 1542 ms to find 0 implicit places.
[2021-05-08 00:23:31] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:31] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-08 00:23:31] [INFO ] Dead Transitions using invariants and state equation in 562 ms returned []
Finished structural reductions, in 1 iterations. Remains : 624/624 places, 1563/1563 transitions.
Starting property specific reduction for ASLink-PT-08b-UpperBounds-01
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:43] [INFO ] Computed 57 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 165 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:43] [INFO ] Computed 57 place invariants in 16 ms
[2021-05-08 00:23:43] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:43] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:43] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2021-05-08 00:23:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:23:43] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:43] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:44] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2021-05-08 00:23:44] [INFO ] Computed and/alt/rep : 355/1545/355 causal constraints (skipped 1167 transitions) in 78 ms.
[2021-05-08 00:23:45] [INFO ] Added : 21 causal constraints over 5 iterations in 591 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 71700 steps, including 1003 resets, run finished after 208 ms. (steps per millisecond=344 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 places, 1563/1563 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 623 transition count 1562
Applied a total of 2 rules in 40 ms. Remains 623 /624 variables (removed 1) and now considering 1562/1563 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 1562/1563 transitions.
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:23:45] [INFO ] Computed 57 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16832 resets, run finished after 3183 ms. (steps per millisecond=314 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2797 resets, run finished after 936 ms. (steps per millisecond=1068 ) properties (out of 1) seen :0
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:23:49] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:23:49] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2021-05-08 00:23:49] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 12 ms returned sat
[2021-05-08 00:23:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:50] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2021-05-08 00:23:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:23:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:50] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 12 ms returned sat
[2021-05-08 00:23:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:50] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2021-05-08 00:23:51] [INFO ] Computed and/alt/rep : 354/1544/354 causal constraints (skipped 1167 transitions) in 76 ms.
[2021-05-08 00:23:52] [INFO ] Added : 44 causal constraints over 10 iterations in 1576 ms. Result :sat
Minimization took 213 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 160600 steps, including 4517 resets, run finished after 519 ms. (steps per millisecond=309 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 623/623 places, 1562/1562 transitions.
Applied a total of 0 rules in 23 ms. Remains 623 /623 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 623/623 places, 1562/1562 transitions.
Starting structural reductions, iteration 0 : 623/623 places, 1562/1562 transitions.
Applied a total of 0 rules in 23 ms. Remains 623 /623 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:23:53] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:23:53] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:23:53] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-08 00:23:55] [INFO ] Implicit Places using invariants and state equation in 1200 ms returned []
Implicit Place search using SMT with State Equation took 1579 ms to find 0 implicit places.
[2021-05-08 00:23:55] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:23:55] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:23:55] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Finished structural reductions, in 1 iterations. Remains : 623/623 places, 1562/1562 transitions.
Ending property specific reduction for ASLink-PT-08b-UpperBounds-01 in 23737 ms.
Starting property specific reduction for ASLink-PT-08b-UpperBounds-12
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:55] [INFO ] Computed 57 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 160 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 1563 rows 624 cols
[2021-05-08 00:23:55] [INFO ] Computed 57 place invariants in 15 ms
[2021-05-08 00:23:55] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2021-05-08 00:23:55] [INFO ] [Real]Absence check using 15 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:56] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2021-05-08 00:23:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:23:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 7 ms returned sat
[2021-05-08 00:23:56] [INFO ] [Nat]Absence check using 15 positive and 42 generalized place invariants in 11 ms returned sat
[2021-05-08 00:23:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:23:57] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2021-05-08 00:23:57] [INFO ] Computed and/alt/rep : 355/1545/355 causal constraints (skipped 1167 transitions) in 97 ms.
[2021-05-08 00:23:57] [INFO ] Added : 16 causal constraints over 4 iterations in 471 ms. Result :sat
Minimization took 395 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 106700 steps, including 2394 resets, run finished after 342 ms. (steps per millisecond=311 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 624/624 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 624 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 623 transition count 1562
Applied a total of 2 rules in 27 ms. Remains 623 /624 variables (removed 1) and now considering 1562/1563 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 623/624 places, 1562/1563 transitions.
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:23:58] [INFO ] Computed 57 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 16787 resets, run finished after 3165 ms. (steps per millisecond=315 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2804 resets, run finished after 935 ms. (steps per millisecond=1069 ) properties (out of 1) seen :0
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:24:02] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:24:02] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:24:02] [INFO ] [Real]Absence check using 13 positive and 44 generalized place invariants in 11 ms returned sat
[2021-05-08 00:24:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 00:24:02] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2021-05-08 00:24:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 00:24:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2021-05-08 00:24:03] [INFO ] [Nat]Absence check using 13 positive and 44 generalized place invariants in 12 ms returned sat
[2021-05-08 00:24:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 00:24:03] [INFO ] [Nat]Absence check using state equation in 931 ms returned sat
[2021-05-08 00:24:04] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 2 ms to minimize.
[2021-05-08 00:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 293 ms
[2021-05-08 00:24:04] [INFO ] Computed and/alt/rep : 354/1544/354 causal constraints (skipped 1167 transitions) in 85 ms.
[2021-05-08 00:24:04] [INFO ] Added : 16 causal constraints over 4 iterations in 380 ms. Result :sat
Minimization took 231 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 105400 steps, including 1003 resets, run finished after 289 ms. (steps per millisecond=364 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 623 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 623/623 places, 1562/1562 transitions.
Applied a total of 0 rules in 23 ms. Remains 623 /623 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 623/623 places, 1562/1562 transitions.
Starting structural reductions, iteration 0 : 623/623 places, 1562/1562 transitions.
Applied a total of 0 rules in 23 ms. Remains 623 /623 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:24:05] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:24:05] [INFO ] Implicit Places using invariants in 341 ms returned []
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:24:05] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:24:06] [INFO ] Implicit Places using invariants and state equation in 1022 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
[2021-05-08 00:24:06] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 1562 rows 623 cols
[2021-05-08 00:24:06] [INFO ] Computed 57 place invariants in 14 ms
[2021-05-08 00:24:07] [INFO ] Dead Transitions using invariants and state equation in 570 ms returned []
Finished structural reductions, in 1 iterations. Remains : 623/623 places, 1562/1562 transitions.
Ending property specific reduction for ASLink-PT-08b-UpperBounds-12 in 11623 ms.
[2021-05-08 00:24:07] [INFO ] Flatten gal took : 170 ms
[2021-05-08 00:24:07] [INFO ] Applying decomposition
[2021-05-08 00:24:07] [INFO ] Flatten gal took : 99 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1069776456884160139.txt, -o, /tmp/graph1069776456884160139.bin, -w, /tmp/graph1069776456884160139.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph1069776456884160139.bin, -l, -1, -v, -w, /tmp/graph1069776456884160139.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 00:24:08] [INFO ] Decomposing Gal with order
[2021-05-08 00:24:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 00:24:08] [INFO ] Removed a total of 3264 redundant transitions.
[2021-05-08 00:24:08] [INFO ] Flatten gal took : 187 ms
[2021-05-08 00:24:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 35 ms.
[2021-05-08 00:24:08] [INFO ] Time to serialize gal into /tmp/UpperBounds3617712326501694466.gal : 18 ms
[2021-05-08 00:24:08] [INFO ] Time to serialize properties into /tmp/UpperBounds12832719379362359352.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3617712326501694466.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds12832719379362359352.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3617712326501694466.gal -t CGAL -reachable-file /tmp/UpperBounds12832719379362359352.prop --nowitness
Loading property file /tmp/UpperBounds12832719379362359352.prop.
Detected timeout of ITS tools.
[2021-05-08 00:46:38] [INFO ] Applying decomposition
[2021-05-08 00:46:40] [INFO ] Flatten gal took : 2001 ms
[2021-05-08 00:46:40] [INFO ] Decomposing Gal with order
[2021-05-08 00:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 00:46:41] [INFO ] Removed a total of 2973 redundant transitions.
[2021-05-08 00:46:41] [INFO ] Flatten gal took : 415 ms
[2021-05-08 00:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1231 labels/synchronizations in 124 ms.
[2021-05-08 00:46:41] [INFO ] Time to serialize gal into /tmp/UpperBounds4748522643696701662.gal : 80 ms
[2021-05-08 00:46:41] [INFO ] Time to serialize properties into /tmp/UpperBounds9615287654934545474.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds4748522643696701662.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9615287654934545474.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds4748522643696701662.gal -t CGAL -reachable-file /tmp/UpperBounds9615287654934545474.prop --nowitness
Loading property file /tmp/UpperBounds9615287654934545474.prop.
Detected timeout of ITS tools.
[2021-05-08 01:09:07] [INFO ] Flatten gal took : 70 ms
[2021-05-08 01:09:07] [INFO ] Input system was already deterministic with 1563 transitions.
[2021-05-08 01:09:07] [INFO ] Transformed 624 places.
[2021-05-08 01:09:07] [INFO ] Transformed 1563 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-08 01:09:07] [INFO ] Time to serialize gal into /tmp/UpperBounds11415063943304906721.gal : 7 ms
[2021-05-08 01:09:07] [INFO ] Time to serialize properties into /tmp/UpperBounds14456566542189531180.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11415063943304906721.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds14456566542189531180.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11415063943304906721.gal -t CGAL -reachable-file /tmp/UpperBounds14456566542189531180.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds14456566542189531180.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-08b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="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-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-08b, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989600133"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-08b.tgz
mv ASLink-PT-08b execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;