About the Execution of ITS-Tools for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16221.271 | 3600000.00 | 2471782.00 | 717592.50 | 8 ? 7 ? 8 7 7 ? ? 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/mcc2022-input.r168-tall-165277016200093.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-7, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016200093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 283K Apr 30 10:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 30 10:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 861K Apr 30 09:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 168K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 481K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 122K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 417K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 27K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 59K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M May 10 09:34 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 Peterson-PT-7-UpperBounds-00
FORMULA_NAME Peterson-PT-7-UpperBounds-01
FORMULA_NAME Peterson-PT-7-UpperBounds-02
FORMULA_NAME Peterson-PT-7-UpperBounds-03
FORMULA_NAME Peterson-PT-7-UpperBounds-04
FORMULA_NAME Peterson-PT-7-UpperBounds-05
FORMULA_NAME Peterson-PT-7-UpperBounds-06
FORMULA_NAME Peterson-PT-7-UpperBounds-07
FORMULA_NAME Peterson-PT-7-UpperBounds-08
FORMULA_NAME Peterson-PT-7-UpperBounds-09
FORMULA_NAME Peterson-PT-7-UpperBounds-10
FORMULA_NAME Peterson-PT-7-UpperBounds-11
FORMULA_NAME Peterson-PT-7-UpperBounds-12
FORMULA_NAME Peterson-PT-7-UpperBounds-13
FORMULA_NAME Peterson-PT-7-UpperBounds-14
FORMULA_NAME Peterson-PT-7-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1652787664749
Running Version 202205111006
[2022-05-17 11:41:05] [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]
[2022-05-17 11:41:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 11:41:06] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2022-05-17 11:41:06] [INFO ] Transformed 1992 places.
[2022-05-17 11:41:06] [INFO ] Transformed 3096 transitions.
[2022-05-17 11:41:06] [INFO ] Found NUPN structural information;
[2022-05-17 11:41:06] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2022-05-17 11:41:06] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 294 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
FORMULA Peterson-PT-7-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 2760 out of 3096 initially.
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:41:06] [INFO ] Computed 31 place invariants in 50 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 212 ms. (steps per millisecond=47 ) properties (out of 11) seen :19
FORMULA Peterson-PT-7-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 8) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :13
[2022-05-17 11:41:06] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-05-17 11:41:06] [INFO ] Computed 31 place invariants in 22 ms
[2022-05-17 11:41:07] [INFO ] [Real]Absence check using 23 positive place invariants in 55 ms returned unsat
[2022-05-17 11:41:07] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 11:41:07] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 11:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:08] [INFO ] [Real]Absence check using state equation in 827 ms returned sat
[2022-05-17 11:41:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:41:09] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 11:41:09] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-05-17 11:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:09] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2022-05-17 11:41:09] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:41:10] [INFO ] [Nat]Added 497 Read/Feed constraints in 718 ms returned sat
[2022-05-17 11:41:11] [INFO ] Deduced a trap composed of 41 places in 971 ms of which 6 ms to minimize.
[2022-05-17 11:41:13] [INFO ] Deduced a trap composed of 13 places in 1054 ms of which 3 ms to minimize.
[2022-05-17 11:41:14] [INFO ] Deduced a trap composed of 16 places in 1092 ms of which 5 ms to minimize.
[2022-05-17 11:41:14] [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 1
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 11:41:14] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-05-17 11:41:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:15] [INFO ] [Real]Absence check using state equation in 825 ms returned sat
[2022-05-17 11:41:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:41:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 11:41:15] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:16] [INFO ] [Nat]Absence check using state equation in 854 ms returned sat
[2022-05-17 11:41:17] [INFO ] [Nat]Added 497 Read/Feed constraints in 504 ms returned sat
[2022-05-17 11:41:18] [INFO ] Deduced a trap composed of 13 places in 1002 ms of which 3 ms to minimize.
[2022-05-17 11:41:19] [INFO ] Deduced a trap composed of 13 places in 960 ms of which 6 ms to minimize.
[2022-05-17 11:41:20] [INFO ] Deduced a trap composed of 13 places in 964 ms of which 1 ms to minimize.
[2022-05-17 11:41:21] [INFO ] Deduced a trap composed of 28 places in 980 ms of which 2 ms to minimize.
[2022-05-17 11:41:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 11:41:21] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 11:41:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:22] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2022-05-17 11:41:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:41:22] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 11:41:22] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:23] [INFO ] [Nat]Absence check using state equation in 820 ms returned sat
[2022-05-17 11:41:24] [INFO ] [Nat]Added 497 Read/Feed constraints in 750 ms returned sat
[2022-05-17 11:41:25] [INFO ] Deduced a trap composed of 41 places in 983 ms of which 2 ms to minimize.
[2022-05-17 11:41:26] [INFO ] Deduced a trap composed of 13 places in 998 ms of which 2 ms to minimize.
[2022-05-17 11:41:27] [INFO ] Deduced a trap composed of 16 places in 964 ms of which 2 ms to minimize.
[2022-05-17 11:41:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 11:41:28] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 11:41:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:28] [INFO ] [Real]Absence check using state equation in 802 ms returned sat
[2022-05-17 11:41:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:41:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-05-17 11:41:29] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:30] [INFO ] [Nat]Absence check using state equation in 817 ms returned sat
[2022-05-17 11:41:30] [INFO ] [Nat]Added 497 Read/Feed constraints in 613 ms returned sat
[2022-05-17 11:41:31] [INFO ] Deduced a trap composed of 13 places in 920 ms of which 2 ms to minimize.
[2022-05-17 11:41:32] [INFO ] Deduced a trap composed of 122 places in 908 ms of which 3 ms to minimize.
[2022-05-17 11:41:33] [INFO ] Deduced a trap composed of 20 places in 924 ms of which 3 ms to minimize.
[2022-05-17 11:41:34] [INFO ] Deduced a trap composed of 21 places in 920 ms of which 1 ms to minimize.
[2022-05-17 11:41:34] [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 4
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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 11:41:35] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned sat
[2022-05-17 11:41:35] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:35] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2022-05-17 11:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:41:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-05-17 11:41:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:37] [INFO ] [Nat]Absence check using state equation in 780 ms returned sat
[2022-05-17 11:41:37] [INFO ] [Nat]Added 497 Read/Feed constraints in 115 ms returned sat
[2022-05-17 11:41:37] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 154 ms.
[2022-05-17 11:41:42] [INFO ] Deduced a trap composed of 2 places in 1278 ms of which 2 ms to minimize.
[2022-05-17 11:41:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-17 11:41:42] [INFO ] [Real]Absence check using 23 positive place invariants in 33 ms returned sat
[2022-05-17 11:41:42] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 11:41:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:43] [INFO ] [Real]Absence check using state equation in 771 ms returned sat
[2022-05-17 11:41:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:41:43] [INFO ] [Nat]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-05-17 11:41:43] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:44] [INFO ] [Nat]Absence check using state equation in 783 ms returned sat
[2022-05-17 11:41:44] [INFO ] [Nat]Added 497 Read/Feed constraints in 60 ms returned sat
[2022-05-17 11:41:44] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 170 ms.
[2022-05-17 11:41:45] [INFO ] Added : 16 causal constraints over 4 iterations in 869 ms. Result :sat
Minimization took 205 ms.
[2022-05-17 11:41:46] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-05-17 11:41:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 11:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:46] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2022-05-17 11:41:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:41:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-05-17 11:41:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:41:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:41:48] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2022-05-17 11:41:48] [INFO ] [Nat]Added 497 Read/Feed constraints in 77 ms returned sat
[2022-05-17 11:41:48] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 128 ms.
[2022-05-17 11:41:53] [INFO ] Deduced a trap composed of 2 places in 1248 ms of which 1 ms to minimize.
[2022-05-17 11:41:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [8, 448, 56, 448, 8, 1, 1, 1] Max seen :[8, 2, 7, 2, 1, 0, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-00 8 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-7-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 513 out of 1992 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions removed 391 transitions
Trivial Post-agglo rules discarded 391 transitions
Performed 391 trivial Post agglomeration. Transition count delta: 391
Iterating post reduction 0 with 391 rules applied. Total rules applied 391 place count 1992 transition count 2705
Reduce places removed 391 places and 0 transitions.
Performed 391 Post agglomeration using F-continuation condition.Transition count delta: 391
Iterating post reduction 1 with 782 rules applied. Total rules applied 1173 place count 1601 transition count 2314
Reduce places removed 391 places and 0 transitions.
Iterating post reduction 2 with 391 rules applied. Total rules applied 1564 place count 1210 transition count 2314
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 1564 place count 1210 transition count 2258
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 1676 place count 1154 transition count 2258
Applied a total of 1676 rules in 285 ms. Remains 1154 /1992 variables (removed 838) and now considering 2258/3096 (removed 838) transitions.
Finished structural reductions, in 1 iterations. Remains : 1154/1992 places, 2258/3096 transitions.
Normalized transition count is 1922 out of 2258 initially.
// Phase 1: matrix 1922 rows 1154 cols
[2022-05-17 11:41:53] [INFO ] Computed 31 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12480 ms. (steps per millisecond=80 ) properties (out of 6) seen :18
Interrupted Best-First random walk after 754976 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=150 ) properties seen 9
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2213 ms. (steps per millisecond=451 ) properties (out of 6) seen :9
Interrupted Best-First random walk after 795215 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=159 ) properties seen 8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1762 ms. (steps per millisecond=567 ) properties (out of 6) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1739 ms. (steps per millisecond=575 ) properties (out of 6) seen :16
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1731 ms. (steps per millisecond=577 ) properties (out of 6) seen :16
[2022-05-17 11:42:23] [INFO ] Flow matrix only has 1922 transitions (discarded 336 similar events)
// Phase 1: matrix 1922 rows 1154 cols
[2022-05-17 11:42:23] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 11:42:23] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:42:23] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:42:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:24] [INFO ] [Real]Absence check using state equation in 459 ms returned sat
[2022-05-17 11:42:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:42:24] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2022-05-17 11:42:24] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 11:42:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:25] [INFO ] [Nat]Absence check using state equation in 433 ms returned sat
[2022-05-17 11:42:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:42:25] [INFO ] [Nat]Added 497 Read/Feed constraints in 242 ms returned sat
[2022-05-17 11:42:26] [INFO ] Deduced a trap composed of 31 places in 525 ms of which 1 ms to minimize.
[2022-05-17 11:42:26] [INFO ] Deduced a trap composed of 54 places in 486 ms of which 1 ms to minimize.
[2022-05-17 11:42:27] [INFO ] Deduced a trap composed of 65 places in 501 ms of which 1 ms to minimize.
[2022-05-17 11:42:27] [INFO ] Deduced a trap composed of 15 places in 510 ms of which 1 ms to minimize.
[2022-05-17 11:42:28] [INFO ] Deduced a trap composed of 83 places in 407 ms of which 1 ms to minimize.
[2022-05-17 11:42:28] [INFO ] Deduced a trap composed of 61 places in 413 ms of which 1 ms to minimize.
[2022-05-17 11:42:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3358 ms
[2022-05-17 11:42:28] [INFO ] Computed and/alt/rep : 1802/5002/1802 causal constraints (skipped 112 transitions) in 91 ms.
[2022-05-17 11:42:32] [INFO ] Deduced a trap composed of 15 places in 487 ms of which 1 ms to minimize.
[2022-05-17 11:42:33] [INFO ] Deduced a trap composed of 159 places in 399 ms of which 1 ms to minimize.
[2022-05-17 11:42:33] [INFO ] Deduced a trap composed of 55 places in 402 ms of which 1 ms to minimize.
[2022-05-17 11:42:34] [INFO ] Deduced a trap composed of 83 places in 356 ms of which 1 ms to minimize.
[2022-05-17 11:42:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2104 ms
[2022-05-17 11:42:34] [INFO ] Added : 135 causal constraints over 28 iterations in 5787 ms. Result :sat
Minimization took 672 ms.
[2022-05-17 11:42:35] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:42:35] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:42:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:36] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2022-05-17 11:42:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:42:36] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:42:36] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:42:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:36] [INFO ] [Nat]Absence check using state equation in 431 ms returned sat
[2022-05-17 11:42:36] [INFO ] [Nat]Added 497 Read/Feed constraints in 195 ms returned sat
[2022-05-17 11:42:37] [INFO ] Deduced a trap composed of 17 places in 433 ms of which 1 ms to minimize.
[2022-05-17 11:42:37] [INFO ] Deduced a trap composed of 19 places in 432 ms of which 1 ms to minimize.
[2022-05-17 11:42:38] [INFO ] Deduced a trap composed of 19 places in 431 ms of which 1 ms to minimize.
[2022-05-17 11:42:38] [INFO ] Deduced a trap composed of 19 places in 437 ms of which 1 ms to minimize.
[2022-05-17 11:42:39] [INFO ] Deduced a trap composed of 11 places in 441 ms of which 1 ms to minimize.
[2022-05-17 11:42:39] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 1 ms to minimize.
[2022-05-17 11:42:40] [INFO ] Deduced a trap composed of 17 places in 446 ms of which 1 ms to minimize.
[2022-05-17 11:42:40] [INFO ] Deduced a trap composed of 11 places in 448 ms of which 1 ms to minimize.
[2022-05-17 11:42:40] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 4027 ms
[2022-05-17 11:42:41] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 11:42:41] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:42:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:41] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2022-05-17 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:42:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2022-05-17 11:42:42] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:42:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:42] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2022-05-17 11:42:42] [INFO ] [Nat]Added 497 Read/Feed constraints in 232 ms returned sat
[2022-05-17 11:42:43] [INFO ] Deduced a trap composed of 31 places in 509 ms of which 4 ms to minimize.
[2022-05-17 11:42:43] [INFO ] Deduced a trap composed of 54 places in 487 ms of which 1 ms to minimize.
[2022-05-17 11:42:44] [INFO ] Deduced a trap composed of 65 places in 486 ms of which 1 ms to minimize.
[2022-05-17 11:42:44] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2022-05-17 11:42:45] [INFO ] Deduced a trap composed of 83 places in 419 ms of which 1 ms to minimize.
[2022-05-17 11:42:45] [INFO ] Deduced a trap composed of 61 places in 397 ms of which 0 ms to minimize.
[2022-05-17 11:42:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3343 ms
[2022-05-17 11:42:46] [INFO ] Computed and/alt/rep : 1802/5002/1802 causal constraints (skipped 112 transitions) in 109 ms.
[2022-05-17 11:42:49] [INFO ] Deduced a trap composed of 15 places in 471 ms of which 1 ms to minimize.
[2022-05-17 11:42:50] [INFO ] Deduced a trap composed of 159 places in 398 ms of which 1 ms to minimize.
[2022-05-17 11:42:50] [INFO ] Deduced a trap composed of 55 places in 394 ms of which 1 ms to minimize.
[2022-05-17 11:42:51] [INFO ] Deduced a trap composed of 83 places in 358 ms of which 1 ms to minimize.
[2022-05-17 11:42:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2111 ms
[2022-05-17 11:42:51] [INFO ] Added : 135 causal constraints over 28 iterations in 5739 ms. Result :sat
Minimization took 663 ms.
[2022-05-17 11:42:52] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:42:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:53] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2022-05-17 11:42:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:42:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:42:53] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:42:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:42:53] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2022-05-17 11:42:53] [INFO ] [Nat]Added 497 Read/Feed constraints in 143 ms returned sat
[2022-05-17 11:42:54] [INFO ] Deduced a trap composed of 14 places in 389 ms of which 0 ms to minimize.
[2022-05-17 11:42:54] [INFO ] Deduced a trap composed of 13 places in 399 ms of which 1 ms to minimize.
[2022-05-17 11:42:55] [INFO ] Deduced a trap composed of 51 places in 403 ms of which 1 ms to minimize.
[2022-05-17 11:42:55] [INFO ] Deduced a trap composed of 50 places in 407 ms of which 1 ms to minimize.
[2022-05-17 11:42:56] [INFO ] Deduced a trap composed of 74 places in 413 ms of which 1 ms to minimize.
[2022-05-17 11:42:56] [INFO ] Deduced a trap composed of 74 places in 398 ms of which 1 ms to minimize.
[2022-05-17 11:42:57] [INFO ] Deduced a trap composed of 32 places in 402 ms of which 1 ms to minimize.
[2022-05-17 11:42:57] [INFO ] Deduced a trap composed of 51 places in 394 ms of which 1 ms to minimize.
[2022-05-17 11:42:58] [INFO ] Deduced a trap composed of 89 places in 400 ms of which 1 ms to minimize.
[2022-05-17 11:42:58] [INFO ] Deduced a trap composed of 89 places in 390 ms of which 0 ms to minimize.
[2022-05-17 11:42:59] [INFO ] Deduced a trap composed of 129 places in 412 ms of which 1 ms to minimize.
[2022-05-17 11:42:59] [INFO ] Deduced a trap composed of 15 places in 398 ms of which 1 ms to minimize.
[2022-05-17 11:43:00] [INFO ] Deduced a trap composed of 129 places in 398 ms of which 3 ms to minimize.
[2022-05-17 11:43:00] [INFO ] Deduced a trap composed of 127 places in 384 ms of which 1 ms to minimize.
[2022-05-17 11:43:01] [INFO ] Deduced a trap composed of 151 places in 384 ms of which 1 ms to minimize.
[2022-05-17 11:43:01] [INFO ] Deduced a trap composed of 13 places in 408 ms of which 1 ms to minimize.
[2022-05-17 11:43:02] [INFO ] Deduced a trap composed of 42 places in 389 ms of which 1 ms to minimize.
[2022-05-17 11:43:02] [INFO ] Deduced a trap composed of 32 places in 385 ms of which 1 ms to minimize.
[2022-05-17 11:43:02] [INFO ] Deduced a trap composed of 32 places in 380 ms of which 1 ms to minimize.
[2022-05-17 11:43:03] [INFO ] Deduced a trap composed of 108 places in 380 ms of which 1 ms to minimize.
[2022-05-17 11:43:03] [INFO ] Deduced a trap composed of 139 places in 348 ms of which 1 ms to minimize.
[2022-05-17 11:43:04] [INFO ] Deduced a trap composed of 61 places in 350 ms of which 2 ms to minimize.
[2022-05-17 11:43:04] [INFO ] Deduced a trap composed of 51 places in 353 ms of which 1 ms to minimize.
[2022-05-17 11:43:05] [INFO ] Deduced a trap composed of 108 places in 395 ms of which 9 ms to minimize.
[2022-05-17 11:43:05] [INFO ] Deduced a trap composed of 127 places in 373 ms of which 1 ms to minimize.
[2022-05-17 11:43:06] [INFO ] Deduced a trap composed of 19 places in 401 ms of which 1 ms to minimize.
[2022-05-17 11:43:06] [INFO ] Deduced a trap composed of 110 places in 410 ms of which 1 ms to minimize.
[2022-05-17 11:43:07] [INFO ] Deduced a trap composed of 15 places in 422 ms of which 1 ms to minimize.
[2022-05-17 11:43:07] [INFO ] Deduced a trap composed of 42 places in 391 ms of which 1 ms to minimize.
[2022-05-17 11:43:08] [INFO ] Deduced a trap composed of 42 places in 396 ms of which 1 ms to minimize.
[2022-05-17 11:43:08] [INFO ] Deduced a trap composed of 53 places in 381 ms of which 1 ms to minimize.
[2022-05-17 11:43:09] [INFO ] Deduced a trap composed of 34 places in 380 ms of which 1 ms to minimize.
[2022-05-17 11:43:10] [INFO ] Deduced a trap composed of 91 places in 370 ms of which 0 ms to minimize.
[2022-05-17 11:43:10] [INFO ] Deduced a trap composed of 72 places in 373 ms of which 0 ms to minimize.
[2022-05-17 11:43:11] [INFO ] Deduced a trap composed of 72 places in 379 ms of which 1 ms to minimize.
[2022-05-17 11:43:11] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 1 ms to minimize.
[2022-05-17 11:43:11] [INFO ] Deduced a trap composed of 73 places in 366 ms of which 1 ms to minimize.
[2022-05-17 11:43:12] [INFO ] Deduced a trap composed of 53 places in 359 ms of which 1 ms to minimize.
[2022-05-17 11:43:15] [INFO ] Trap strengthening (SAT) tested/added 38/38 trap constraints in 21369 ms
[2022-05-17 11:43:15] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:43:15] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 12 ms returned sat
[2022-05-17 11:43:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:43:15] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2022-05-17 11:43:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:43:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:43:16] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-05-17 11:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:43:16] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2022-05-17 11:43:16] [INFO ] [Nat]Added 497 Read/Feed constraints in 75 ms returned sat
[2022-05-17 11:43:16] [INFO ] Computed and/alt/rep : 1802/5002/1802 causal constraints (skipped 112 transitions) in 87 ms.
[2022-05-17 11:43:19] [INFO ] Deduced a trap composed of 15 places in 441 ms of which 1 ms to minimize.
[2022-05-17 11:43:19] [INFO ] Deduced a trap composed of 17 places in 432 ms of which 1 ms to minimize.
[2022-05-17 11:43:20] [INFO ] Deduced a trap composed of 45 places in 392 ms of which 0 ms to minimize.
[2022-05-17 11:43:20] [INFO ] Deduced a trap composed of 74 places in 335 ms of which 1 ms to minimize.
[2022-05-17 11:43:21] [INFO ] Deduced a trap composed of 57 places in 366 ms of which 1 ms to minimize.
[2022-05-17 11:43:21] [INFO ] Deduced a trap composed of 80 places in 397 ms of which 1 ms to minimize.
[2022-05-17 11:43:22] [INFO ] Deduced a trap composed of 38 places in 354 ms of which 1 ms to minimize.
[2022-05-17 11:43:22] [INFO ] Deduced a trap composed of 191 places in 337 ms of which 1 ms to minimize.
[2022-05-17 11:43:23] [INFO ] Deduced a trap composed of 53 places in 356 ms of which 1 ms to minimize.
[2022-05-17 11:43:23] [INFO ] Deduced a trap composed of 36 places in 342 ms of which 0 ms to minimize.
[2022-05-17 11:43:23] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4884 ms
[2022-05-17 11:43:24] [INFO ] Added : 106 causal constraints over 25 iterations in 7741 ms. Result :sat
Minimization took 302 ms.
[2022-05-17 11:43:25] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:43:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:43:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:43:25] [INFO ] [Real]Absence check using state equation in 438 ms returned sat
[2022-05-17 11:43:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:43:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:43:25] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 11:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:43:26] [INFO ] [Nat]Absence check using state equation in 436 ms returned sat
[2022-05-17 11:43:26] [INFO ] [Nat]Added 497 Read/Feed constraints in 85 ms returned sat
[2022-05-17 11:43:26] [INFO ] Computed and/alt/rep : 1802/5002/1802 causal constraints (skipped 112 transitions) in 90 ms.
[2022-05-17 11:43:28] [INFO ] Deduced a trap composed of 13 places in 420 ms of which 1 ms to minimize.
[2022-05-17 11:43:29] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2022-05-17 11:43:29] [INFO ] Deduced a trap composed of 44 places in 341 ms of which 1 ms to minimize.
[2022-05-17 11:43:30] [INFO ] Deduced a trap composed of 42 places in 339 ms of which 1 ms to minimize.
[2022-05-17 11:43:30] [INFO ] Deduced a trap composed of 42 places in 362 ms of which 1 ms to minimize.
[2022-05-17 11:43:30] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2445 ms
[2022-05-17 11:43:30] [INFO ] Added : 98 causal constraints over 20 iterations in 4626 ms. Result :sat
Minimization took 330 ms.
Current structural bounds on expressions (after SMT) : [448, 7, 448, 8, 1, 1] Max seen :[6, 7, 6, 1, 0, 0]
FORMULA Peterson-PT-7-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 457 out of 1154 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1154/1154 places, 2258/2258 transitions.
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 48 Pre rules applied. Total rules applied 0 place count 1154 transition count 2210
Deduced a syphon composed of 48 places in 9 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 1106 transition count 2210
Applied a total of 96 rules in 98 ms. Remains 1106 /1154 variables (removed 48) and now considering 2210/2258 (removed 48) transitions.
Finished structural reductions, in 1 iterations. Remains : 1106/1154 places, 2210/2258 transitions.
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1106 cols
[2022-05-17 11:43:44] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11692 ms. (steps per millisecond=85 ) properties (out of 5) seen :13
Interrupted Best-First random walk after 841952 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=168 ) properties seen 7
Interrupted Best-First random walk after 818228 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=163 ) properties seen 15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1727 ms. (steps per millisecond=579 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1675 ms. (steps per millisecond=597 ) properties (out of 5) seen :11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1675 ms. (steps per millisecond=597 ) properties (out of 5) seen :13
[2022-05-17 11:44:11] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1106 cols
[2022-05-17 11:44:11] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-17 11:44:11] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:44:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:44:12] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2022-05-17 11:44:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:44:12] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:44:12] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:44:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:44:13] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2022-05-17 11:44:13] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:44:13] [INFO ] [Nat]Added 497 Read/Feed constraints in 211 ms returned sat
[2022-05-17 11:44:13] [INFO ] Deduced a trap composed of 17 places in 506 ms of which 1 ms to minimize.
[2022-05-17 11:44:14] [INFO ] Deduced a trap composed of 17 places in 488 ms of which 1 ms to minimize.
[2022-05-17 11:44:15] [INFO ] Deduced a trap composed of 11 places in 500 ms of which 0 ms to minimize.
[2022-05-17 11:44:15] [INFO ] Deduced a trap composed of 11 places in 493 ms of which 1 ms to minimize.
[2022-05-17 11:44:16] [INFO ] Deduced a trap composed of 15 places in 485 ms of which 1 ms to minimize.
[2022-05-17 11:44:16] [INFO ] Deduced a trap composed of 33 places in 505 ms of which 1 ms to minimize.
[2022-05-17 11:44:17] [INFO ] Deduced a trap composed of 31 places in 484 ms of which 1 ms to minimize.
[2022-05-17 11:44:17] [INFO ] Deduced a trap composed of 31 places in 485 ms of which 1 ms to minimize.
[2022-05-17 11:44:18] [INFO ] Deduced a trap composed of 76 places in 504 ms of which 1 ms to minimize.
[2022-05-17 11:44:18] [INFO ] Deduced a trap composed of 13 places in 482 ms of which 1 ms to minimize.
[2022-05-17 11:44:19] [INFO ] Deduced a trap composed of 23 places in 498 ms of which 1 ms to minimize.
[2022-05-17 11:44:20] [INFO ] Deduced a trap composed of 39 places in 465 ms of which 1 ms to minimize.
[2022-05-17 11:44:20] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 1 ms to minimize.
[2022-05-17 11:44:21] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 1 ms to minimize.
[2022-05-17 11:44:21] [INFO ] Deduced a trap composed of 91 places in 469 ms of which 1 ms to minimize.
[2022-05-17 11:44:22] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 1 ms to minimize.
[2022-05-17 11:44:22] [INFO ] Deduced a trap composed of 59 places in 398 ms of which 1 ms to minimize.
[2022-05-17 11:44:23] [INFO ] Deduced a trap composed of 53 places in 392 ms of which 0 ms to minimize.
[2022-05-17 11:44:23] [INFO ] Deduced a trap composed of 49 places in 423 ms of which 1 ms to minimize.
[2022-05-17 11:44:23] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 10515 ms
[2022-05-17 11:44:23] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 87 ms.
[2022-05-17 11:44:29] [INFO ] Deduced a trap composed of 25 places in 493 ms of which 1 ms to minimize.
[2022-05-17 11:44:30] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 1 ms to minimize.
[2022-05-17 11:44:30] [INFO ] Deduced a trap composed of 35 places in 447 ms of which 3 ms to minimize.
[2022-05-17 11:44:31] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 0 ms to minimize.
[2022-05-17 11:44:31] [INFO ] Deduced a trap composed of 31 places in 454 ms of which 1 ms to minimize.
[2022-05-17 11:44:32] [INFO ] Deduced a trap composed of 31 places in 449 ms of which 1 ms to minimize.
[2022-05-17 11:44:32] [INFO ] Deduced a trap composed of 65 places in 443 ms of which 1 ms to minimize.
[2022-05-17 11:44:33] [INFO ] Deduced a trap composed of 65 places in 442 ms of which 1 ms to minimize.
[2022-05-17 11:44:33] [INFO ] Deduced a trap composed of 65 places in 447 ms of which 1 ms to minimize.
[2022-05-17 11:44:34] [INFO ] Deduced a trap composed of 31 places in 357 ms of which 0 ms to minimize.
[2022-05-17 11:44:35] [INFO ] Deduced a trap composed of 71 places in 308 ms of which 1 ms to minimize.
[2022-05-17 11:44:35] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 1 ms to minimize.
[2022-05-17 11:44:35] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6780 ms
[2022-05-17 11:44:36] [INFO ] Added : 271 causal constraints over 55 iterations in 12500 ms. Result :sat
Minimization took 556 ms.
[2022-05-17 11:44:37] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:44:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:44:37] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2022-05-17 11:44:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:44:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:44:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 11:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:44:38] [INFO ] [Nat]Absence check using state equation in 429 ms returned sat
[2022-05-17 11:44:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 208 ms returned sat
[2022-05-17 11:44:39] [INFO ] Deduced a trap composed of 17 places in 491 ms of which 1 ms to minimize.
[2022-05-17 11:44:39] [INFO ] Deduced a trap composed of 17 places in 492 ms of which 1 ms to minimize.
[2022-05-17 11:44:40] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 1 ms to minimize.
[2022-05-17 11:44:40] [INFO ] Deduced a trap composed of 11 places in 493 ms of which 1 ms to minimize.
[2022-05-17 11:44:41] [INFO ] Deduced a trap composed of 15 places in 481 ms of which 0 ms to minimize.
[2022-05-17 11:44:42] [INFO ] Deduced a trap composed of 33 places in 496 ms of which 1 ms to minimize.
[2022-05-17 11:44:42] [INFO ] Deduced a trap composed of 31 places in 504 ms of which 1 ms to minimize.
[2022-05-17 11:44:43] [INFO ] Deduced a trap composed of 31 places in 476 ms of which 1 ms to minimize.
[2022-05-17 11:44:43] [INFO ] Deduced a trap composed of 76 places in 490 ms of which 1 ms to minimize.
[2022-05-17 11:44:44] [INFO ] Deduced a trap composed of 13 places in 470 ms of which 1 ms to minimize.
[2022-05-17 11:44:44] [INFO ] Deduced a trap composed of 23 places in 484 ms of which 1 ms to minimize.
[2022-05-17 11:44:45] [INFO ] Deduced a trap composed of 39 places in 441 ms of which 1 ms to minimize.
[2022-05-17 11:44:45] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 1 ms to minimize.
[2022-05-17 11:44:46] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2022-05-17 11:44:46] [INFO ] Deduced a trap composed of 91 places in 436 ms of which 1 ms to minimize.
[2022-05-17 11:44:47] [INFO ] Deduced a trap composed of 11 places in 447 ms of which 1 ms to minimize.
[2022-05-17 11:44:47] [INFO ] Deduced a trap composed of 59 places in 386 ms of which 1 ms to minimize.
[2022-05-17 11:44:48] [INFO ] Deduced a trap composed of 53 places in 394 ms of which 1 ms to minimize.
[2022-05-17 11:44:48] [INFO ] Deduced a trap composed of 49 places in 390 ms of which 0 ms to minimize.
[2022-05-17 11:44:48] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 10285 ms
[2022-05-17 11:44:49] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 90 ms.
[2022-05-17 11:44:54] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 1 ms to minimize.
[2022-05-17 11:44:55] [INFO ] Deduced a trap composed of 11 places in 496 ms of which 1 ms to minimize.
[2022-05-17 11:44:55] [INFO ] Deduced a trap composed of 35 places in 438 ms of which 1 ms to minimize.
[2022-05-17 11:44:56] [INFO ] Deduced a trap composed of 33 places in 443 ms of which 1 ms to minimize.
[2022-05-17 11:44:56] [INFO ] Deduced a trap composed of 31 places in 468 ms of which 1 ms to minimize.
[2022-05-17 11:44:57] [INFO ] Deduced a trap composed of 31 places in 463 ms of which 1 ms to minimize.
[2022-05-17 11:44:58] [INFO ] Deduced a trap composed of 65 places in 425 ms of which 1 ms to minimize.
[2022-05-17 11:44:58] [INFO ] Deduced a trap composed of 65 places in 469 ms of which 1 ms to minimize.
[2022-05-17 11:44:59] [INFO ] Deduced a trap composed of 65 places in 457 ms of which 0 ms to minimize.
[2022-05-17 11:45:00] [INFO ] Deduced a trap composed of 31 places in 381 ms of which 0 ms to minimize.
[2022-05-17 11:45:00] [INFO ] Deduced a trap composed of 71 places in 329 ms of which 1 ms to minimize.
[2022-05-17 11:45:00] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 1 ms to minimize.
[2022-05-17 11:45:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6943 ms
[2022-05-17 11:45:01] [INFO ] Added : 271 causal constraints over 55 iterations in 12685 ms. Result :sat
Minimization took 557 ms.
[2022-05-17 11:45:02] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 11:45:02] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:45:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:45:02] [INFO ] [Real]Absence check using state equation in 415 ms returned sat
[2022-05-17 11:45:02] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:45:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:45:03] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-17 11:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:45:03] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-17 11:45:03] [INFO ] [Nat]Added 497 Read/Feed constraints in 206 ms returned sat
[2022-05-17 11:45:04] [INFO ] Deduced a trap composed of 57 places in 383 ms of which 0 ms to minimize.
[2022-05-17 11:45:04] [INFO ] Deduced a trap composed of 15 places in 410 ms of which 1 ms to minimize.
[2022-05-17 11:45:05] [INFO ] Deduced a trap composed of 13 places in 383 ms of which 1 ms to minimize.
[2022-05-17 11:45:05] [INFO ] Deduced a trap composed of 13 places in 385 ms of which 1 ms to minimize.
[2022-05-17 11:45:05] [INFO ] Deduced a trap composed of 13 places in 402 ms of which 1 ms to minimize.
[2022-05-17 11:45:06] [INFO ] Deduced a trap composed of 77 places in 367 ms of which 1 ms to minimize.
[2022-05-17 11:45:06] [INFO ] Deduced a trap composed of 51 places in 360 ms of which 0 ms to minimize.
[2022-05-17 11:45:07] [INFO ] Deduced a trap composed of 31 places in 374 ms of which 1 ms to minimize.
[2022-05-17 11:45:07] [INFO ] Deduced a trap composed of 33 places in 370 ms of which 1 ms to minimize.
[2022-05-17 11:45:08] [INFO ] Deduced a trap composed of 65 places in 366 ms of which 0 ms to minimize.
[2022-05-17 11:45:08] [INFO ] Deduced a trap composed of 67 places in 378 ms of which 1 ms to minimize.
[2022-05-17 11:45:08] [INFO ] Deduced a trap composed of 33 places in 374 ms of which 0 ms to minimize.
[2022-05-17 11:45:09] [INFO ] Deduced a trap composed of 105 places in 401 ms of which 1 ms to minimize.
[2022-05-17 11:45:09] [INFO ] Deduced a trap composed of 15 places in 403 ms of which 1 ms to minimize.
[2022-05-17 11:45:10] [INFO ] Deduced a trap composed of 49 places in 359 ms of which 1 ms to minimize.
[2022-05-17 11:45:10] [INFO ] Deduced a trap composed of 85 places in 367 ms of which 0 ms to minimize.
[2022-05-17 11:45:11] [INFO ] Deduced a trap composed of 49 places in 352 ms of which 0 ms to minimize.
[2022-05-17 11:45:11] [INFO ] Deduced a trap composed of 87 places in 377 ms of which 1 ms to minimize.
[2022-05-17 11:45:12] [INFO ] Deduced a trap composed of 33 places in 369 ms of which 1 ms to minimize.
[2022-05-17 11:45:12] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 1 ms to minimize.
[2022-05-17 11:45:13] [INFO ] Deduced a trap composed of 87 places in 396 ms of which 0 ms to minimize.
[2022-05-17 11:45:13] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 1 ms to minimize.
[2022-05-17 11:45:14] [INFO ] Deduced a trap composed of 49 places in 373 ms of which 1 ms to minimize.
[2022-05-17 11:45:14] [INFO ] Deduced a trap composed of 31 places in 362 ms of which 1 ms to minimize.
[2022-05-17 11:45:15] [INFO ] Deduced a trap composed of 41 places in 379 ms of which 1 ms to minimize.
[2022-05-17 11:45:15] [INFO ] Deduced a trap composed of 77 places in 377 ms of which 1 ms to minimize.
[2022-05-17 11:45:16] [INFO ] Deduced a trap composed of 33 places in 377 ms of which 0 ms to minimize.
[2022-05-17 11:45:16] [INFO ] Deduced a trap composed of 66 places in 373 ms of which 1 ms to minimize.
[2022-05-17 11:45:16] [INFO ] Deduced a trap composed of 77 places in 383 ms of which 1 ms to minimize.
[2022-05-17 11:45:17] [INFO ] Deduced a trap composed of 59 places in 391 ms of which 1 ms to minimize.
[2022-05-17 11:45:18] [INFO ] Deduced a trap composed of 15 places in 382 ms of which 1 ms to minimize.
[2022-05-17 11:45:18] [INFO ] Deduced a trap composed of 21 places in 371 ms of which 1 ms to minimize.
[2022-05-17 11:45:19] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 0 ms to minimize.
[2022-05-17 11:45:19] [INFO ] Deduced a trap composed of 21 places in 378 ms of which 1 ms to minimize.
[2022-05-17 11:45:19] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 1 ms to minimize.
[2022-05-17 11:45:22] [INFO ] Deduced a trap composed of 51 places in 385 ms of which 1 ms to minimize.
[2022-05-17 11:45:22] [INFO ] Deduced a trap composed of 97 places in 361 ms of which 1 ms to minimize.
[2022-05-17 11:45:23] [INFO ] Deduced a trap composed of 33 places in 375 ms of which 1 ms to minimize.
[2022-05-17 11:45:25] [INFO ] Deduced a trap composed of 39 places in 386 ms of which 0 ms to minimize.
[2022-05-17 11:45:28] [INFO ] Trap strengthening (SAT) tested/added 39/39 trap constraints in 24654 ms
[2022-05-17 11:45:28] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:45:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-05-17 11:45:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:45:28] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-05-17 11:45:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:45:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:45:29] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-17 11:45:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:45:29] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2022-05-17 11:45:29] [INFO ] [Nat]Added 497 Read/Feed constraints in 42 ms returned sat
[2022-05-17 11:45:29] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 84 ms.
[2022-05-17 11:45:32] [INFO ] Deduced a trap composed of 41 places in 415 ms of which 1 ms to minimize.
[2022-05-17 11:45:33] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2022-05-17 11:45:33] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 1 ms to minimize.
[2022-05-17 11:45:34] [INFO ] Deduced a trap composed of 104 places in 373 ms of which 1 ms to minimize.
[2022-05-17 11:45:34] [INFO ] Deduced a trap composed of 51 places in 377 ms of which 1 ms to minimize.
[2022-05-17 11:45:35] [INFO ] Deduced a trap composed of 51 places in 363 ms of which 1 ms to minimize.
[2022-05-17 11:45:35] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 0 ms to minimize.
[2022-05-17 11:45:36] [INFO ] Deduced a trap composed of 33 places in 352 ms of which 1 ms to minimize.
[2022-05-17 11:45:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 3919 ms
[2022-05-17 11:45:37] [INFO ] Added : 159 causal constraints over 34 iterations in 7352 ms. Result :sat
Minimization took 280 ms.
[2022-05-17 11:45:37] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:45:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:45:37] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2022-05-17 11:45:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:45:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:45:38] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-05-17 11:45:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:45:38] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2022-05-17 11:45:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 35 ms returned sat
[2022-05-17 11:45:38] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 87 ms.
[2022-05-17 11:45:40] [INFO ] Deduced a trap composed of 25 places in 356 ms of which 0 ms to minimize.
[2022-05-17 11:45:40] [INFO ] Deduced a trap composed of 23 places in 365 ms of which 1 ms to minimize.
[2022-05-17 11:45:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 994 ms
[2022-05-17 11:45:41] [INFO ] Added : 71 causal constraints over 15 iterations in 2729 ms. Result :sat
Minimization took 256 ms.
Current structural bounds on expressions (after SMT) : [448, 448, 8, 1, 1] Max seen :[7, 7, 1, 0, 0]
Support contains 457 out of 1106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1106/1106 places, 2210/2210 transitions.
Applied a total of 0 rules in 55 ms. Remains 1106 /1106 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1106/1106 places, 2210/2210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1106/1106 places, 2210/2210 transitions.
Applied a total of 0 rules in 36 ms. Remains 1106 /1106 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
[2022-05-17 11:45:47] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1106 cols
[2022-05-17 11:45:47] [INFO ] Computed 31 place invariants in 7 ms
[2022-05-17 11:45:47] [INFO ] Implicit Places using invariants in 587 ms returned [1090, 1091, 1092, 1093, 1094, 1103, 1104, 1105]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 590 ms to find 8 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 1098/1106 places, 2210/2210 transitions.
Applied a total of 0 rules in 30 ms. Remains 1098 /1098 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1098/1106 places, 2210/2210 transitions.
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:45:47] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 11784 ms. (steps per millisecond=84 ) properties (out of 5) seen :13
Interrupted Best-First random walk after 834509 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 6
Interrupted Best-First random walk after 834671 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=166 ) properties seen 6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1740 ms. (steps per millisecond=574 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1672 ms. (steps per millisecond=598 ) properties (out of 5) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1662 ms. (steps per millisecond=601 ) properties (out of 5) seen :13
[2022-05-17 11:46:14] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:46:14] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 11:46:14] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:46:15] [INFO ] [Real]Absence check using state equation in 426 ms returned sat
[2022-05-17 11:46:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:46:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2022-05-17 11:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:46:16] [INFO ] [Nat]Absence check using state equation in 419 ms returned sat
[2022-05-17 11:46:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:46:16] [INFO ] [Nat]Added 497 Read/Feed constraints in 243 ms returned sat
[2022-05-17 11:46:16] [INFO ] Deduced a trap composed of 15 places in 507 ms of which 1 ms to minimize.
[2022-05-17 11:46:17] [INFO ] Deduced a trap composed of 11 places in 506 ms of which 0 ms to minimize.
[2022-05-17 11:46:18] [INFO ] Deduced a trap composed of 43 places in 507 ms of which 1 ms to minimize.
[2022-05-17 11:46:18] [INFO ] Deduced a trap composed of 21 places in 504 ms of which 1 ms to minimize.
[2022-05-17 11:46:19] [INFO ] Deduced a trap composed of 15 places in 499 ms of which 1 ms to minimize.
[2022-05-17 11:46:19] [INFO ] Deduced a trap composed of 15 places in 506 ms of which 1 ms to minimize.
[2022-05-17 11:46:20] [INFO ] Deduced a trap composed of 31 places in 496 ms of which 1 ms to minimize.
[2022-05-17 11:46:21] [INFO ] Deduced a trap composed of 43 places in 486 ms of which 1 ms to minimize.
[2022-05-17 11:46:21] [INFO ] Deduced a trap composed of 45 places in 501 ms of which 1 ms to minimize.
[2022-05-17 11:46:22] [INFO ] Deduced a trap composed of 77 places in 486 ms of which 1 ms to minimize.
[2022-05-17 11:46:22] [INFO ] Deduced a trap composed of 17 places in 488 ms of which 1 ms to minimize.
[2022-05-17 11:46:23] [INFO ] Deduced a trap composed of 15 places in 496 ms of which 1 ms to minimize.
[2022-05-17 11:46:23] [INFO ] Deduced a trap composed of 31 places in 493 ms of which 1 ms to minimize.
[2022-05-17 11:46:24] [INFO ] Deduced a trap composed of 11 places in 488 ms of which 1 ms to minimize.
[2022-05-17 11:46:24] [INFO ] Deduced a trap composed of 23 places in 468 ms of which 1 ms to minimize.
[2022-05-17 11:46:25] [INFO ] Deduced a trap composed of 65 places in 455 ms of which 1 ms to minimize.
[2022-05-17 11:46:25] [INFO ] Deduced a trap composed of 13 places in 442 ms of which 1 ms to minimize.
[2022-05-17 11:46:26] [INFO ] Deduced a trap composed of 87 places in 450 ms of which 1 ms to minimize.
[2022-05-17 11:46:27] [INFO ] Deduced a trap composed of 11 places in 456 ms of which 1 ms to minimize.
[2022-05-17 11:46:27] [INFO ] Deduced a trap composed of 11 places in 454 ms of which 1 ms to minimize.
[2022-05-17 11:46:28] [INFO ] Deduced a trap composed of 35 places in 389 ms of which 0 ms to minimize.
[2022-05-17 11:46:28] [INFO ] Deduced a trap composed of 73 places in 360 ms of which 1 ms to minimize.
[2022-05-17 11:46:28] [INFO ] Deduced a trap composed of 137 places in 345 ms of which 1 ms to minimize.
[2022-05-17 11:46:28] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 12570 ms
[2022-05-17 11:46:29] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 87 ms.
[2022-05-17 11:46:33] [INFO ] Deduced a trap composed of 29 places in 473 ms of which 1 ms to minimize.
[2022-05-17 11:46:34] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 1 ms to minimize.
[2022-05-17 11:46:35] [INFO ] Deduced a trap composed of 17 places in 501 ms of which 1 ms to minimize.
[2022-05-17 11:46:35] [INFO ] Deduced a trap composed of 69 places in 491 ms of which 1 ms to minimize.
[2022-05-17 11:46:36] [INFO ] Deduced a trap composed of 37 places in 334 ms of which 0 ms to minimize.
[2022-05-17 11:46:36] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 1 ms to minimize.
[2022-05-17 11:46:36] [INFO ] Deduced a trap composed of 37 places in 338 ms of which 3 ms to minimize.
[2022-05-17 11:46:37] [INFO ] Deduced a trap composed of 146 places in 322 ms of which 1 ms to minimize.
[2022-05-17 11:46:37] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4065 ms
[2022-05-17 11:46:37] [INFO ] Added : 222 causal constraints over 46 iterations in 8909 ms. Result :sat
Minimization took 577 ms.
[2022-05-17 11:46:38] [INFO ] [Real]Absence check using 23 positive place invariants in 24 ms returned sat
[2022-05-17 11:46:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:46:39] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2022-05-17 11:46:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:46:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2022-05-17 11:46:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:46:40] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2022-05-17 11:46:40] [INFO ] [Nat]Added 497 Read/Feed constraints in 242 ms returned sat
[2022-05-17 11:46:40] [INFO ] Deduced a trap composed of 15 places in 503 ms of which 1 ms to minimize.
[2022-05-17 11:46:41] [INFO ] Deduced a trap composed of 11 places in 516 ms of which 1 ms to minimize.
[2022-05-17 11:46:41] [INFO ] Deduced a trap composed of 43 places in 481 ms of which 1 ms to minimize.
[2022-05-17 11:46:42] [INFO ] Deduced a trap composed of 21 places in 510 ms of which 1 ms to minimize.
[2022-05-17 11:46:43] [INFO ] Deduced a trap composed of 15 places in 501 ms of which 1 ms to minimize.
[2022-05-17 11:46:43] [INFO ] Deduced a trap composed of 15 places in 543 ms of which 1 ms to minimize.
[2022-05-17 11:46:44] [INFO ] Deduced a trap composed of 31 places in 513 ms of which 1 ms to minimize.
[2022-05-17 11:46:44] [INFO ] Deduced a trap composed of 43 places in 517 ms of which 1 ms to minimize.
[2022-05-17 11:46:45] [INFO ] Deduced a trap composed of 45 places in 512 ms of which 2 ms to minimize.
[2022-05-17 11:46:46] [INFO ] Deduced a trap composed of 77 places in 514 ms of which 1 ms to minimize.
[2022-05-17 11:46:46] [INFO ] Deduced a trap composed of 17 places in 508 ms of which 1 ms to minimize.
[2022-05-17 11:46:47] [INFO ] Deduced a trap composed of 15 places in 522 ms of which 1 ms to minimize.
[2022-05-17 11:46:47] [INFO ] Deduced a trap composed of 31 places in 507 ms of which 1 ms to minimize.
[2022-05-17 11:46:48] [INFO ] Deduced a trap composed of 11 places in 516 ms of which 1 ms to minimize.
[2022-05-17 11:46:49] [INFO ] Deduced a trap composed of 23 places in 507 ms of which 1 ms to minimize.
[2022-05-17 11:46:49] [INFO ] Deduced a trap composed of 65 places in 481 ms of which 1 ms to minimize.
[2022-05-17 11:46:50] [INFO ] Deduced a trap composed of 13 places in 491 ms of which 4 ms to minimize.
[2022-05-17 11:46:50] [INFO ] Deduced a trap composed of 87 places in 489 ms of which 1 ms to minimize.
[2022-05-17 11:46:51] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2022-05-17 11:46:51] [INFO ] Deduced a trap composed of 11 places in 493 ms of which 1 ms to minimize.
[2022-05-17 11:46:52] [INFO ] Deduced a trap composed of 35 places in 414 ms of which 1 ms to minimize.
[2022-05-17 11:46:52] [INFO ] Deduced a trap composed of 73 places in 403 ms of which 1 ms to minimize.
[2022-05-17 11:46:53] [INFO ] Deduced a trap composed of 137 places in 376 ms of which 1 ms to minimize.
[2022-05-17 11:46:53] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 13074 ms
[2022-05-17 11:46:53] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 100 ms.
[2022-05-17 11:46:58] [INFO ] Deduced a trap composed of 29 places in 514 ms of which 1 ms to minimize.
[2022-05-17 11:46:58] [INFO ] Deduced a trap composed of 53 places in 384 ms of which 0 ms to minimize.
[2022-05-17 11:46:59] [INFO ] Deduced a trap composed of 17 places in 514 ms of which 1 ms to minimize.
[2022-05-17 11:47:00] [INFO ] Deduced a trap composed of 69 places in 515 ms of which 1 ms to minimize.
[2022-05-17 11:47:00] [INFO ] Deduced a trap composed of 37 places in 371 ms of which 1 ms to minimize.
[2022-05-17 11:47:01] [INFO ] Deduced a trap composed of 57 places in 378 ms of which 0 ms to minimize.
[2022-05-17 11:47:01] [INFO ] Deduced a trap composed of 37 places in 372 ms of which 1 ms to minimize.
[2022-05-17 11:47:02] [INFO ] Deduced a trap composed of 146 places in 351 ms of which 1 ms to minimize.
[2022-05-17 11:47:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4319 ms
[2022-05-17 11:47:02] [INFO ] Added : 222 causal constraints over 46 iterations in 9280 ms. Result :sat
Minimization took 589 ms.
[2022-05-17 11:47:03] [INFO ] [Real]Absence check using 23 positive place invariants in 18 ms returned sat
[2022-05-17 11:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:03] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2022-05-17 11:47:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:47:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:04] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2022-05-17 11:47:04] [INFO ] [Nat]Added 497 Read/Feed constraints in 213 ms returned sat
[2022-05-17 11:47:05] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 1 ms to minimize.
[2022-05-17 11:47:05] [INFO ] Deduced a trap composed of 33 places in 398 ms of which 0 ms to minimize.
[2022-05-17 11:47:06] [INFO ] Deduced a trap composed of 49 places in 412 ms of which 1 ms to minimize.
[2022-05-17 11:47:06] [INFO ] Deduced a trap composed of 15 places in 388 ms of which 1 ms to minimize.
[2022-05-17 11:47:06] [INFO ] Deduced a trap composed of 13 places in 405 ms of which 1 ms to minimize.
[2022-05-17 11:47:07] [INFO ] Deduced a trap composed of 51 places in 381 ms of which 1 ms to minimize.
[2022-05-17 11:47:07] [INFO ] Deduced a trap composed of 49 places in 392 ms of which 0 ms to minimize.
[2022-05-17 11:47:08] [INFO ] Deduced a trap composed of 13 places in 384 ms of which 1 ms to minimize.
[2022-05-17 11:47:08] [INFO ] Deduced a trap composed of 15 places in 407 ms of which 0 ms to minimize.
[2022-05-17 11:47:09] [INFO ] Deduced a trap composed of 53 places in 385 ms of which 1 ms to minimize.
[2022-05-17 11:47:09] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 0 ms to minimize.
[2022-05-17 11:47:10] [INFO ] Deduced a trap composed of 67 places in 413 ms of which 0 ms to minimize.
[2022-05-17 11:47:10] [INFO ] Deduced a trap composed of 33 places in 417 ms of which 1 ms to minimize.
[2022-05-17 11:47:11] [INFO ] Deduced a trap composed of 67 places in 408 ms of which 1 ms to minimize.
[2022-05-17 11:47:11] [INFO ] Deduced a trap composed of 49 places in 380 ms of which 1 ms to minimize.
[2022-05-17 11:47:12] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 1 ms to minimize.
[2022-05-17 11:47:12] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 1 ms to minimize.
[2022-05-17 11:47:13] [INFO ] Deduced a trap composed of 57 places in 397 ms of which 1 ms to minimize.
[2022-05-17 11:47:13] [INFO ] Deduced a trap composed of 85 places in 384 ms of which 1 ms to minimize.
[2022-05-17 11:47:14] [INFO ] Deduced a trap composed of 31 places in 383 ms of which 1 ms to minimize.
[2022-05-17 11:47:14] [INFO ] Deduced a trap composed of 49 places in 374 ms of which 1 ms to minimize.
[2022-05-17 11:47:14] [INFO ] Deduced a trap composed of 69 places in 402 ms of which 0 ms to minimize.
[2022-05-17 11:47:15] [INFO ] Deduced a trap composed of 31 places in 369 ms of which 1 ms to minimize.
[2022-05-17 11:47:15] [INFO ] Deduced a trap composed of 13 places in 428 ms of which 1 ms to minimize.
[2022-05-17 11:47:16] [INFO ] Deduced a trap composed of 49 places in 397 ms of which 0 ms to minimize.
[2022-05-17 11:47:16] [INFO ] Deduced a trap composed of 87 places in 353 ms of which 1 ms to minimize.
[2022-05-17 11:47:17] [INFO ] Deduced a trap composed of 33 places in 367 ms of which 1 ms to minimize.
[2022-05-17 11:47:17] [INFO ] Deduced a trap composed of 63 places in 283 ms of which 1 ms to minimize.
[2022-05-17 11:47:17] [INFO ] Deduced a trap composed of 87 places in 281 ms of which 1 ms to minimize.
[2022-05-17 11:47:18] [INFO ] Deduced a trap composed of 69 places in 327 ms of which 0 ms to minimize.
[2022-05-17 11:47:18] [INFO ] Deduced a trap composed of 111 places in 322 ms of which 1 ms to minimize.
[2022-05-17 11:47:19] [INFO ] Deduced a trap composed of 107 places in 276 ms of which 1 ms to minimize.
[2022-05-17 11:47:19] [INFO ] Deduced a trap composed of 107 places in 282 ms of which 0 ms to minimize.
[2022-05-17 11:47:19] [INFO ] Deduced a trap composed of 91 places in 275 ms of which 0 ms to minimize.
[2022-05-17 11:47:20] [INFO ] Deduced a trap composed of 71 places in 348 ms of which 1 ms to minimize.
[2022-05-17 11:47:20] [INFO ] Deduced a trap composed of 71 places in 332 ms of which 1 ms to minimize.
[2022-05-17 11:47:21] [INFO ] Deduced a trap composed of 103 places in 327 ms of which 0 ms to minimize.
[2022-05-17 11:47:21] [INFO ] Deduced a trap composed of 93 places in 300 ms of which 0 ms to minimize.
[2022-05-17 11:47:22] [INFO ] Deduced a trap composed of 109 places in 265 ms of which 1 ms to minimize.
[2022-05-17 11:47:22] [INFO ] Deduced a trap composed of 109 places in 257 ms of which 1 ms to minimize.
[2022-05-17 11:47:23] [INFO ] Deduced a trap composed of 103 places in 285 ms of which 0 ms to minimize.
[2022-05-17 11:47:23] [INFO ] Deduced a trap composed of 103 places in 282 ms of which 1 ms to minimize.
[2022-05-17 11:47:26] [INFO ] Trap strengthening (SAT) tested/added 42/42 trap constraints in 21794 ms
[2022-05-17 11:47:26] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:47:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:27] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2022-05-17 11:47:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:47:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:47:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:27] [INFO ] [Nat]Absence check using state equation in 439 ms returned sat
[2022-05-17 11:47:27] [INFO ] [Nat]Added 497 Read/Feed constraints in 70 ms returned sat
[2022-05-17 11:47:27] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 95 ms.
[2022-05-17 11:47:31] [INFO ] Deduced a trap composed of 13 places in 442 ms of which 1 ms to minimize.
[2022-05-17 11:47:32] [INFO ] Deduced a trap composed of 19 places in 453 ms of which 1 ms to minimize.
[2022-05-17 11:47:32] [INFO ] Deduced a trap composed of 59 places in 414 ms of which 1 ms to minimize.
[2022-05-17 11:47:33] [INFO ] Deduced a trap composed of 55 places in 422 ms of which 1 ms to minimize.
[2022-05-17 11:47:33] [INFO ] Deduced a trap composed of 17 places in 411 ms of which 1 ms to minimize.
[2022-05-17 11:47:34] [INFO ] Deduced a trap composed of 95 places in 355 ms of which 1 ms to minimize.
[2022-05-17 11:47:34] [INFO ] Deduced a trap composed of 79 places in 333 ms of which 1 ms to minimize.
[2022-05-17 11:47:35] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 1 ms to minimize.
[2022-05-17 11:47:35] [INFO ] Deduced a trap composed of 127 places in 381 ms of which 1 ms to minimize.
[2022-05-17 11:47:36] [INFO ] Deduced a trap composed of 113 places in 298 ms of which 1 ms to minimize.
[2022-05-17 11:47:36] [INFO ] Deduced a trap composed of 77 places in 357 ms of which 0 ms to minimize.
[2022-05-17 11:47:36] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5516 ms
[2022-05-17 11:47:37] [INFO ] Added : 169 causal constraints over 34 iterations in 9301 ms. Result :sat
Minimization took 276 ms.
[2022-05-17 11:47:37] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:47:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:38] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2022-05-17 11:47:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:47:38] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:47:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:38] [INFO ] [Nat]Absence check using state equation in 446 ms returned sat
[2022-05-17 11:47:38] [INFO ] [Nat]Added 497 Read/Feed constraints in 47 ms returned sat
[2022-05-17 11:47:39] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 93 ms.
[2022-05-17 11:47:41] [INFO ] Deduced a trap composed of 69 places in 397 ms of which 1 ms to minimize.
[2022-05-17 11:47:41] [INFO ] Deduced a trap composed of 35 places in 344 ms of which 0 ms to minimize.
[2022-05-17 11:47:42] [INFO ] Deduced a trap composed of 41 places in 341 ms of which 1 ms to minimize.
[2022-05-17 11:47:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1475 ms
[2022-05-17 11:47:42] [INFO ] Added : 99 causal constraints over 21 iterations in 3584 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : [448, 448, 8, 1, 1] Max seen :[7, 7, 1, 0, 0]
Support contains 457 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Applied a total of 0 rules in 28 ms. Remains 1098 /1098 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1098/1098 places, 2210/2210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Applied a total of 0 rules in 28 ms. Remains 1098 /1098 variables (removed 0) and now considering 2210/2210 (removed 0) transitions.
[2022-05-17 11:47:48] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:47:48] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:47:49] [INFO ] Implicit Places using invariants in 451 ms returned []
[2022-05-17 11:47:49] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:47:49] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:47:49] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:47:55] [INFO ] Implicit Places using invariants and state equation in 6557 ms returned []
Implicit Place search using SMT with State Equation took 7011 ms to find 0 implicit places.
[2022-05-17 11:47:55] [INFO ] Redundant transitions in 140 ms returned []
[2022-05-17 11:47:55] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:47:55] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 11:47:56] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1098/1098 places, 2210/2210 transitions.
Starting property specific reduction for Peterson-PT-7-UpperBounds-01
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:47:56] [INFO ] Computed 23 place invariants in 6 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :1
[2022-05-17 11:47:56] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:47:56] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 11:47:57] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:47:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:57] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2022-05-17 11:47:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:47:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:47:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:47:58] [INFO ] [Nat]Absence check using state equation in 432 ms returned sat
[2022-05-17 11:47:58] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:47:58] [INFO ] [Nat]Added 497 Read/Feed constraints in 239 ms returned sat
[2022-05-17 11:47:58] [INFO ] Deduced a trap composed of 33 places in 425 ms of which 1 ms to minimize.
[2022-05-17 11:47:59] [INFO ] Deduced a trap composed of 47 places in 447 ms of which 1 ms to minimize.
[2022-05-17 11:47:59] [INFO ] Deduced a trap composed of 37 places in 415 ms of which 0 ms to minimize.
[2022-05-17 11:48:00] [INFO ] Deduced a trap composed of 33 places in 432 ms of which 1 ms to minimize.
[2022-05-17 11:48:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2063 ms
[2022-05-17 11:48:00] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 87 ms.
[2022-05-17 11:48:01] [INFO ] Added : 47 causal constraints over 10 iterations in 1371 ms. Result :sat
Minimization took 675 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[3]
Support contains 448 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1098/1098 places, 2210/2210 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 1098 transition count 2209
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1097 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1096 transition count 2208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 20 place count 1088 transition count 2200
Applied a total of 20 rules in 59 ms. Remains 1088 /1098 variables (removed 10) and now considering 2200/2210 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1098 places, 2200/2210 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:02] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6936 ms. (steps per millisecond=144 ) properties (out of 1) seen :6
Finished Best-First random walk after 920702 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=184 )
[2022-05-17 11:48:14] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:14] [INFO ] Computed 23 place invariants in 13 ms
[2022-05-17 11:48:14] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:48:15] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2022-05-17 11:48:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:48:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:48:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:48:16] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-17 11:48:16] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:48:16] [INFO ] [Nat]Added 497 Read/Feed constraints in 197 ms returned sat
[2022-05-17 11:48:16] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 1 ms to minimize.
[2022-05-17 11:48:17] [INFO ] Deduced a trap composed of 47 places in 387 ms of which 1 ms to minimize.
[2022-05-17 11:48:17] [INFO ] Deduced a trap composed of 99 places in 376 ms of which 1 ms to minimize.
[2022-05-17 11:48:18] [INFO ] Deduced a trap composed of 45 places in 389 ms of which 1 ms to minimize.
[2022-05-17 11:48:18] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1949 ms
[2022-05-17 11:48:18] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 84 ms.
[2022-05-17 11:48:21] [INFO ] Deduced a trap composed of 69 places in 394 ms of which 1 ms to minimize.
[2022-05-17 11:48:21] [INFO ] Deduced a trap composed of 105 places in 384 ms of which 0 ms to minimize.
[2022-05-17 11:48:22] [INFO ] Deduced a trap composed of 37 places in 350 ms of which 1 ms to minimize.
[2022-05-17 11:48:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1489 ms
[2022-05-17 11:48:22] [INFO ] Added : 116 causal constraints over 24 iterations in 4464 ms. Result :sat
Minimization took 506 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 27 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 27 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 11:48:23] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:23] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:48:24] [INFO ] Implicit Places using invariants in 532 ms returned []
[2022-05-17 11:48:24] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:24] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:48:25] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:48:30] [INFO ] Implicit Places using invariants and state equation in 6417 ms returned []
Implicit Place search using SMT with State Equation took 6950 ms to find 0 implicit places.
[2022-05-17 11:48:30] [INFO ] Redundant transitions in 123 ms returned []
[2022-05-17 11:48:30] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:30] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-17 11:48:31] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:31] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6909 ms. (steps per millisecond=144 ) properties (out of 1) seen :6
Finished Best-First random walk after 915257 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=183 )
[2022-05-17 11:48:43] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:43] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 11:48:43] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:48:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:48:44] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2022-05-17 11:48:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:48:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:48:45] [INFO ] [Nat]Absence check using state equation in 404 ms returned sat
[2022-05-17 11:48:45] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:48:45] [INFO ] [Nat]Added 497 Read/Feed constraints in 192 ms returned sat
[2022-05-17 11:48:46] [INFO ] Deduced a trap composed of 17 places in 502 ms of which 1 ms to minimize.
[2022-05-17 11:48:46] [INFO ] Deduced a trap composed of 47 places in 394 ms of which 1 ms to minimize.
[2022-05-17 11:48:46] [INFO ] Deduced a trap composed of 99 places in 377 ms of which 0 ms to minimize.
[2022-05-17 11:48:47] [INFO ] Deduced a trap composed of 45 places in 366 ms of which 0 ms to minimize.
[2022-05-17 11:48:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1960 ms
[2022-05-17 11:48:47] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 91 ms.
[2022-05-17 11:48:50] [INFO ] Deduced a trap composed of 69 places in 392 ms of which 1 ms to minimize.
[2022-05-17 11:48:51] [INFO ] Deduced a trap composed of 105 places in 364 ms of which 0 ms to minimize.
[2022-05-17 11:48:51] [INFO ] Deduced a trap composed of 37 places in 359 ms of which 1 ms to minimize.
[2022-05-17 11:48:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1479 ms
[2022-05-17 11:48:51] [INFO ] Added : 116 causal constraints over 24 iterations in 4459 ms. Result :sat
Minimization took 500 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 27 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 26 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 11:48:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:53] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:48:53] [INFO ] Implicit Places using invariants in 551 ms returned []
[2022-05-17 11:48:53] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:48:53] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 11:48:54] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:49:00] [INFO ] Implicit Places using invariants and state equation in 6477 ms returned []
Implicit Place search using SMT with State Equation took 7030 ms to find 0 implicit places.
[2022-05-17 11:49:00] [INFO ] Redundant transitions in 36 ms returned []
[2022-05-17 11:49:00] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:00] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:49:01] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-01 in 64224 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-03
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:49:01] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :2
[2022-05-17 11:49:01] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:49:01] [INFO ] Computed 23 place invariants in 12 ms
[2022-05-17 11:49:01] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:49:01] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2022-05-17 11:49:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:49:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:49:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:49:02] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2022-05-17 11:49:02] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:49:02] [INFO ] [Nat]Added 497 Read/Feed constraints in 206 ms returned sat
[2022-05-17 11:49:03] [INFO ] Deduced a trap composed of 31 places in 504 ms of which 0 ms to minimize.
[2022-05-17 11:49:04] [INFO ] Deduced a trap composed of 23 places in 449 ms of which 1 ms to minimize.
[2022-05-17 11:49:04] [INFO ] Deduced a trap composed of 15 places in 457 ms of which 0 ms to minimize.
[2022-05-17 11:49:05] [INFO ] Deduced a trap composed of 23 places in 452 ms of which 1 ms to minimize.
[2022-05-17 11:49:05] [INFO ] Deduced a trap composed of 85 places in 373 ms of which 0 ms to minimize.
[2022-05-17 11:49:05] [INFO ] Deduced a trap composed of 71 places in 357 ms of which 0 ms to minimize.
[2022-05-17 11:49:06] [INFO ] Deduced a trap composed of 71 places in 315 ms of which 1 ms to minimize.
[2022-05-17 11:49:06] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3440 ms
[2022-05-17 11:49:06] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 86 ms.
[2022-05-17 11:49:07] [INFO ] Deduced a trap composed of 2 places in 523 ms of which 1 ms to minimize.
[2022-05-17 11:49:07] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [448] Max seen :[6]
Support contains 448 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1098/1098 places, 2210/2210 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 1098 transition count 2209
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 1097 transition count 2208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 1096 transition count 2208
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 4 place count 1096 transition count 2200
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 20 place count 1088 transition count 2200
Applied a total of 20 rules in 78 ms. Remains 1088 /1098 variables (removed 10) and now considering 2200/2210 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1098 places, 2200/2210 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:07] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6922 ms. (steps per millisecond=144 ) properties (out of 1) seen :7
Finished Best-First random walk after 917642 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=183 )
[2022-05-17 11:49:19] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:19] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:49:19] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:49:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:49:19] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2022-05-17 11:49:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:49:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:49:20] [INFO ] [Nat]Absence check using state equation in 418 ms returned sat
[2022-05-17 11:49:20] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:49:21] [INFO ] [Nat]Added 497 Read/Feed constraints in 180 ms returned sat
[2022-05-17 11:49:21] [INFO ] Deduced a trap composed of 11 places in 498 ms of which 1 ms to minimize.
[2022-05-17 11:49:22] [INFO ] Deduced a trap composed of 78 places in 481 ms of which 1 ms to minimize.
[2022-05-17 11:49:22] [INFO ] Deduced a trap composed of 78 places in 501 ms of which 1 ms to minimize.
[2022-05-17 11:49:23] [INFO ] Deduced a trap composed of 55 places in 471 ms of which 1 ms to minimize.
[2022-05-17 11:49:23] [INFO ] Deduced a trap composed of 11 places in 490 ms of which 1 ms to minimize.
[2022-05-17 11:49:24] [INFO ] Deduced a trap composed of 11 places in 477 ms of which 1 ms to minimize.
[2022-05-17 11:49:24] [INFO ] Deduced a trap composed of 17 places in 467 ms of which 1 ms to minimize.
[2022-05-17 11:49:25] [INFO ] Deduced a trap composed of 75 places in 335 ms of which 0 ms to minimize.
[2022-05-17 11:49:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4353 ms
[2022-05-17 11:49:25] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 89 ms.
[2022-05-17 11:49:28] [INFO ] Added : 164 causal constraints over 34 iterations in 3480 ms. Result :sat
Minimization took 440 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 24 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 11:49:29] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:29] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:49:30] [INFO ] Implicit Places using invariants in 467 ms returned []
[2022-05-17 11:49:30] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:30] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:49:30] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:49:36] [INFO ] Implicit Places using invariants and state equation in 6536 ms returned []
Implicit Place search using SMT with State Equation took 7003 ms to find 0 implicit places.
[2022-05-17 11:49:36] [INFO ] Redundant transitions in 35 ms returned []
[2022-05-17 11:49:36] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:36] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-17 11:49:37] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Normalized transition count is 1864 out of 2200 initially.
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:37] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 6908 ms. (steps per millisecond=144 ) properties (out of 1) seen :6
Finished Best-First random walk after 894755 steps, including 2 resets, run visited all 1 properties in 5001 ms. (steps per millisecond=178 )
[2022-05-17 11:49:49] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 11:49:49] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:49:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:49:50] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2022-05-17 11:49:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:49:50] [INFO ] [Nat]Absence check using 23 positive place invariants in 21 ms returned sat
[2022-05-17 11:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:49:51] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-17 11:49:51] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:49:51] [INFO ] [Nat]Added 497 Read/Feed constraints in 177 ms returned sat
[2022-05-17 11:49:51] [INFO ] Deduced a trap composed of 11 places in 490 ms of which 2 ms to minimize.
[2022-05-17 11:49:52] [INFO ] Deduced a trap composed of 78 places in 474 ms of which 1 ms to minimize.
[2022-05-17 11:49:52] [INFO ] Deduced a trap composed of 78 places in 477 ms of which 1 ms to minimize.
[2022-05-17 11:49:53] [INFO ] Deduced a trap composed of 55 places in 466 ms of which 1 ms to minimize.
[2022-05-17 11:49:53] [INFO ] Deduced a trap composed of 11 places in 484 ms of which 1 ms to minimize.
[2022-05-17 11:49:54] [INFO ] Deduced a trap composed of 11 places in 474 ms of which 1 ms to minimize.
[2022-05-17 11:49:54] [INFO ] Deduced a trap composed of 17 places in 459 ms of which 1 ms to minimize.
[2022-05-17 11:49:55] [INFO ] Deduced a trap composed of 75 places in 331 ms of which 0 ms to minimize.
[2022-05-17 11:49:55] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4255 ms
[2022-05-17 11:49:55] [INFO ] Computed and/alt/rep : 1744/5280/1744 causal constraints (skipped 112 transitions) in 85 ms.
[2022-05-17 11:49:58] [INFO ] Added : 164 causal constraints over 34 iterations in 3475 ms. Result :sat
Minimization took 435 ms.
Current structural bounds on expressions (after SMT) : [448] Max seen :[7]
Support contains 448 out of 1088 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 24 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1088/1088 places, 2200/2200 transitions.
Applied a total of 0 rules in 23 ms. Remains 1088 /1088 variables (removed 0) and now considering 2200/2200 (removed 0) transitions.
[2022-05-17 11:49:59] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:49:59] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:50:00] [INFO ] Implicit Places using invariants in 452 ms returned []
[2022-05-17 11:50:00] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:50:00] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:50:00] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:50:06] [INFO ] Implicit Places using invariants and state equation in 6459 ms returned []
Implicit Place search using SMT with State Equation took 6912 ms to find 0 implicit places.
[2022-05-17 11:50:06] [INFO ] Redundant transitions in 36 ms returned []
[2022-05-17 11:50:06] [INFO ] Flow matrix only has 1864 transitions (discarded 336 similar events)
// Phase 1: matrix 1864 rows 1088 cols
[2022-05-17 11:50:06] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 11:50:07] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1088/1088 places, 2200/2200 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-03 in 66616 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-07
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:50:07] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2022-05-17 11:50:07] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:50:07] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 11:50:07] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:08] [INFO ] [Real]Absence check using state equation in 424 ms returned sat
[2022-05-17 11:50:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:50:08] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:50:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:08] [INFO ] [Nat]Absence check using state equation in 414 ms returned sat
[2022-05-17 11:50:08] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:50:09] [INFO ] [Nat]Added 497 Read/Feed constraints in 210 ms returned sat
[2022-05-17 11:50:09] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 0 ms to minimize.
[2022-05-17 11:50:09] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 0 ms to minimize.
[2022-05-17 11:50:10] [INFO ] Deduced a trap composed of 49 places in 372 ms of which 0 ms to minimize.
[2022-05-17 11:50:10] [INFO ] Deduced a trap composed of 15 places in 418 ms of which 1 ms to minimize.
[2022-05-17 11:50:11] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 0 ms to minimize.
[2022-05-17 11:50:11] [INFO ] Deduced a trap composed of 51 places in 390 ms of which 1 ms to minimize.
[2022-05-17 11:50:12] [INFO ] Deduced a trap composed of 49 places in 373 ms of which 1 ms to minimize.
[2022-05-17 11:50:12] [INFO ] Deduced a trap composed of 13 places in 386 ms of which 0 ms to minimize.
[2022-05-17 11:50:13] [INFO ] Deduced a trap composed of 15 places in 396 ms of which 0 ms to minimize.
[2022-05-17 11:50:13] [INFO ] Deduced a trap composed of 53 places in 365 ms of which 0 ms to minimize.
[2022-05-17 11:50:13] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 1098 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1098/1098 places, 2210/2210 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 1098 transition count 2103
Reduce places removed 107 places and 0 transitions.
Iterating post reduction 1 with 107 rules applied. Total rules applied 214 place count 991 transition count 2103
Performed 343 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 343 Pre rules applied. Total rules applied 214 place count 991 transition count 1760
Deduced a syphon composed of 343 places in 1 ms
Reduce places removed 343 places and 0 transitions.
Iterating global reduction 2 with 686 rules applied. Total rules applied 900 place count 648 transition count 1760
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 0 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 1012 place count 592 transition count 1704
Applied a total of 1012 rules in 104 ms. Remains 592 /1098 variables (removed 506) and now considering 1704/2210 (removed 506) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/1098 places, 1704/2210 transitions.
Normalized transition count is 1368 out of 1704 initially.
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 11:50:13] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2176 ms. (steps per millisecond=459 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties (out of 1) seen :1
[2022-05-17 11:50:16] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 11:50:16] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:50:16] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 11:50:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:16] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2022-05-17 11:50:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:50:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 12 ms returned sat
[2022-05-17 11:50:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:17] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2022-05-17 11:50:17] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:50:17] [INFO ] [Nat]Added 497 Read/Feed constraints in 64 ms returned sat
[2022-05-17 11:50:17] [INFO ] Deduced a trap composed of 56 places in 195 ms of which 0 ms to minimize.
[2022-05-17 11:50:17] [INFO ] Deduced a trap composed of 11 places in 187 ms of which 1 ms to minimize.
[2022-05-17 11:50:18] [INFO ] Deduced a trap composed of 11 places in 194 ms of which 0 ms to minimize.
[2022-05-17 11:50:18] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:50:18] [INFO ] Deduced a trap composed of 65 places in 184 ms of which 0 ms to minimize.
[2022-05-17 11:50:18] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 0 ms to minimize.
[2022-05-17 11:50:19] [INFO ] Deduced a trap composed of 16 places in 195 ms of which 1 ms to minimize.
[2022-05-17 11:50:19] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2022-05-17 11:50:19] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2022-05-17 11:50:19] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 0 ms to minimize.
[2022-05-17 11:50:20] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 0 ms to minimize.
[2022-05-17 11:50:20] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 0 ms to minimize.
[2022-05-17 11:50:20] [INFO ] Deduced a trap composed of 16 places in 189 ms of which 0 ms to minimize.
[2022-05-17 11:50:20] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 1 ms to minimize.
[2022-05-17 11:50:21] [INFO ] Deduced a trap composed of 25 places in 181 ms of which 0 ms to minimize.
[2022-05-17 11:50:21] [INFO ] Deduced a trap composed of 25 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:50:21] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:50:21] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 0 ms to minimize.
[2022-05-17 11:50:22] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 0 ms to minimize.
[2022-05-17 11:50:25] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2022-05-17 11:50:25] [INFO ] Deduced a trap composed of 24 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:50:25] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 1 ms to minimize.
[2022-05-17 11:50:25] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 0 ms to minimize.
[2022-05-17 11:50:26] [INFO ] Deduced a trap composed of 34 places in 181 ms of which 0 ms to minimize.
[2022-05-17 11:50:26] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 1 ms to minimize.
[2022-05-17 11:50:26] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 0 ms to minimize.
[2022-05-17 11:50:26] [INFO ] Deduced a trap composed of 68 places in 185 ms of which 0 ms to minimize.
[2022-05-17 11:50:26] [INFO ] Deduced a trap composed of 25 places in 183 ms of which 0 ms to minimize.
[2022-05-17 11:50:27] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 1 ms to minimize.
[2022-05-17 11:50:27] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 1 ms to minimize.
[2022-05-17 11:50:27] [INFO ] Deduced a trap composed of 52 places in 182 ms of which 1 ms to minimize.
[2022-05-17 11:50:27] [INFO ] Deduced a trap composed of 74 places in 177 ms of which 0 ms to minimize.
[2022-05-17 11:50:28] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 0 ms to minimize.
[2022-05-17 11:50:28] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 0 ms to minimize.
[2022-05-17 11:50:28] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 1 ms to minimize.
[2022-05-17 11:50:28] [INFO ] Deduced a trap composed of 42 places in 181 ms of which 1 ms to minimize.
[2022-05-17 11:50:29] [INFO ] Deduced a trap composed of 41 places in 178 ms of which 1 ms to minimize.
[2022-05-17 11:50:29] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 0 ms to minimize.
[2022-05-17 11:50:30] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 1 ms to minimize.
[2022-05-17 11:50:30] [INFO ] Deduced a trap composed of 33 places in 169 ms of which 0 ms to minimize.
[2022-05-17 11:50:30] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 1 ms to minimize.
[2022-05-17 11:50:31] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 0 ms to minimize.
[2022-05-17 11:50:31] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 0 ms to minimize.
[2022-05-17 11:50:31] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 0 ms to minimize.
[2022-05-17 11:50:32] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 0 ms to minimize.
[2022-05-17 11:50:35] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 17682 ms
Current structural bounds on expressions (after SMT) : [8] Max seen :[1]
Support contains 8 out of 592 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 39 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 592/592 places, 1704/1704 transitions.
Applied a total of 0 rules in 23 ms. Remains 592 /592 variables (removed 0) and now considering 1704/1704 (removed 0) transitions.
[2022-05-17 11:50:35] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 11:50:35] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:50:35] [INFO ] Implicit Places using invariants in 348 ms returned []
[2022-05-17 11:50:35] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 11:50:35] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 11:50:35] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:50:38] [INFO ] Implicit Places using invariants and state equation in 3005 ms returned []
Implicit Place search using SMT with State Equation took 3356 ms to find 0 implicit places.
[2022-05-17 11:50:38] [INFO ] Redundant transitions in 26 ms returned []
[2022-05-17 11:50:38] [INFO ] Flow matrix only has 1368 transitions (discarded 336 similar events)
// Phase 1: matrix 1368 rows 592 cols
[2022-05-17 11:50:38] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:50:39] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 592/592 places, 1704/1704 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-07 in 31501 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-08
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:50:39] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-05-17 11:50:39] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:50:39] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 11:50:39] [INFO ] [Real]Absence check using 23 positive place invariants in 17 ms returned sat
[2022-05-17 11:50:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:39] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2022-05-17 11:50:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:50:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:40] [INFO ] [Nat]Absence check using state equation in 412 ms returned sat
[2022-05-17 11:50:40] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:50:40] [INFO ] [Nat]Added 497 Read/Feed constraints in 63 ms returned sat
[2022-05-17 11:50:40] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 86 ms.
[2022-05-17 11:50:44] [INFO ] Deduced a trap composed of 13 places in 418 ms of which 1 ms to minimize.
[2022-05-17 11:50:44] [INFO ] Deduced a trap composed of 19 places in 407 ms of which 0 ms to minimize.
[2022-05-17 11:50:45] [INFO ] Deduced a trap composed of 59 places in 376 ms of which 1 ms to minimize.
[2022-05-17 11:50:45] [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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
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:136)
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:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1098 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1098/1098 places, 2209/2209 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 1097 transition count 2102
Reduce places removed 106 places and 1 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 991 transition count 2101
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 213 place count 990 transition count 2099
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 214 place count 989 transition count 2098
Performed 350 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 350 Pre rules applied. Total rules applied 214 place count 989 transition count 1748
Deduced a syphon composed of 350 places in 1 ms
Reduce places removed 350 places and 0 transitions.
Iterating global reduction 4 with 700 rules applied. Total rules applied 914 place count 639 transition count 1748
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 4 with 110 rules applied. Total rules applied 1024 place count 584 transition count 1693
Applied a total of 1024 rules in 91 ms. Remains 584 /1098 variables (removed 514) and now considering 1693/2209 (removed 516) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/1098 places, 1693/2209 transitions.
Normalized transition count is 1357 out of 1693 initially.
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 11:50:45] [INFO ] Computed 23 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2041 ms. (steps per millisecond=489 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 1) seen :0
[2022-05-17 11:50:47] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 11:50:47] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:50:47] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 11:50:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:48] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2022-05-17 11:50:48] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:50:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 11:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:48] [INFO ] [Nat]Absence check using state equation in 220 ms returned sat
[2022-05-17 11:50:48] [INFO ] State equation strengthened by 495 read => feed constraints.
[2022-05-17 11:50:48] [INFO ] [Nat]Added 495 Read/Feed constraints in 34 ms returned sat
[2022-05-17 11:50:48] [INFO ] Computed and/alt/rep : 1237/4763/1237 causal constraints (skipped 112 transitions) in 70 ms.
[2022-05-17 11:50:49] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2022-05-17 11:50:49] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 0 ms to minimize.
[2022-05-17 11:50:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 555 ms
[2022-05-17 11:50:50] [INFO ] Added : 91 causal constraints over 19 iterations in 1920 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1693/1693 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1693/1693 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1693/1693 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 584/584 places, 1693/1693 transitions.
Applied a total of 0 rules in 19 ms. Remains 584 /584 variables (removed 0) and now considering 1693/1693 (removed 0) transitions.
[2022-05-17 11:50:50] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 11:50:50] [INFO ] Computed 23 place invariants in 7 ms
[2022-05-17 11:50:51] [INFO ] Implicit Places using invariants in 360 ms returned []
[2022-05-17 11:50:51] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 11:50:51] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 11:50:51] [INFO ] State equation strengthened by 495 read => feed constraints.
[2022-05-17 11:50:53] [INFO ] Implicit Places using invariants and state equation in 2825 ms returned []
Implicit Place search using SMT with State Equation took 3200 ms to find 0 implicit places.
[2022-05-17 11:50:53] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-17 11:50:53] [INFO ] Flow matrix only has 1357 transitions (discarded 336 similar events)
// Phase 1: matrix 1357 rows 584 cols
[2022-05-17 11:50:53] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 11:50:54] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 584/584 places, 1693/1693 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-08 in 15403 ms.
Starting property specific reduction for Peterson-PT-7-UpperBounds-12
Normalized transition count is 1874 out of 2210 initially.
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:50:54] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2022-05-17 11:50:54] [INFO ] Flow matrix only has 1874 transitions (discarded 336 similar events)
// Phase 1: matrix 1874 rows 1098 cols
[2022-05-17 11:50:54] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:50:54] [INFO ] [Real]Absence check using 23 positive place invariants in 19 ms returned sat
[2022-05-17 11:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:55] [INFO ] [Real]Absence check using state equation in 411 ms returned sat
[2022-05-17 11:50:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:50:55] [INFO ] [Nat]Absence check using 23 positive place invariants in 20 ms returned sat
[2022-05-17 11:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:50:55] [INFO ] [Nat]Absence check using state equation in 403 ms returned sat
[2022-05-17 11:50:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2022-05-17 11:50:55] [INFO ] [Nat]Added 497 Read/Feed constraints in 47 ms returned sat
[2022-05-17 11:50:55] [INFO ] Computed and/alt/rep : 1754/5290/1754 causal constraints (skipped 112 transitions) in 86 ms.
[2022-05-17 11:50:58] [INFO ] Deduced a trap composed of 69 places in 395 ms of which 0 ms to minimize.
[2022-05-17 11:50:58] [INFO ] Deduced a trap composed of 35 places in 334 ms of which 0 ms to minimize.
[2022-05-17 11:50:59] [INFO ] Deduced a trap composed of 41 places in 345 ms of which 0 ms to minimize.
[2022-05-17 11:50:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1460 ms
[2022-05-17 11:50:59] [INFO ] Added : 99 causal constraints over 21 iterations in 3536 ms. Result :sat
Minimization took 270 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 1098 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 1098/1098 places, 2209/2209 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 1097 transition count 2100
Reduce places removed 108 places and 1 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 989 transition count 2099
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 988 transition count 2097
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 218 place count 987 transition count 2096
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 219 place count 986 transition count 2094
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 985 transition count 2093
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 221 place count 984 transition count 2091
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 222 place count 983 transition count 2090
Performed 347 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 347 Pre rules applied. Total rules applied 222 place count 983 transition count 1743
Deduced a syphon composed of 347 places in 1 ms
Reduce places removed 347 places and 0 transitions.
Iterating global reduction 8 with 694 rules applied. Total rules applied 916 place count 636 transition count 1743
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 8 with 110 rules applied. Total rules applied 1026 place count 581 transition count 1688
Applied a total of 1026 rules in 81 ms. Remains 581 /1098 variables (removed 517) and now considering 1688/2209 (removed 521) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/1098 places, 1688/2209 transitions.
Normalized transition count is 1352 out of 1688 initially.
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 11:51:00] [INFO ] Computed 23 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2084 ms. (steps per millisecond=479 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 592 ms. (steps per millisecond=1689 ) properties (out of 1) seen :0
[2022-05-17 11:51:02] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 11:51:02] [INFO ] Computed 23 place invariants in 6 ms
[2022-05-17 11:51:02] [INFO ] [Real]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 11:51:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 11:51:03] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-05-17 11:51:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 11:51:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 11 ms returned sat
[2022-05-17 11:51:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 11:51:03] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2022-05-17 11:51:03] [INFO ] State equation strengthened by 493 read => feed constraints.
[2022-05-17 11:51:03] [INFO ] [Nat]Added 493 Read/Feed constraints in 32 ms returned sat
[2022-05-17 11:51:03] [INFO ] Computed and/alt/rep : 1232/4756/1232 causal constraints (skipped 112 transitions) in 64 ms.
[2022-05-17 11:51:04] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 1 ms to minimize.
[2022-05-17 11:51:05] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 0 ms to minimize.
[2022-05-17 11:51:05] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 1 ms to minimize.
[2022-05-17 11:51:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 806 ms
[2022-05-17 11:51:05] [INFO ] Added : 71 causal constraints over 15 iterations in 1966 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 581 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1688/1688 transitions.
Applied a total of 0 rules in 19 ms. Remains 581 /581 variables (removed 0) and now considering 1688/1688 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1688/1688 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 581/581 places, 1688/1688 transitions.
Applied a total of 0 rules in 18 ms. Remains 581 /581 variables (removed 0) and now considering 1688/1688 (removed 0) transitions.
[2022-05-17 11:51:05] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 11:51:05] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:51:06] [INFO ] Implicit Places using invariants in 337 ms returned []
[2022-05-17 11:51:06] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 11:51:06] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-17 11:51:06] [INFO ] State equation strengthened by 493 read => feed constraints.
[2022-05-17 11:51:08] [INFO ] Implicit Places using invariants and state equation in 2742 ms returned []
Implicit Place search using SMT with State Equation took 3080 ms to find 0 implicit places.
[2022-05-17 11:51:08] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-17 11:51:08] [INFO ] Flow matrix only has 1352 transitions (discarded 336 similar events)
// Phase 1: matrix 1352 rows 581 cols
[2022-05-17 11:51:08] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-17 11:51:09] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 581/581 places, 1688/1688 transitions.
Ending property specific reduction for Peterson-PT-7-UpperBounds-12 in 14929 ms.
[2022-05-17 11:51:09] [INFO ] Flatten gal took : 158 ms
[2022-05-17 11:51:09] [INFO ] Applying decomposition
[2022-05-17 11:51:10] [INFO ] Flatten gal took : 97 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14912602242095946051.txt' '-o' '/tmp/graph14912602242095946051.bin' '-w' '/tmp/graph14912602242095946051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14912602242095946051.bin' '-l' '-1' '-v' '-w' '/tmp/graph14912602242095946051.weights' '-q' '0' '-e' '0.001'
[2022-05-17 11:51:10] [INFO ] Decomposing Gal with order
[2022-05-17 11:51:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 11:51:10] [INFO ] Removed a total of 3174 redundant transitions.
[2022-05-17 11:51:10] [INFO ] Flatten gal took : 240 ms
[2022-05-17 11:51:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 46 ms.
[2022-05-17 11:51:11] [INFO ] Time to serialize gal into /tmp/UpperBounds3085055658868268513.gal : 31 ms
[2022-05-17 11:51:11] [INFO ] Time to serialize properties into /tmp/UpperBounds8760050100139059706.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds3085055658868268513.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8760050100139059706.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds8760050100139059706.prop.
Detected timeout of ITS tools.
[2022-05-17 12:14:36] [INFO ] Applying decomposition
[2022-05-17 12:14:36] [INFO ] Flatten gal took : 402 ms
[2022-05-17 12:14:36] [INFO ] Decomposing Gal with order
[2022-05-17 12:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 12:14:37] [INFO ] Removed a total of 2152 redundant transitions.
[2022-05-17 12:14:38] [INFO ] Flatten gal took : 1136 ms
[2022-05-17 12:14:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 981 labels/synchronizations in 243 ms.
[2022-05-17 12:14:48] [INFO ] Time to serialize gal into /tmp/UpperBounds8511960708150650305.gal : 155 ms
[2022-05-17 12:14:48] [INFO ] Time to serialize properties into /tmp/UpperBounds7110372022951107698.prop : 9 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds8511960708150650305.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7110372022951107698.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...295
Loading property file /tmp/UpperBounds7110372022951107698.prop.
Detected timeout of ITS tools.
[2022-05-17 12:38:17] [INFO ] Flatten gal took : 432 ms
[2022-05-17 12:38:20] [INFO ] Input system was already deterministic with 2210 transitions.
[2022-05-17 12:38:21] [INFO ] Transformed 1098 places.
[2022-05-17 12:38:21] [INFO ] Transformed 2210 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 12:38:22] [INFO ] Time to serialize gal into /tmp/UpperBounds16896171504018524371.gal : 23 ms
[2022-05-17 12:38:22] [INFO ] Time to serialize properties into /tmp/UpperBounds15451056128151150918.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16896171504018524371.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15451056128151150918.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...342
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds15451056128151150918.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="Peterson-PT-7"
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 Peterson-PT-7, 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 r168-tall-165277016200093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 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 ;