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.r179-tall-165277026700028.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 gold2021
Input is Peterson-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 135K Apr 30 09:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 571K Apr 30 09:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 372K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 68K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 200K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 140K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 34K 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 535K 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-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652823924949

Running Version 0
[2022-05-17 21:45:26] [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 21:45:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:45:26] [INFO ] Load time of PNML (sax parser for PT used): 181 ms
[2022-05-17 21:45:26] [INFO ] Transformed 834 places.
[2022-05-17 21:45:26] [INFO ] Transformed 1242 transitions.
[2022-05-17 21:45:26] [INFO ] Found NUPN structural information;
[2022-05-17 21:45:26] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2022-05-17 21:45:26] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 227 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
FORMULA Peterson-PT-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 21:45:26] [INFO ] Computed 23 place invariants in 30 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=80 ) properties (out of 12) seen :26
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :18
[2022-05-17 21:45:27] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-05-17 21:45:27] [INFO ] Computed 23 place invariants in 15 ms
[2022-05-17 21:45:27] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:27] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2022-05-17 21:45:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 19 ms returned sat
[2022-05-17 21:45:28] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:28] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2022-05-17 21:45:28] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:45:28] [INFO ] [Nat]Added 230 Read/Feed constraints in 63 ms returned sat
[2022-05-17 21:45:28] [INFO ] Deduced a trap composed of 11 places in 275 ms of which 4 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 2 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:45:29] [INFO ] Deduced a trap composed of 18 places in 248 ms of which 2 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Deduced a trap composed of 11 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:45:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1770 ms
[2022-05-17 21:45:30] [INFO ] [Real]Absence check using 17 positive place invariants in 19 ms returned unsat
[2022-05-17 21:45:30] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned unsat
[2022-05-17 21:45:30] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2022-05-17 21:45:30] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:30] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-05-17 21:45:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:31] [INFO ] [Nat]Absence check using 17 positive place invariants in 18 ms returned sat
[2022-05-17 21:45:31] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 21:45:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:31] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2022-05-17 21:45:31] [INFO ] [Nat]Added 230 Read/Feed constraints in 48 ms returned sat
[2022-05-17 21:45:31] [INFO ] Deduced a trap composed of 11 places in 273 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 0 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 11 places in 266 ms of which 1 ms to minimize.
[2022-05-17 21:45:32] [INFO ] Deduced a trap composed of 105 places in 265 ms of which 1 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 18 places in 260 ms of which 1 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 1 ms to minimize.
[2022-05-17 21:45:33] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 125 places in 262 ms of which 1 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 32 places in 259 ms of which 0 ms to minimize.
[2022-05-17 21:45:34] [INFO ] Deduced a trap composed of 118 places in 261 ms of which 1 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 32 places in 271 ms of which 2 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 0 ms to minimize.
[2022-05-17 21:45:35] [INFO ] Deduced a trap composed of 32 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:45:36] [INFO ] Deduced a trap composed of 145 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:45:36] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:45:36] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 21:45:36] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:36] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-17 21:45:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 21:45:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 20 ms returned sat
[2022-05-17 21:45:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:37] [INFO ] [Nat]Absence check using state equation in 275 ms returned sat
[2022-05-17 21:45:37] [INFO ] [Nat]Added 230 Read/Feed constraints in 75 ms returned sat
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2022-05-17 21:45:37] [INFO ] Deduced a trap composed of 11 places in 206 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 11 places in 214 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 18 places in 212 ms of which 0 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2022-05-17 21:45:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 1540 ms
[2022-05-17 21:45:38] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 21:45:38] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-17 21:45:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:39] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2022-05-17 21:45:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 21:45:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:39] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2022-05-17 21:45:39] [INFO ] [Nat]Added 230 Read/Feed constraints in 48 ms returned sat
[2022-05-17 21:45:39] [INFO ] Deduced a trap composed of 11 places in 268 ms of which 0 ms to minimize.
[2022-05-17 21:45:40] [INFO ] Deduced a trap composed of 11 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:45:40] [INFO ] Deduced a trap composed of 11 places in 262 ms of which 1 ms to minimize.
[2022-05-17 21:45:40] [INFO ] Deduced a trap composed of 105 places in 258 ms of which 1 ms to minimize.
[2022-05-17 21:45:41] [INFO ] Deduced a trap composed of 18 places in 265 ms of which 0 ms to minimize.
[2022-05-17 21:45:41] [INFO ] Deduced a trap composed of 11 places in 258 ms of which 0 ms to minimize.
[2022-05-17 21:45:41] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 0 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 4 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 125 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 32 places in 245 ms of which 0 ms to minimize.
[2022-05-17 21:45:42] [INFO ] Deduced a trap composed of 118 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:45:43] [INFO ] Deduced a trap composed of 32 places in 251 ms of which 0 ms to minimize.
[2022-05-17 21:45:43] [INFO ] Deduced a trap composed of 11 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:45:43] [INFO ] Deduced a trap composed of 32 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:45:43] [INFO ] Deduced a trap composed of 145 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:45:44] [INFO ] Deduced a trap composed of 216 places in 200 ms of which 1 ms to minimize.
[2022-05-17 21:45:44] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:45:44] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 21:45:44] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2022-05-17 21:45:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:44] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2022-05-17 21:45:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 21:45:44] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:45] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2022-05-17 21:45:45] [INFO ] [Nat]Added 230 Read/Feed constraints in 43 ms returned sat
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 1 ms to minimize.
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 1 ms to minimize.
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 1 ms to minimize.
[2022-05-17 21:45:45] [INFO ] Deduced a trap composed of 45 places in 200 ms of which 1 ms to minimize.
[2022-05-17 21:45:46] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 0 ms to minimize.
[2022-05-17 21:45:46] [INFO ] Deduced a trap composed of 19 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:45:46] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 0 ms to minimize.
[2022-05-17 21:45:46] [INFO ] Deduced a trap composed of 18 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 1 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 56 places in 169 ms of which 1 ms to minimize.
[2022-05-17 21:45:47] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 0 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 108 places in 128 ms of which 8 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 97 places in 121 ms of which 0 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 1 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 142 places in 123 ms of which 0 ms to minimize.
[2022-05-17 21:45:48] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 113 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 125 places in 121 ms of which 0 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 100 places in 192 ms of which 0 ms to minimize.
[2022-05-17 21:45:49] [INFO ] Deduced a trap composed of 108 places in 196 ms of which 1 ms to minimize.
[2022-05-17 21:45:49] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:45:49] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2022-05-17 21:45:49] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:50] [INFO ] [Real]Absence check using state equation in 251 ms returned sat
[2022-05-17 21:45:50] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2022-05-17 21:45:50] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:50] [INFO ] [Nat]Absence check using state equation in 264 ms returned sat
[2022-05-17 21:45:50] [INFO ] [Nat]Added 230 Read/Feed constraints in 41 ms returned sat
[2022-05-17 21:45:50] [INFO ] Deduced a trap composed of 11 places in 254 ms of which 1 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 11 places in 253 ms of which 0 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 0 ms to minimize.
[2022-05-17 21:45:51] [INFO ] Deduced a trap composed of 39 places in 252 ms of which 2 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 63 places in 253 ms of which 1 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 0 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:45:52] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 11 places in 261 ms of which 0 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 11 places in 250 ms of which 1 ms to minimize.
[2022-05-17 21:45:53] [INFO ] Deduced a trap composed of 50 places in 253 ms of which 1 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 139 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 122 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 75 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:45:54] [INFO ] Deduced a trap composed of 11 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:45:55] [INFO ] Deduced a trap composed of 75 places in 206 ms of which 1 ms to minimize.
[2022-05-17 21:45:55] [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:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-05-17 21:45:55] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2022-05-17 21:45:55] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:55] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2022-05-17 21:45:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2022-05-17 21:45:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2022-05-17 21:45:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:55] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-05-17 21:45:55] [INFO ] [Nat]Added 230 Read/Feed constraints in 43 ms returned sat
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 86 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 43 places in 198 ms of which 1 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 130 places in 196 ms of which 1 ms to minimize.
[2022-05-17 21:45:56] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 0 ms to minimize.
[2022-05-17 21:45:57] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 1 ms to minimize.
[2022-05-17 21:45:57] [INFO ] Deduced a trap composed of 132 places in 199 ms of which 0 ms to minimize.
[2022-05-17 21:45:57] [INFO ] Deduced a trap composed of 27 places in 197 ms of which 1 ms to minimize.
[2022-05-17 21:45:57] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 1 ms to minimize.
[2022-05-17 21:45:58] [INFO ] Deduced a trap composed of 15 places in 194 ms of which 1 ms to minimize.
[2022-05-17 21:45:58] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 0 ms to minimize.
[2022-05-17 21:45:58] [INFO ] Deduced a trap composed of 48 places in 194 ms of which 0 ms to minimize.
[2022-05-17 21:45:58] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2022-05-17 21:45:59] [INFO ] Deduced a trap composed of 146 places in 199 ms of which 0 ms to minimize.
[2022-05-17 21:45:59] [INFO ] Deduced a trap composed of 146 places in 198 ms of which 1 ms to minimize.
[2022-05-17 21:45:59] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:45:59] [INFO ] Deduced a trap composed of 68 places in 196 ms of which 1 ms to minimize.
[2022-05-17 21:46:00] [INFO ] Deduced a trap composed of 11 places in 198 ms of which 1 ms to minimize.
[2022-05-17 21:46:00] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 0 ms to minimize.
[2022-05-17 21:46:00] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 1 ms to minimize.
[2022-05-17 21:46:00] [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 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [5, 6, 6, 180, 5, 180, 1, 1, 1] Max seen :[5, 6, 6, 3, 5, 3, 0, 0, 0]
FORMULA Peterson-PT-5-UpperBounds-06 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 183 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 834 transition count 1094
Reduce places removed 148 places and 0 transitions.
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Iterating post reduction 1 with 296 rules applied. Total rules applied 444 place count 686 transition count 946
Reduce places removed 148 places and 0 transitions.
Iterating post reduction 2 with 148 rules applied. Total rules applied 592 place count 538 transition count 946
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 592 place count 538 transition count 886
Deduced a syphon composed of 60 places in 1 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 712 place count 478 transition count 886
Applied a total of 712 rules in 125 ms. Remains 478 /834 variables (removed 356) and now considering 886/1242 (removed 356) transitions.
Finished structural reductions, in 1 iterations. Remains : 478/834 places, 886/1242 transitions.
Normalized transition count is 766 out of 886 initially.
// Phase 1: matrix 766 rows 478 cols
[2022-05-17 21:46:00] [INFO ] Computed 23 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4901 ms. (steps per millisecond=204 ) properties (out of 5) seen :11
FORMULA Peterson-PT-5-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2204 ms. (steps per millisecond=453 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2295 ms. (steps per millisecond=435 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 938 ms. (steps per millisecond=1066 ) properties (out of 4) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 946 ms. (steps per millisecond=1057 ) properties (out of 4) seen :10
[2022-05-17 21:46:12] [INFO ] Flow matrix only has 766 transitions (discarded 120 similar events)
// Phase 1: matrix 766 rows 478 cols
[2022-05-17 21:46:12] [INFO ] Computed 23 place invariants in 18 ms
[2022-05-17 21:46:12] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 21:46:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:46:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:12] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2022-05-17 21:46:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 21:46:12] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-17 21:46:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:12] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2022-05-17 21:46:12] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:46:12] [INFO ] [Nat]Added 230 Read/Feed constraints in 32 ms returned sat
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 19 places in 136 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 52 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2022-05-17 21:46:16] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 119 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:46:17] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:46:18] [INFO ] Deduced a trap composed of 33 places in 114 ms of which 1 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 45 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 68 places in 111 ms of which 1 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 62 places in 89 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 76 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 1 ms to minimize.
[2022-05-17 21:46:19] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 7015 ms
[2022-05-17 21:46:19] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 50 ms.
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 120 places in 128 ms of which 1 ms to minimize.
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 1 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 1 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 31 places in 125 ms of which 0 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 75 places in 104 ms of which 0 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1909 ms
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 59 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 59 places in 61 ms of which 1 ms to minimize.
[2022-05-17 21:46:29] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2022-05-17 21:46:29] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 646 ms
[2022-05-17 21:46:29] [INFO ] Added : 678 causal constraints over 137 iterations in 9639 ms. Result :sat
Minimization took 444 ms.
[2022-05-17 21:46:29] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:46:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:46:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:30] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2022-05-17 21:46:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:46:30] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:46:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:30] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2022-05-17 21:46:30] [INFO ] [Nat]Added 230 Read/Feed constraints in 33 ms returned sat
[2022-05-17 21:46:30] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 0 ms to minimize.
[2022-05-17 21:46:30] [INFO ] Deduced a trap composed of 21 places in 147 ms of which 0 ms to minimize.
[2022-05-17 21:46:30] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 0 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 1 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 0 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 25 places in 143 ms of which 0 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 1 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 13 places in 146 ms of which 1 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 67 places in 145 ms of which 0 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 1 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 1 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 1 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 1 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 47 places in 96 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 47 places in 118 ms of which 1 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 119 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 1 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 0 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 77 places in 75 ms of which 0 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 1 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 0 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 0 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 45 places in 122 ms of which 1 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 1 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 48 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Trap strengthening (SAT) tested/added 47/46 trap constraints in 7279 ms
[2022-05-17 21:46:37] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 33 ms.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 120 places in 130 ms of which 1 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:46:44] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 0 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 1 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 75 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2022-05-17 21:46:45] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1855 ms
[2022-05-17 21:46:46] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:46:46] [INFO ] Deduced a trap composed of 59 places in 55 ms of which 1 ms to minimize.
[2022-05-17 21:46:46] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2022-05-17 21:46:46] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2022-05-17 21:46:46] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:46:46] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 607 ms
[2022-05-17 21:46:46] [INFO ] Added : 678 causal constraints over 137 iterations in 9082 ms. Result :sat
Minimization took 454 ms.
[2022-05-17 21:46:47] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:46:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 0 ms returned sat
[2022-05-17 21:46:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:47] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2022-05-17 21:46:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 21:46:47] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:46:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:47] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2022-05-17 21:46:47] [INFO ] [Nat]Added 230 Read/Feed constraints in 34 ms returned sat
[2022-05-17 21:46:47] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 1 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 39 places in 127 ms of which 0 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 0 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2022-05-17 21:46:48] [INFO ] Deduced a trap composed of 11 places in 144 ms of which 0 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 27 places in 149 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 32 places in 137 ms of which 1 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 39 places in 139 ms of which 0 ms to minimize.
[2022-05-17 21:46:49] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 31 places in 124 ms of which 1 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:46:50] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:46:51] [INFO ] Trap strengthening (SAT) tested/added 28/27 trap constraints in 4133 ms
[2022-05-17 21:46:51] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 47 ms.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 29 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 47 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 49 places in 134 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 83 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 51 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 126 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 5245 ms
[2022-05-17 21:47:03] [INFO ] Added : 684 causal constraints over 138 iterations in 11884 ms. Result :sat
Minimization took 250 ms.
[2022-05-17 21:47:04] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:47:04] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:04] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-05-17 21:47:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 21:47:04] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:04] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-17 21:47:04] [INFO ] [Nat]Added 230 Read/Feed constraints in 30 ms returned sat
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:47:05] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 25 places in 138 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 50 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:47:06] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 0 ms to minimize.
[2022-05-17 21:47:07] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 33 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 1 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 43 places in 75 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:47:08] [INFO ] Deduced a trap composed of 53 places in 76 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 53 places in 89 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 53 places in 60 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 0 ms to minimize.
[2022-05-17 21:47:09] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 0 ms to minimize.
[2022-05-17 21:47:10] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:47:10] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:10] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:47:10] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 5716 ms
[2022-05-17 21:47:10] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 36 ms.
[2022-05-17 21:47:14] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 0 ms to minimize.
[2022-05-17 21:47:15] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:47:15] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:47:15] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:47:15] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 61 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2100 ms
[2022-05-17 21:47:17] [INFO ] Added : 493 causal constraints over 99 iterations in 6754 ms. Result :sat
Minimization took 184 ms.
Current structural bounds on expressions (after SMT) : [180, 180, 1, 1] Max seen :[5, 5, 0, 0]
Incomplete Parikh walk after 102400 steps, including 1000 resets, run finished after 531 ms. (steps per millisecond=192 ) properties (out of 4) seen :11 could not realise parikh vector
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 106900 steps, including 1000 resets, run finished after 509 ms. (steps per millisecond=210 ) properties (out of 3) seen :12 could not realise parikh vector
Incomplete Parikh walk after 113400 steps, including 1000 resets, run finished after 539 ms. (steps per millisecond=210 ) properties (out of 3) seen :10 could not realise parikh vector
Incomplete Parikh walk after 113400 steps, including 1000 resets, run finished after 534 ms. (steps per millisecond=212 ) properties (out of 3) seen :10 could not realise parikh vector
Support contains 181 out of 478 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 478/478 places, 886/886 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 478 transition count 885
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 4 place count 477 transition count 883
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 6 place count 475 transition count 883
Applied a total of 6 rules in 35 ms. Remains 475 /478 variables (removed 3) and now considering 883/886 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 475/478 places, 883/886 transitions.
Normalized transition count is 763 out of 883 initially.
// Phase 1: matrix 763 rows 475 cols
[2022-05-17 21:47:19] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4834 ms. (steps per millisecond=206 ) properties (out of 3) seen :10
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2277 ms. (steps per millisecond=439 ) properties (out of 3) seen :12
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2278 ms. (steps per millisecond=438 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 3) seen :10
[2022-05-17 21:47:29] [INFO ] Flow matrix only has 763 transitions (discarded 120 similar events)
// Phase 1: matrix 763 rows 475 cols
[2022-05-17 21:47:29] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-17 21:47:29] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned unsat
[2022-05-17 21:47:29] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned unsat
[2022-05-17 21:47:29] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2022-05-17 21:47:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 0 ms returned sat
[2022-05-17 21:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:30] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2022-05-17 21:47:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2022-05-17 21:47:30] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:30] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2022-05-17 21:47:30] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-05-17 21:47:30] [INFO ] [Nat]Added 230 Read/Feed constraints in 42 ms returned sat
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 1 ms to minimize.
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 1 ms to minimize.
[2022-05-17 21:47:30] [INFO ] Deduced a trap composed of 68 places in 134 ms of which 1 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 41 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 0 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2022-05-17 21:47:31] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 0 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 0 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 51 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 1 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 0 ms to minimize.
[2022-05-17 21:47:32] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2022-05-17 21:47:33] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2022-05-17 21:47:33] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 1 ms to minimize.
[2022-05-17 21:47:33] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2022-05-17 21:47:33] [INFO ] Deduced a trap composed of 37 places in 124 ms of which 1 ms to minimize.
[2022-05-17 21:47:33] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 0 ms to minimize.
[2022-05-17 21:47:33] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 0 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 33 places in 121 ms of which 0 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 55 places in 119 ms of which 1 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 41 places in 121 ms of which 0 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 0 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:47:34] [INFO ] Deduced a trap composed of 44 places in 116 ms of which 1 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 1 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 0 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 49 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 0 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 1 ms to minimize.
[2022-05-17 21:47:35] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 0 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 53 places in 109 ms of which 1 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 0 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:36] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 6515 ms
[2022-05-17 21:47:36] [INFO ] Computed and/alt/rep : 697/1753/697 causal constraints (skipped 60 transitions) in 33 ms.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 112 places in 106 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 0 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2022-05-17 21:47:44] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1498 ms
[2022-05-17 21:47:44] [INFO ] Added : 678 causal constraints over 136 iterations in 7907 ms. Result :sat
Minimization took 323 ms.
Current structural bounds on expressions (after SMT) : [6, 6, 1] Max seen :[6, 6, 0]
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 138000 steps, including 1000 resets, run finished after 185 ms. (steps per millisecond=745 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 475 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions, iteration 0 : 475/475 places, 881/881 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 474 transition count 825
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 419 transition count 825
Performed 125 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 125 Pre rules applied. Total rules applied 111 place count 419 transition count 700
Deduced a syphon composed of 125 places in 1 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 250 rules applied. Total rules applied 361 place count 294 transition count 700
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 419 place count 265 transition count 671
Applied a total of 419 rules in 41 ms. Remains 265 /475 variables (removed 210) and now considering 671/881 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 265/475 places, 671/881 transitions.
Normalized transition count is 551 out of 671 initially.
// Phase 1: matrix 551 rows 265 cols
[2022-05-17 21:47:45] [INFO ] Computed 23 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1450 ms. (steps per millisecond=689 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 448 ms. (steps per millisecond=2232 ) properties (out of 1) seen :0
[2022-05-17 21:47:47] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 265 cols
[2022-05-17 21:47:47] [INFO ] Computed 23 place invariants in 10 ms
[2022-05-17 21:47:47] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 21:47:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:47] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-17 21:47:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-17 21:47:47] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-17 21:47:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:47] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2022-05-17 21:47:47] [INFO ] State equation strengthened by 229 read => feed constraints.
[2022-05-17 21:47:47] [INFO ] [Nat]Added 229 Read/Feed constraints in 23 ms returned sat
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:47] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:48] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 928 ms
[2022-05-17 21:47:48] [INFO ] Computed and/alt/rep : 485/1534/485 causal constraints (skipped 60 transitions) in 31 ms.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2022-05-17 21:47:50] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:47:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 785 ms
[2022-05-17 21:47:51] [INFO ] Added : 238 causal constraints over 49 iterations in 2536 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 95600 steps, including 1000 resets, run finished after 146 ms. (steps per millisecond=654 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 265 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 265/265 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 265 /265 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 265/265 places, 671/671 transitions.
Starting structural reductions, iteration 0 : 265/265 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 265 /265 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2022-05-17 21:47:51] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 265 cols
[2022-05-17 21:47:51] [INFO ] Computed 23 place invariants in 5 ms
[2022-05-17 21:47:51] [INFO ] Implicit Places using invariants in 173 ms returned [229, 241, 242, 243, 244, 245]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 176 ms to find 6 implicit places.
[2022-05-17 21:47:51] [INFO ] Redundant transitions in 43 ms returned []
[2022-05-17 21:47:51] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:51] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 21:47:51] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Starting structural reductions, iteration 1 : 259/265 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2022-05-17 21:47:51] [INFO ] Redundant transitions in 16 ms returned []
[2022-05-17 21:47:51] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:51] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 21:47:52] [INFO ] Dead Transitions using invariants and state equation in 231 ms returned []
Finished structural reductions, in 2 iterations. Remains : 259/265 places, 671/671 transitions.
Normalized transition count is 551 out of 671 initially.
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:52] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1527 ms. (steps per millisecond=654 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 1) seen :0
[2022-05-17 21:47:54] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:54] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 21:47:54] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 21:47:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:54] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2022-05-17 21:47:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2022-05-17 21:47:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:54] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2022-05-17 21:47:54] [INFO ] State equation strengthened by 229 read => feed constraints.
[2022-05-17 21:47:54] [INFO ] [Nat]Added 229 Read/Feed constraints in 23 ms returned sat
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 59 places in 82 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:54] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 1 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2022-05-17 21:47:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 814 ms
[2022-05-17 21:47:55] [INFO ] Computed and/alt/rep : 485/1534/485 causal constraints (skipped 60 transitions) in 28 ms.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 442 ms
[2022-05-17 21:47:57] [INFO ] Added : 202 causal constraints over 42 iterations in 1868 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 73900 steps, including 1000 resets, run finished after 111 ms. (steps per millisecond=665 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 14 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2022-05-17 21:47:57] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:57] [INFO ] Computed 17 place invariants in 4 ms
[2022-05-17 21:47:57] [INFO ] Implicit Places using invariants in 148 ms returned []
[2022-05-17 21:47:57] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:57] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:47:57] [INFO ] State equation strengthened by 229 read => feed constraints.
[2022-05-17 21:47:58] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2022-05-17 21:47:58] [INFO ] Redundant transitions in 5 ms returned []
[2022-05-17 21:47:58] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:58] [INFO ] Computed 17 place invariants in 2 ms
[2022-05-17 21:47:58] [INFO ] Dead Transitions using invariants and state equation in 211 ms returned []
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 671/671 transitions.
Starting property specific reduction for Peterson-PT-5-UpperBounds-09
Normalized transition count is 551 out of 671 initially.
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:58] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2022-05-17 21:47:58] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:47:58] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 21:47:58] [INFO ] [Real]Absence check using 17 positive place invariants in 5 ms returned sat
[2022-05-17 21:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:58] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-17 21:47:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 21:47:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:58] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2022-05-17 21:47:58] [INFO ] State equation strengthened by 229 read => feed constraints.
[2022-05-17 21:47:58] [INFO ] [Nat]Added 229 Read/Feed constraints in 21 ms returned sat
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 772 ms
[2022-05-17 21:47:59] [INFO ] Computed and/alt/rep : 485/1534/485 causal constraints (skipped 60 transitions) in 29 ms.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 0 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 451 ms
[2022-05-17 21:48:01] [INFO ] Added : 202 causal constraints over 42 iterations in 1877 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 73900 steps, including 998 resets, run finished after 107 ms. (steps per millisecond=690 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 12 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 671/671 transitions.
Normalized transition count is 551 out of 671 initially.
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:48:01] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1460 ms. (steps per millisecond=684 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 1) seen :0
[2022-05-17 21:48:03] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:48:03] [INFO ] Computed 17 place invariants in 5 ms
[2022-05-17 21:48:03] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 21:48:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:03] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2022-05-17 21:48:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:48:03] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2022-05-17 21:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:03] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-17 21:48:03] [INFO ] State equation strengthened by 229 read => feed constraints.
[2022-05-17 21:48:03] [INFO ] [Nat]Added 229 Read/Feed constraints in 19 ms returned sat
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 41 places in 67 ms of which 0 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 0 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 0 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 787 ms
[2022-05-17 21:48:04] [INFO ] Computed and/alt/rep : 485/1534/485 causal constraints (skipped 60 transitions) in 30 ms.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 0 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 434 ms
[2022-05-17 21:48:06] [INFO ] Added : 202 causal constraints over 42 iterations in 1870 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 73900 steps, including 999 resets, run finished after 115 ms. (steps per millisecond=642 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 259 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 671/671 transitions.
Starting structural reductions, iteration 0 : 259/259 places, 671/671 transitions.
Applied a total of 0 rules in 9 ms. Remains 259 /259 variables (removed 0) and now considering 671/671 (removed 0) transitions.
[2022-05-17 21:48:06] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:48:06] [INFO ] Computed 17 place invariants in 3 ms
[2022-05-17 21:48:07] [INFO ] Implicit Places using invariants in 149 ms returned []
[2022-05-17 21:48:07] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:48:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 21:48:07] [INFO ] State equation strengthened by 229 read => feed constraints.
[2022-05-17 21:48:07] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 869 ms to find 0 implicit places.
[2022-05-17 21:48:07] [INFO ] Redundant transitions in 8 ms returned []
[2022-05-17 21:48:07] [INFO ] Flow matrix only has 551 transitions (discarded 120 similar events)
// Phase 1: matrix 551 rows 259 cols
[2022-05-17 21:48:07] [INFO ] Computed 17 place invariants in 1 ms
[2022-05-17 21:48:07] [INFO ] Dead Transitions using invariants and state equation in 228 ms returned []
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 671/671 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-09 in 9465 ms.
[2022-05-17 21:48:08] [INFO ] Flatten gal took : 80 ms
[2022-05-17 21:48:08] [INFO ] Applying decomposition
[2022-05-17 21:48:08] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17266273182547833886.txt, -o, /tmp/graph17266273182547833886.bin, -w, /tmp/graph17266273182547833886.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17266273182547833886.bin, -l, -1, -v, -w, /tmp/graph17266273182547833886.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 21:48:08] [INFO ] Decomposing Gal with order
[2022-05-17 21:48:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:48:08] [INFO ] Removed a total of 910 redundant transitions.
[2022-05-17 21:48:08] [INFO ] Flatten gal took : 103 ms
[2022-05-17 21:48:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 242 labels/synchronizations in 21 ms.
[2022-05-17 21:48:08] [INFO ] Time to serialize gal into /tmp/UpperBounds9683503420484858380.gal : 11 ms
[2022-05-17 21:48:08] [INFO ] Time to serialize properties into /tmp/UpperBounds15251475472036075927.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds9683503420484858380.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds15251475472036075927.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds9683503420484858380.gal -t CGAL -reachable-file /tmp/UpperBounds15251475472036075927.prop --nowitness
Loading property file /tmp/UpperBounds15251475472036075927.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.90813e+08,778.399,5845884,127169,1262,1.01028e+07,11205,1401,1.61752e+07,134,115487,0
Total reachable state count : 290812670

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Peterson-PT-5-UpperBounds-09 :0 <= i6.u33.TestAlone_0_1_5 <= 1
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Peterson-PT-5-UpperBounds-09,0,787.272,5845884,1,0,1.01028e+07,11205,1557,1.61752e+07,151,115487,1336

BK_STOP 1652824877847

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is Peterson-PT-5, 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 r179-tall-165277026700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;