MCC'2022- Execution of r179-tall-165277026700031

About the Execution of 2021-gold for Peterson-PT-6

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16248.476	3600000.00	2672480.00	599448.80	7 7 7 ? 7 7 7 7 1 1 1 1 1 1 1 ?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r179-tall-165277026700031.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-6, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700031
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.9M
-rw-r--r-- 1 mcc users 230K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 935K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 857K Apr 30 09:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 96K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 275K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 89K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 293K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 40K 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 877K 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-6-UpperBounds-00
FORMULA_NAME Peterson-PT-6-UpperBounds-01
FORMULA_NAME Peterson-PT-6-UpperBounds-02
FORMULA_NAME Peterson-PT-6-UpperBounds-03
FORMULA_NAME Peterson-PT-6-UpperBounds-04
FORMULA_NAME Peterson-PT-6-UpperBounds-05
FORMULA_NAME Peterson-PT-6-UpperBounds-06
FORMULA_NAME Peterson-PT-6-UpperBounds-07
FORMULA_NAME Peterson-PT-6-UpperBounds-08
FORMULA_NAME Peterson-PT-6-UpperBounds-09
FORMULA_NAME Peterson-PT-6-UpperBounds-10
FORMULA_NAME Peterson-PT-6-UpperBounds-11
FORMULA_NAME Peterson-PT-6-UpperBounds-12
FORMULA_NAME Peterson-PT-6-UpperBounds-13
FORMULA_NAME Peterson-PT-6-UpperBounds-14
FORMULA_NAME Peterson-PT-6-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652823953453

Running Version 0
[2022-05-17 21:45:55] [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:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:45:55] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2022-05-17 21:45:55] [INFO ] Transformed 1330 places.
[2022-05-17 21:45:55] [INFO ] Transformed 2030 transitions.
[2022-05-17 21:45:55] [INFO ] Found NUPN structural information;
[2022-05-17 21:45:55] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2022-05-17 21:45:55] [INFO ] Parsed PT model containing 1330 places and 2030 transitions in 176 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
FORMULA Peterson-PT-6-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1820 out of 2030 initially.
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 21:45:55] [INFO ] Computed 27 place invariants in 43 ms
FORMULA Peterson-PT-6-UpperBounds-07 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-UpperBounds-02 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 13) seen :31
FORMULA Peterson-PT-6-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 8) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :29
[2022-05-17 21:45:55] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-05-17 21:45:55] [INFO ] Computed 27 place invariants in 13 ms
[2022-05-17 21:45:56] [INFO ] [Real]Absence check using 20 positive place invariants in 34 ms returned unsat
[2022-05-17 21:45:56] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned unsat
[2022-05-17 21:45:56] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-05-17 21:45:56] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 21:45:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:57] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2022-05-17 21:45:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:45:57] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2022-05-17 21:45:57] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 21:45:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:45:58] [INFO ] [Nat]Absence check using state equation in 503 ms returned sat
[2022-05-17 21:45:58] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:45:58] [INFO ] [Nat]Added 366 Read/Feed constraints in 93 ms returned sat
[2022-05-17 21:45:58] [INFO ] Deduced a trap composed of 133 places in 589 ms of which 8 ms to minimize.
[2022-05-17 21:45:59] [INFO ] Deduced a trap composed of 133 places in 562 ms of which 2 ms to minimize.
[2022-05-17 21:46:00] [INFO ] Deduced a trap composed of 133 places in 571 ms of which 2 ms to minimize.
[2022-05-17 21:46:00] [INFO ] Deduced a trap composed of 133 places in 571 ms of which 2 ms to minimize.
[2022-05-17 21:46:01] [INFO ] Deduced a trap composed of 133 places in 525 ms of which 2 ms to minimize.
[2022-05-17 21:46:01] [INFO ] Deduced a trap composed of 133 places in 515 ms of which 1 ms to minimize.
[2022-05-17 21:46:02] [INFO ] Deduced a trap composed of 12 places in 533 ms of which 1 ms to minimize.
[2022-05-17 21:46:02] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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:46:02] [INFO ] [Real]Absence check using 20 positive place invariants in 32 ms returned unsat
[2022-05-17 21:46:03] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned unsat
[2022-05-17 21:46:03] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned unsat
[2022-05-17 21:46:03] [INFO ] [Real]Absence check using 20 positive place invariants in 38 ms returned sat
[2022-05-17 21:46:03] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 21:46:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:03] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2022-05-17 21:46:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2022-05-17 21:46:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 21:46:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:04] [INFO ] [Nat]Absence check using state equation in 459 ms returned sat
[2022-05-17 21:46:04] [INFO ] [Nat]Added 366 Read/Feed constraints in 104 ms returned sat
[2022-05-17 21:46:05] [INFO ] Deduced a trap composed of 23 places in 474 ms of which 1 ms to minimize.
[2022-05-17 21:46:05] [INFO ] Deduced a trap composed of 223 places in 455 ms of which 0 ms to minimize.
[2022-05-17 21:46:06] [INFO ] Deduced a trap composed of 246 places in 453 ms of which 1 ms to minimize.
[2022-05-17 21:46:06] [INFO ] Deduced a trap composed of 224 places in 473 ms of which 1 ms to minimize.
[2022-05-17 21:46:07] [INFO ] Deduced a trap composed of 246 places in 483 ms of which 0 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 254 places in 464 ms of which 1 ms to minimize.
[2022-05-17 21:46:08] [INFO ] Deduced a trap composed of 181 places in 519 ms of which 1 ms to minimize.
[2022-05-17 21:46:09] [INFO ] Deduced a trap composed of 181 places in 473 ms of which 1 ms to minimize.
[2022-05-17 21:46:09] [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:46:09] [INFO ] [Real]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-05-17 21:46:09] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 21:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:09] [INFO ] [Real]Absence check using state equation in 499 ms returned sat
[2022-05-17 21:46:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-05-17 21:46:10] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 21:46:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:10] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2022-05-17 21:46:10] [INFO ] [Nat]Added 366 Read/Feed constraints in 114 ms returned sat
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 231 places in 502 ms of which 1 ms to minimize.
[2022-05-17 21:46:11] [INFO ] Deduced a trap composed of 175 places in 485 ms of which 1 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 175 places in 482 ms of which 0 ms to minimize.
[2022-05-17 21:46:12] [INFO ] Deduced a trap composed of 174 places in 439 ms of which 1 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 0 ms to minimize.
[2022-05-17 21:46:13] [INFO ] Deduced a trap composed of 26 places in 380 ms of which 0 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 25 places in 375 ms of which 1 ms to minimize.
[2022-05-17 21:46:14] [INFO ] Deduced a trap composed of 26 places in 378 ms of which 0 ms to minimize.
[2022-05-17 21:46:15] [INFO ] Deduced a trap composed of 26 places in 361 ms of which 1 ms to minimize.
[2022-05-17 21:46:15] [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)
Current structural bounds on expressions (after SMT) : [7, 7, 294, 7, 7, 7, 1, 1] Max seen :[7, 7, 4, 7, 7, 7, 0, 0]
FORMULA Peterson-PT-6-UpperBounds-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-01 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-6-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 295 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 252 transitions
Trivial Post-agglo rules discarded 252 transitions
Performed 252 trivial Post agglomeration. Transition count delta: 252
Iterating post reduction 0 with 252 rules applied. Total rules applied 252 place count 1330 transition count 1778
Reduce places removed 252 places and 0 transitions.
Performed 251 Post agglomeration using F-continuation condition.Transition count delta: 251
Iterating post reduction 1 with 503 rules applied. Total rules applied 755 place count 1078 transition count 1527
Reduce places removed 251 places and 0 transitions.
Iterating post reduction 2 with 251 rules applied. Total rules applied 1006 place count 827 transition count 1527
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 1006 place count 827 transition count 1443
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 1174 place count 743 transition count 1443
Applied a total of 1174 rules in 202 ms. Remains 743 /1330 variables (removed 587) and now considering 1443/2030 (removed 587) transitions.
Finished structural reductions, in 1 iterations. Remains : 743/1330 places, 1443/2030 transitions.
Normalized transition count is 1233 out of 1443 initially.
// Phase 1: matrix 1233 rows 743 cols
[2022-05-17 21:46:15] [INFO ] Computed 27 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4802 ms. (steps per millisecond=208 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3035 ms. (steps per millisecond=329 ) properties (out of 3) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 864 ms. (steps per millisecond=1157 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 873 ms. (steps per millisecond=1145 ) properties (out of 3) seen :5
[2022-05-17 21:46:25] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 743 cols
[2022-05-17 21:46:25] [INFO ] Computed 27 place invariants in 15 ms
[2022-05-17 21:46:25] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:46:25] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 21:46:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:25] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-17 21:46:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:25] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-17 21:46:25] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 21:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:25] [INFO ] [Nat]Absence check using state equation in 281 ms returned sat
[2022-05-17 21:46:25] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:46:25] [INFO ] [Nat]Added 366 Read/Feed constraints in 59 ms returned sat
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 0 ms to minimize.
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 76 places in 259 ms of which 1 ms to minimize.
[2022-05-17 21:46:26] [INFO ] Deduced a trap composed of 72 places in 257 ms of which 0 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 59 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 74 places in 253 ms of which 1 ms to minimize.
[2022-05-17 21:46:27] [INFO ] Deduced a trap composed of 94 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 74 places in 258 ms of which 1 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 0 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 28 places in 249 ms of which 1 ms to minimize.
[2022-05-17 21:46:28] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2022-05-17 21:46:29] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 1 ms to minimize.
[2022-05-17 21:46:29] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 1 ms to minimize.
[2022-05-17 21:46:29] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:46:30] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:46:30] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:46:30] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 1 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 76 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:46:31] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 1 ms to minimize.
[2022-05-17 21:46:32] [INFO ] Deduced a trap composed of 70 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 49 places in 249 ms of which 1 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 10 places in 244 ms of which 0 ms to minimize.
[2022-05-17 21:46:33] [INFO ] Deduced a trap composed of 116 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:46:34] [INFO ] Deduced a trap composed of 30 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 29 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 26 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:46:35] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 1 ms to minimize.
[2022-05-17 21:46:36] [INFO ] Deduced a trap composed of 68 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 46 places in 193 ms of which 0 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 36 places in 186 ms of which 1 ms to minimize.
[2022-05-17 21:46:37] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 1 ms to minimize.
[2022-05-17 21:46:38] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 0 ms to minimize.
[2022-05-17 21:46:38] [INFO ] Deduced a trap composed of 54 places in 166 ms of which 0 ms to minimize.
[2022-05-17 21:46:38] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 0 ms to minimize.
[2022-05-17 21:46:38] [INFO ] Deduced a trap composed of 54 places in 158 ms of which 1 ms to minimize.
[2022-05-17 21:46:38] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:46:39] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 0 ms to minimize.
[2022-05-17 21:46:39] [INFO ] Deduced a trap composed of 54 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:46:39] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 13351 ms
[2022-05-17 21:46:39] [INFO ] Computed and/alt/rep : 1142/3165/1142 causal constraints (skipped 84 transitions) in 75 ms.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 0 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Deduced a trap composed of 66 places in 143 ms of which 1 ms to minimize.
[2022-05-17 21:46:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 781 ms
[2022-05-17 21:46:56] [INFO ] Added : 1110 causal constraints over 223 iterations in 17614 ms. Result :sat
Minimization took 761 ms.
[2022-05-17 21:46:57] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:46:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 21:46:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:58] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2022-05-17 21:46:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:46:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2022-05-17 21:46:58] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 21:46:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:46:58] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2022-05-17 21:46:58] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2022-05-17 21:46:58] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 112 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:46:59] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:47:00] [INFO ] Deduced a trap composed of 27 places in 235 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 44 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 1 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 66 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:47:01] [INFO ] Deduced a trap composed of 32 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 36 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:47:02] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 0 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 38 places in 198 ms of which 1 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 1 ms to minimize.
[2022-05-17 21:47:03] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:47:04] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6301 ms
[2022-05-17 21:47:04] [INFO ] Computed and/alt/rep : 1142/3165/1142 causal constraints (skipped 84 transitions) in 59 ms.
[2022-05-17 21:47:12] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2022-05-17 21:47:13] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:47:13] [INFO ] Deduced a trap composed of 42 places in 203 ms of which 1 ms to minimize.
[2022-05-17 21:47:13] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 1 ms to minimize.
[2022-05-17 21:47:13] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 0 ms to minimize.
[2022-05-17 21:47:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1486 ms
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 14 places in 197 ms of which 0 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 2 ms to minimize.
[2022-05-17 21:47:16] [INFO ] Deduced a trap composed of 157 places in 188 ms of which 0 ms to minimize.
[2022-05-17 21:47:17] [INFO ] Deduced a trap composed of 76 places in 194 ms of which 0 ms to minimize.
[2022-05-17 21:47:17] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 1 ms to minimize.
[2022-05-17 21:47:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1434 ms
[2022-05-17 21:47:17] [INFO ] Added : 700 causal constraints over 141 iterations in 12910 ms. Result :sat
Minimization took 354 ms.
[2022-05-17 21:47:18] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:47:18] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 21:47:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:18] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-05-17 21:47:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-17 21:47:18] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2022-05-17 21:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:19] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2022-05-17 21:47:19] [INFO ] [Nat]Added 366 Read/Feed constraints in 50 ms returned sat
[2022-05-17 21:47:19] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:47:19] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:47:19] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:47:20] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:47:20] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:47:20] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 1 ms to minimize.
[2022-05-17 21:47:21] [INFO ] Deduced a trap composed of 76 places in 212 ms of which 0 ms to minimize.
[2022-05-17 21:47:21] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:47:21] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 1 ms to minimize.
[2022-05-17 21:47:21] [INFO ] Deduced a trap composed of 171 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:47:22] [INFO ] Deduced a trap composed of 70 places in 214 ms of which 1 ms to minimize.
[2022-05-17 21:47:22] [INFO ] Deduced a trap composed of 60 places in 217 ms of which 1 ms to minimize.
[2022-05-17 21:47:22] [INFO ] Deduced a trap composed of 28 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:47:22] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:47:23] [INFO ] Deduced a trap composed of 43 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:47:23] [INFO ] Deduced a trap composed of 80 places in 217 ms of which 0 ms to minimize.
[2022-05-17 21:47:23] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:47:23] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:47:24] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 0 ms to minimize.
[2022-05-17 21:47:24] [INFO ] Deduced a trap composed of 111 places in 199 ms of which 0 ms to minimize.
[2022-05-17 21:47:24] [INFO ] Deduced a trap composed of 70 places in 197 ms of which 1 ms to minimize.
[2022-05-17 21:47:24] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 0 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 1 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 1 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 54 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:47:25] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 0 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 1 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 0 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 0 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 76 places in 173 ms of which 0 ms to minimize.
[2022-05-17 21:47:26] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 0 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 0 ms to minimize.
[2022-05-17 21:47:27] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 0 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 0 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 1 ms to minimize.
[2022-05-17 21:47:28] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 9797 ms
[2022-05-17 21:47:28] [INFO ] Computed and/alt/rep : 1142/3165/1142 causal constraints (skipped 84 transitions) in 61 ms.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 0 ms to minimize.
[2022-05-17 21:47:39] [INFO ] Deduced a trap composed of 69 places in 217 ms of which 0 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 1 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 0 ms to minimize.
[2022-05-17 21:47:40] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 0 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 74 places in 212 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 62 places in 203 ms of which 1 ms to minimize.
[2022-05-17 21:47:41] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 43 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 44 places in 217 ms of which 1 ms to minimize.
[2022-05-17 21:47:42] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 0 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 1 ms to minimize.
[2022-05-17 21:47:43] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4486 ms
[2022-05-17 21:47:43] [INFO ] Added : 735 causal constraints over 148 iterations in 14723 ms. Result :sat
Minimization took 375 ms.
Current structural bounds on expressions (after SMT) : [294, 1, 1] Max seen :[6, 0, 0]
Incomplete Parikh walk after 184800 steps, including 1000 resets, run finished after 844 ms. (steps per millisecond=218 ) properties (out of 3) seen :4 could not realise parikh vector
FORMULA Peterson-PT-6-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 99000 steps, including 1000 resets, run finished after 452 ms. (steps per millisecond=219 ) properties (out of 2) seen :4 could not realise parikh vector
Incomplete Parikh walk after 208100 steps, including 1000 resets, run finished after 960 ms. (steps per millisecond=216 ) properties (out of 2) seen :5 could not realise parikh vector
Support contains 295 out of 743 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 743/743 places, 1443/1443 transitions.
Applied a total of 0 rules in 33 ms. Remains 743 /743 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 743/743 places, 1443/1443 transitions.
Normalized transition count is 1233 out of 1443 initially.
// Phase 1: matrix 1233 rows 743 cols
[2022-05-17 21:47:46] [INFO ] Computed 27 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4675 ms. (steps per millisecond=213 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3137 ms. (steps per millisecond=318 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 2) seen :6
[2022-05-17 21:47:55] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 743 cols
[2022-05-17 21:47:55] [INFO ] Computed 27 place invariants in 18 ms
[2022-05-17 21:47:55] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:47:55] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2022-05-17 21:47:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:55] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2022-05-17 21:47:55] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:47:55] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-17 21:47:55] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2022-05-17 21:47:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:47:55] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-17 21:47:55] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:47:55] [INFO ] [Nat]Added 366 Read/Feed constraints in 54 ms returned sat
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 0 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 76 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:47:56] [INFO ] Deduced a trap composed of 72 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 1 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 0 ms to minimize.
[2022-05-17 21:47:57] [INFO ] Deduced a trap composed of 94 places in 265 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 74 places in 269 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 20 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:47:58] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 1 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 74 places in 267 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 21 places in 267 ms of which 0 ms to minimize.
[2022-05-17 21:47:59] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 10 places in 265 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 1 ms to minimize.
[2022-05-17 21:48:00] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 0 ms to minimize.
[2022-05-17 21:48:01] [INFO ] Deduced a trap composed of 76 places in 267 ms of which 1 ms to minimize.
[2022-05-17 21:48:02] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 1 ms to minimize.
[2022-05-17 21:48:02] [INFO ] Deduced a trap composed of 58 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:48:02] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:48:03] [INFO ] Deduced a trap composed of 70 places in 262 ms of which 1 ms to minimize.
[2022-05-17 21:48:03] [INFO ] Deduced a trap composed of 49 places in 266 ms of which 0 ms to minimize.
[2022-05-17 21:48:03] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 0 ms to minimize.
[2022-05-17 21:48:03] [INFO ] Deduced a trap composed of 116 places in 265 ms of which 1 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:48:04] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:48:05] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:48:05] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:48:05] [INFO ] Deduced a trap composed of 26 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 13 places in 252 ms of which 1 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 27 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:48:06] [INFO ] Deduced a trap composed of 62 places in 246 ms of which 1 ms to minimize.
[2022-05-17 21:48:07] [INFO ] Deduced a trap composed of 68 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:48:07] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:48:07] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:48:07] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 0 ms to minimize.
[2022-05-17 21:48:08] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 0 ms to minimize.
[2022-05-17 21:48:08] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 1 ms to minimize.
[2022-05-17 21:48:08] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 1 ms to minimize.
[2022-05-17 21:48:08] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 0 ms to minimize.
[2022-05-17 21:48:09] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 0 ms to minimize.
[2022-05-17 21:48:09] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 0 ms to minimize.
[2022-05-17 21:48:09] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 0 ms to minimize.
[2022-05-17 21:48:09] [INFO ] Deduced a trap composed of 54 places in 179 ms of which 0 ms to minimize.
[2022-05-17 21:48:09] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 13904 ms
[2022-05-17 21:48:09] [INFO ] Computed and/alt/rep : 1142/3165/1142 causal constraints (skipped 84 transitions) in 57 ms.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 102 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 1 ms to minimize.
[2022-05-17 21:48:26] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 1 ms to minimize.
[2022-05-17 21:48:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 782 ms
[2022-05-17 21:48:27] [INFO ] Added : 1110 causal constraints over 223 iterations in 17370 ms. Result :sat
Minimization took 731 ms.
[2022-05-17 21:48:28] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:48:28] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 21:48:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:28] [INFO ] [Real]Absence check using state equation in 245 ms returned sat
[2022-05-17 21:48:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:48:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:48:28] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 1 ms returned sat
[2022-05-17 21:48:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:48:28] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-05-17 21:48:28] [INFO ] [Nat]Added 366 Read/Feed constraints in 44 ms returned sat
[2022-05-17 21:48:29] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:48:29] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:48:29] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2022-05-17 21:48:29] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:48:30] [INFO ] Deduced a trap composed of 12 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:48:30] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:48:30] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:48:30] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 0 ms to minimize.
[2022-05-17 21:48:31] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:48:31] [INFO ] Deduced a trap composed of 171 places in 208 ms of which 0 ms to minimize.
[2022-05-17 21:48:31] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 1 ms to minimize.
[2022-05-17 21:48:31] [INFO ] Deduced a trap composed of 60 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:48:32] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 1 ms to minimize.
[2022-05-17 21:48:32] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 0 ms to minimize.
[2022-05-17 21:48:32] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:48:32] [INFO ] Deduced a trap composed of 80 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:48:33] [INFO ] Deduced a trap composed of 47 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:48:33] [INFO ] Deduced a trap composed of 18 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:48:33] [INFO ] Deduced a trap composed of 66 places in 215 ms of which 0 ms to minimize.
[2022-05-17 21:48:34] [INFO ] Deduced a trap composed of 111 places in 222 ms of which 1 ms to minimize.
[2022-05-17 21:48:34] [INFO ] Deduced a trap composed of 70 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:48:34] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:48:34] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 1 ms to minimize.
[2022-05-17 21:48:35] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 1 ms to minimize.
[2022-05-17 21:48:35] [INFO ] Deduced a trap composed of 54 places in 185 ms of which 0 ms to minimize.
[2022-05-17 21:48:35] [INFO ] Deduced a trap composed of 79 places in 191 ms of which 0 ms to minimize.
[2022-05-17 21:48:35] [INFO ] Deduced a trap composed of 46 places in 177 ms of which 0 ms to minimize.
[2022-05-17 21:48:36] [INFO ] Deduced a trap composed of 46 places in 181 ms of which 1 ms to minimize.
[2022-05-17 21:48:36] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 0 ms to minimize.
[2022-05-17 21:48:36] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 0 ms to minimize.
[2022-05-17 21:48:36] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 0 ms to minimize.
[2022-05-17 21:48:36] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:48:37] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 1 ms to minimize.
[2022-05-17 21:48:37] [INFO ] Deduced a trap composed of 26 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:48:37] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 0 ms to minimize.
[2022-05-17 21:48:37] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 0 ms to minimize.
[2022-05-17 21:48:37] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Deduced a trap composed of 92 places in 141 ms of which 1 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:48:38] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 9884 ms
[2022-05-17 21:48:38] [INFO ] Computed and/alt/rep : 1142/3165/1142 causal constraints (skipped 84 transitions) in 61 ms.
[2022-05-17 21:48:48] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 28 places in 205 ms of which 0 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 0 ms to minimize.
[2022-05-17 21:48:49] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 0 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 1 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 0 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 74 places in 191 ms of which 0 ms to minimize.
[2022-05-17 21:48:50] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 0 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 0 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 1 ms to minimize.
[2022-05-17 21:48:51] [INFO ] Deduced a trap composed of 43 places in 199 ms of which 0 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 0 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 1 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 18 places in 199 ms of which 2 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:48:52] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4247 ms
[2022-05-17 21:48:53] [INFO ] Added : 735 causal constraints over 148 iterations in 14424 ms. Result :sat
Minimization took 367 ms.
Current structural bounds on expressions (after SMT) : [294, 1] Max seen :[6, 0]
Incomplete Parikh walk after 184800 steps, including 1000 resets, run finished after 836 ms. (steps per millisecond=221 ) properties (out of 2) seen :3 could not realise parikh vector
Incomplete Parikh walk after 208100 steps, including 1000 resets, run finished after 978 ms. (steps per millisecond=212 ) properties (out of 2) seen :5 could not realise parikh vector
Support contains 295 out of 743 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 743/743 places, 1443/1443 transitions.
Applied a total of 0 rules in 32 ms. Remains 743 /743 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 743/743 places, 1443/1443 transitions.
Starting structural reductions, iteration 0 : 743/743 places, 1443/1443 transitions.
Applied a total of 0 rules in 23 ms. Remains 743 /743 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
[2022-05-17 21:48:55] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 743 cols
[2022-05-17 21:48:55] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 21:48:55] [INFO ] Implicit Places using invariants in 416 ms returned [715, 716, 718, 735, 736, 737, 738]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 420 ms to find 7 implicit places.
[2022-05-17 21:48:55] [INFO ] Redundant transitions in 98 ms returned []
[2022-05-17 21:48:55] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:48:55] [INFO ] Computed 20 place invariants in 13 ms
[2022-05-17 21:48:56] [INFO ] Dead Transitions using invariants and state equation in 524 ms returned []
Starting structural reductions, iteration 1 : 736/743 places, 1443/1443 transitions.
Applied a total of 0 rules in 22 ms. Remains 736 /736 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
[2022-05-17 21:48:56] [INFO ] Redundant transitions in 69 ms returned []
[2022-05-17 21:48:56] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:48:56] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 21:48:57] [INFO ] Dead Transitions using invariants and state equation in 511 ms returned []
Finished structural reductions, in 2 iterations. Remains : 736/743 places, 1443/1443 transitions.
Normalized transition count is 1233 out of 1443 initially.
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:48:57] [INFO ] Computed 20 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4691 ms. (steps per millisecond=213 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3103 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 860 ms. (steps per millisecond=1162 ) properties (out of 2) seen :6
[2022-05-17 21:49:05] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:49:05] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 21:49:05] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:49:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:06] [INFO ] [Real]Absence check using state equation in 270 ms returned sat
[2022-05-17 21:49:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:49:06] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 21:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:06] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2022-05-17 21:49:06] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:49:06] [INFO ] [Nat]Added 366 Read/Feed constraints in 66 ms returned sat
[2022-05-17 21:49:06] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:49:07] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 0 ms to minimize.
[2022-05-17 21:49:07] [INFO ] Deduced a trap composed of 28 places in 238 ms of which 0 ms to minimize.
[2022-05-17 21:49:07] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:49:08] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:49:08] [INFO ] Deduced a trap composed of 26 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:49:08] [INFO ] Deduced a trap composed of 14 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:49:08] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:49:09] [INFO ] Deduced a trap composed of 14 places in 251 ms of which 1 ms to minimize.
[2022-05-17 21:49:09] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:49:09] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:49:10] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:49:10] [INFO ] Deduced a trap composed of 22 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:49:10] [INFO ] Deduced a trap composed of 45 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:49:10] [INFO ] Deduced a trap composed of 43 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:49:11] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 0 ms to minimize.
[2022-05-17 21:49:11] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 1 ms to minimize.
[2022-05-17 21:49:11] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 0 ms to minimize.
[2022-05-17 21:49:12] [INFO ] Deduced a trap composed of 43 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:49:12] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:49:12] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 0 ms to minimize.
[2022-05-17 21:49:12] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:49:13] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:49:13] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 1 ms to minimize.
[2022-05-17 21:49:13] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 7 ms to minimize.
[2022-05-17 21:49:13] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:49:14] [INFO ] Deduced a trap composed of 52 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:49:14] [INFO ] Deduced a trap composed of 14 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:49:14] [INFO ] Deduced a trap composed of 99 places in 224 ms of which 0 ms to minimize.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 10 places in 223 ms of which 0 ms to minimize.
[2022-05-17 21:49:15] [INFO ] Deduced a trap composed of 67 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 0 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 20 places in 245 ms of which 1 ms to minimize.
[2022-05-17 21:49:16] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 1 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 0 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 0 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 1 ms to minimize.
[2022-05-17 21:49:17] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 1 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 0 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Deduced a trap composed of 36 places in 168 ms of which 0 ms to minimize.
[2022-05-17 21:49:18] [INFO ] Trap strengthening (SAT) tested/added 44/43 trap constraints in 11797 ms
[2022-05-17 21:49:18] [INFO ] Computed and/alt/rep : 1142/3165/1142 causal constraints (skipped 84 transitions) in 55 ms.
[2022-05-17 21:49:33] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:49:33] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 0 ms to minimize.
[2022-05-17 21:49:33] [INFO ] Deduced a trap composed of 68 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:49:34] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 0 ms to minimize.
[2022-05-17 21:49:34] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 0 ms to minimize.
[2022-05-17 21:49:34] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 0 ms to minimize.
[2022-05-17 21:49:35] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 1 ms to minimize.
[2022-05-17 21:49:35] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 0 ms to minimize.
[2022-05-17 21:49:35] [INFO ] Deduced a trap composed of 28 places in 212 ms of which 0 ms to minimize.
[2022-05-17 21:49:35] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 0 ms to minimize.
[2022-05-17 21:49:36] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 0 ms to minimize.
[2022-05-17 21:49:36] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 0 ms to minimize.
[2022-05-17 21:49:36] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 0 ms to minimize.
[2022-05-17 21:49:37] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 0 ms to minimize.
[2022-05-17 21:49:37] [INFO ] Deduced a trap composed of 86 places in 150 ms of which 1 ms to minimize.
[2022-05-17 21:49:37] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 0 ms to minimize.
[2022-05-17 21:49:37] [INFO ] Deduced a trap composed of 102 places in 149 ms of which 0 ms to minimize.
[2022-05-17 21:49:37] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 1 ms to minimize.
[2022-05-17 21:49:38] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 0 ms to minimize.
[2022-05-17 21:49:38] [INFO ] Deduced a trap composed of 102 places in 119 ms of which 0 ms to minimize.
[2022-05-17 21:49:38] [INFO ] Deduced a trap composed of 102 places in 129 ms of which 0 ms to minimize.
[2022-05-17 21:49:38] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 0 ms to minimize.
[2022-05-17 21:49:39] [INFO ] Deduced a trap composed of 50 places in 175 ms of which 0 ms to minimize.
[2022-05-17 21:49:39] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 0 ms to minimize.
[2022-05-17 21:49:39] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2022-05-17 21:49:39] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 0 ms to minimize.
[2022-05-17 21:49:40] [INFO ] Deduced a trap composed of 121 places in 123 ms of which 1 ms to minimize.
[2022-05-17 21:49:40] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 0 ms to minimize.
[2022-05-17 21:49:40] [INFO ] Deduced a trap composed of 60 places in 152 ms of which 1 ms to minimize.
[2022-05-17 21:49:41] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:49:51] [INFO ] Deduced a trap composed of 2 places in 269 ms of which 0 ms to minimize.
[2022-05-17 21:49:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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:49:51] [INFO ] [Real]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-17 21:49:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:51] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2022-05-17 21:49:51] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:49:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 21:49:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:49:52] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2022-05-17 21:49:52] [INFO ] [Nat]Added 366 Read/Feed constraints in 46 ms returned sat
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 46 places in 231 ms of which 1 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:49:52] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 14 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:49:53] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 62 places in 227 ms of which 0 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:49:54] [INFO ] Deduced a trap composed of 16 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 87 places in 210 ms of which 0 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 79 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 50 places in 203 ms of which 0 ms to minimize.
[2022-05-17 21:49:55] [INFO ] Deduced a trap composed of 95 places in 220 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 62 places in 206 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 1 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 30 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:49:56] [INFO ] Deduced a trap composed of 38 places in 208 ms of which 1 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 84 places in 208 ms of which 0 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 60 places in 208 ms of which 0 ms to minimize.
[2022-05-17 21:49:57] [INFO ] Deduced a trap composed of 46 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 103 places in 203 ms of which 1 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 42 places in 200 ms of which 1 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 91 places in 211 ms of which 0 ms to minimize.
[2022-05-17 21:49:58] [INFO ] Deduced a trap composed of 28 places in 165 ms of which 0 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 42 places in 202 ms of which 0 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 28 places in 203 ms of which 1 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 14 places in 208 ms of which 0 ms to minimize.
[2022-05-17 21:49:59] [INFO ] Deduced a trap composed of 58 places in 182 ms of which 1 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 0 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 0 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 0 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 78 places in 160 ms of which 0 ms to minimize.
[2022-05-17 21:50:00] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 60 places in 166 ms of which 1 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 0 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 38 places in 187 ms of which 0 ms to minimize.
[2022-05-17 21:50:01] [INFO ] Deduced a trap composed of 30 places in 184 ms of which 0 ms to minimize.
[2022-05-17 21:50:02] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 1 ms to minimize.
[2022-05-17 21:50:02] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 0 ms to minimize.
[2022-05-17 21:50:02] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 1 ms to minimize.
[2022-05-17 21:50:02] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 0 ms to minimize.
[2022-05-17 21:50:03] [INFO ] Deduced a trap composed of 131 places in 215 ms of which 1 ms to minimize.
[2022-05-17 21:50:03] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:50:03] [INFO ] Deduced a trap composed of 10 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:50:03] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:50:04] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:50:04] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:50:04] [INFO ] Deduced a trap composed of 20 places in 215 ms of which 0 ms to minimize.
[2022-05-17 21:50:04] [INFO ] Deduced a trap composed of 20 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Deduced a trap composed of 20 places in 202 ms of which 1 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 0 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 1 ms to minimize.
[2022-05-17 21:50:05] [INFO ] Deduced a trap composed of 26 places in 201 ms of which 1 ms to minimize.
[2022-05-17 21:50:06] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 0 ms to minimize.
[2022-05-17 21:50:06] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 0 ms to minimize.
[2022-05-17 21:50:06] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 1 ms to minimize.
[2022-05-17 21:50:06] [INFO ] Deduced a trap composed of 28 places in 192 ms of which 1 ms to minimize.
[2022-05-17 21:50:07] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 0 ms to minimize.
[2022-05-17 21:50:07] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 0 ms to minimize.
[2022-05-17 21:50:07] [INFO ] Deduced a trap composed of 54 places in 192 ms of which 0 ms to minimize.
[2022-05-17 21:50:07] [INFO ] Deduced a trap composed of 47 places in 166 ms of which 0 ms to minimize.
[2022-05-17 21:50:08] [INFO ] Deduced a trap composed of 47 places in 163 ms of which 1 ms to minimize.
[2022-05-17 21:50:08] [INFO ] Deduced a trap composed of 100 places in 164 ms of which 0 ms to minimize.
[2022-05-17 21:50:08] [INFO ] Deduced a trap composed of 36 places in 163 ms of which 0 ms to minimize.
[2022-05-17 21:50:08] [INFO ] Deduced a trap composed of 36 places in 160 ms of which 1 ms to minimize.
[2022-05-17 21:50:08] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:50:09] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 0 ms to minimize.
[2022-05-17 21:50:09] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 1 ms to minimize.
[2022-05-17 21:50:09] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 1 ms to minimize.
[2022-05-17 21:50:09] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 0 ms to minimize.
[2022-05-17 21:50:09] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 1 ms to minimize.
[2022-05-17 21:50:10] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 1 ms to minimize.
[2022-05-17 21:50:10] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 0 ms to minimize.
[2022-05-17 21:50:10] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 0 ms to minimize.
[2022-05-17 21:50:10] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 0 ms to minimize.
[2022-05-17 21:50:10] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:50:11] [INFO ] Deduced a trap composed of 74 places in 133 ms of which 1 ms to minimize.
[2022-05-17 21:50:11] [INFO ] Deduced a trap composed of 90 places in 139 ms of which 0 ms to minimize.
[2022-05-17 21:50:11] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:50:11] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 0 ms to minimize.
[2022-05-17 21:50:11] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 1 ms to minimize.
[2022-05-17 21:50:12] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 0 ms to minimize.
[2022-05-17 21:50:12] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 0 ms to minimize.
[2022-05-17 21:50:12] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 0 ms to minimize.
[2022-05-17 21:50:12] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 1 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 68 places in 194 ms of which 1 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 32 places in 202 ms of which 0 ms to minimize.
[2022-05-17 21:50:13] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 0 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 88 places in 142 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 74 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:50:14] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 0 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 74 places in 172 ms of which 0 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 48 places in 183 ms of which 1 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 1 ms to minimize.
[2022-05-17 21:50:15] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 14 places in 188 ms of which 1 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 42 places in 185 ms of which 0 ms to minimize.
[2022-05-17 21:50:16] [INFO ] Deduced a trap composed of 10 places in 190 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 99 places in 164 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 50 places in 153 ms of which 1 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 0 ms to minimize.
[2022-05-17 21:50:17] [INFO ] Deduced a trap composed of 46 places in 156 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 1 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 46 places in 163 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 0 ms to minimize.
[2022-05-17 21:50:18] [INFO ] Trap strengthening (SAT) tested/added 114/113 trap constraints in 26520 ms
[2022-05-17 21:50:18] [INFO ] Computed and/alt/rep : 1142/3165/1142 causal constraints (skipped 84 transitions) in 57 ms.
[2022-05-17 21:50:29] [INFO ] Deduced a trap composed of 18 places in 184 ms of which 0 ms to minimize.
[2022-05-17 21:50:30] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 0 ms to minimize.
[2022-05-17 21:50:30] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 0 ms to minimize.
[2022-05-17 21:50:30] [INFO ] Deduced a trap composed of 28 places in 191 ms of which 1 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 53 places in 185 ms of which 0 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 53 places in 193 ms of which 1 ms to minimize.
[2022-05-17 21:50:31] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 1 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 0 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 1 ms to minimize.
[2022-05-17 21:50:32] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2967 ms
[2022-05-17 21:50:32] [INFO ] Added : 772 causal constraints over 157 iterations in 14178 ms. Result :sat
Minimization took 520 ms.
Current structural bounds on expressions (after SMT) : [294, 1] Max seen :[6, 0]
Incomplete Parikh walk after 268500 steps, including 1000 resets, run finished after 1302 ms. (steps per millisecond=206 ) properties (out of 2) seen :5 could not realise parikh vector
Support contains 295 out of 736 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 736/736 places, 1443/1443 transitions.
Applied a total of 0 rules in 21 ms. Remains 736 /736 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 736/736 places, 1443/1443 transitions.
Starting structural reductions, iteration 0 : 736/736 places, 1443/1443 transitions.
Applied a total of 0 rules in 20 ms. Remains 736 /736 variables (removed 0) and now considering 1443/1443 (removed 0) transitions.
[2022-05-17 21:50:34] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:50:34] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:50:35] [INFO ] Implicit Places using invariants in 321 ms returned []
[2022-05-17 21:50:35] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:50:35] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 21:50:35] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:50:38] [INFO ] Implicit Places using invariants and state equation in 3033 ms returned []
Implicit Place search using SMT with State Equation took 3356 ms to find 0 implicit places.
[2022-05-17 21:50:38] [INFO ] Redundant transitions in 29 ms returned []
[2022-05-17 21:50:38] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:50:38] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 21:50:38] [INFO ] Dead Transitions using invariants and state equation in 565 ms returned []
Finished structural reductions, in 1 iterations. Remains : 736/736 places, 1443/1443 transitions.
Starting property specific reduction for Peterson-PT-6-UpperBounds-03
Normalized transition count is 1233 out of 1443 initially.
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:50:38] [INFO ] Computed 20 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :2
[2022-05-17 21:50:38] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:50:38] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 21:50:38] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:50:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:39] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2022-05-17 21:50:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:50:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:39] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2022-05-17 21:50:39] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:50:39] [INFO ] [Nat]Added 366 Read/Feed constraints in 58 ms returned sat
[2022-05-17 21:50:40] [INFO ] Deduced a trap composed of 106 places in 242 ms of which 0 ms to minimize.
[2022-05-17 21:50:40] [INFO ] Deduced a trap composed of 10 places in 243 ms of which 1 ms to minimize.
[2022-05-17 21:50:40] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:50:40] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2022-05-17 21:50:41] [INFO ] Deduced a trap composed of 20 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:50:41] [INFO ] Deduced a trap composed of 26 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:50:41] [INFO ] Deduced a trap composed of 57 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:50:41] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:50:42] [INFO ] Deduced a trap composed of 112 places in 229 ms of which 1 ms to minimize.
[2022-05-17 21:50:42] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:50:42] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 1 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 26 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 0 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 0 ms to minimize.
[2022-05-17 21:50:43] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:50:44] [INFO ] Deduced a trap composed of 52 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:50:44] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:50: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [294] Max seen :[4]
Support contains 294 out of 736 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 736/736 places, 1443/1443 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 736 transition count 1442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 735 transition count 1442
Applied a total of 2 rules in 25 ms. Remains 735 /736 variables (removed 1) and now considering 1442/1443 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/736 places, 1442/1443 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:44] [INFO ] Computed 20 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4706 ms. (steps per millisecond=212 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3075 ms. (steps per millisecond=325 ) properties (out of 1) seen :3
[2022-05-17 21:50:52] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:50:52] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 21:50:52] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:52] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2022-05-17 21:50:52] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:50:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:50:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:50:53] [INFO ] [Nat]Absence check using state equation in 259 ms returned sat
[2022-05-17 21:50:53] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:50:53] [INFO ] [Nat]Added 366 Read/Feed constraints in 62 ms returned sat
[2022-05-17 21:50:53] [INFO ] Deduced a trap composed of 37 places in 242 ms of which 1 ms to minimize.
[2022-05-17 21:50:53] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 0 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 36 places in 240 ms of which 0 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:50:54] [INFO ] Deduced a trap composed of 22 places in 252 ms of which 1 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 0 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 12 places in 257 ms of which 0 ms to minimize.
[2022-05-17 21:50:55] [INFO ] Deduced a trap composed of 12 places in 263 ms of which 1 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 16 places in 262 ms of which 1 ms to minimize.
[2022-05-17 21:50:56] [INFO ] Deduced a trap composed of 16 places in 253 ms of which 0 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 0 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 1 ms to minimize.
[2022-05-17 21:50:57] [INFO ] Deduced a trap composed of 32 places in 258 ms of which 0 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 10 places in 260 ms of which 0 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 76 places in 244 ms of which 0 ms to minimize.
[2022-05-17 21:50:58] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 0 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:50:59] [INFO ] Deduced a trap composed of 34 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:51:00] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 0 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 1 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 1 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:51:01] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 0 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 0 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 48 places in 226 ms of which 0 ms to minimize.
[2022-05-17 21:51:02] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 1 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 102 places in 188 ms of which 0 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 86 places in 195 ms of which 0 ms to minimize.
[2022-05-17 21:51:03] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 0 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 102 places in 195 ms of which 1 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 0 ms to minimize.
[2022-05-17 21:51:04] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 20 places in 257 ms of which 0 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 10 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 0 ms to minimize.
[2022-05-17 21:51:05] [INFO ] Deduced a trap composed of 32 places in 184 ms of which 0 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 28 places in 199 ms of which 1 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 1 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 1 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:51:06] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 98 places in 95 ms of which 1 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 0 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 82 places in 95 ms of which 0 ms to minimize.
[2022-05-17 21:51:07] [INFO ] Deduced a trap composed of 58 places in 261 ms of which 1 ms to minimize.
[2022-05-17 21:51:08] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:51:08] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 0 ms to minimize.
[2022-05-17 21:51:08] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 0 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 1 ms to minimize.
[2022-05-17 21:51:09] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 1 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:51:10] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 17658 ms
[2022-05-17 21:51:10] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 53 ms.
[2022-05-17 21:51:26] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 0 ms to minimize.
[2022-05-17 21:51:26] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 1 ms to minimize.
[2022-05-17 21:51:27] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 0 ms to minimize.
[2022-05-17 21:51:27] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 0 ms to minimize.
[2022-05-17 21:51:27] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 1 ms to minimize.
[2022-05-17 21:51:27] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 0 ms to minimize.
[2022-05-17 21:51:28] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 0 ms to minimize.
[2022-05-17 21:51:28] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 1 ms to minimize.
[2022-05-17 21:51:28] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 1 ms to minimize.
[2022-05-17 21:51:29] [INFO ] Deduced a trap composed of 30 places in 179 ms of which 1 ms to minimize.
[2022-05-17 21:51:29] [INFO ] Deduced a trap composed of 80 places in 150 ms of which 0 ms to minimize.
[2022-05-17 21:51:29] [INFO ] Deduced a trap composed of 64 places in 148 ms of which 1 ms to minimize.
[2022-05-17 21:51:30] [INFO ] Deduced a trap composed of 70 places in 145 ms of which 0 ms to minimize.
[2022-05-17 21:51:30] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 1 ms to minimize.
[2022-05-17 21:51:30] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 0 ms to minimize.
[2022-05-17 21:51:30] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 0 ms to minimize.
[2022-05-17 21:51:31] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 1 ms to minimize.
[2022-05-17 21:51:31] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 0 ms to minimize.
[2022-05-17 21:51:31] [INFO ] Deduced a trap composed of 80 places in 128 ms of which 1 ms to minimize.
[2022-05-17 21:51:31] [INFO ] Deduced a trap composed of 80 places in 120 ms of which 1 ms to minimize.
[2022-05-17 21:51:32] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 1 ms to minimize.
[2022-05-17 21:51:32] [INFO ] Deduced a trap composed of 96 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:51:33] [INFO ] Deduced a trap composed of 148 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:51:33] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6939 ms
[2022-05-17 21:51:33] [INFO ] Added : 1008 causal constraints over 203 iterations in 22449 ms.(timeout) Result :sat
Minimization took 734 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Incomplete Parikh walk after 178000 steps, including 1000 resets, run finished after 772 ms. (steps per millisecond=230 ) properties (out of 1) seen :5 could not realise parikh vector
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 17 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 26 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:51:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:34] [INFO ] Computed 20 place invariants in 9 ms
[2022-05-17 21:51:35] [INFO ] Implicit Places using invariants in 292 ms returned []
[2022-05-17 21:51:35] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:35] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 21:51:35] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:51:38] [INFO ] Implicit Places using invariants and state equation in 3020 ms returned []
Implicit Place search using SMT with State Equation took 3319 ms to find 0 implicit places.
[2022-05-17 21:51:38] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-17 21:51:38] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:38] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 21:51:38] [INFO ] Dead Transitions using invariants and state equation in 544 ms returned []
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:38] [INFO ] Computed 20 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4645 ms. (steps per millisecond=215 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3086 ms. (steps per millisecond=324 ) properties (out of 1) seen :3
[2022-05-17 21:51:46] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:51:46] [INFO ] Computed 20 place invariants in 8 ms
[2022-05-17 21:51:46] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-17 21:51:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:46] [INFO ] [Real]Absence check using state equation in 249 ms returned sat
[2022-05-17 21:51:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:51:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-17 21:51:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:51:47] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2022-05-17 21:51:47] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:51:47] [INFO ] [Nat]Added 366 Read/Feed constraints in 49 ms returned sat
[2022-05-17 21:51:47] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 1 ms to minimize.
[2022-05-17 21:51:47] [INFO ] Deduced a trap composed of 28 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 36 places in 234 ms of which 1 ms to minimize.
[2022-05-17 21:51:48] [INFO ] Deduced a trap composed of 24 places in 235 ms of which 1 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 1 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 12 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:51:49] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 16 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 16 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:51:50] [INFO ] Deduced a trap composed of 16 places in 234 ms of which 0 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 10 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 16 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:51:51] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 1 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 1 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 1 ms to minimize.
[2022-05-17 21:51:52] [INFO ] Deduced a trap composed of 34 places in 225 ms of which 0 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 30 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 34 places in 228 ms of which 0 ms to minimize.
[2022-05-17 21:51:53] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 0 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 28 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 1 ms to minimize.
[2022-05-17 21:51:54] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 0 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 0 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 66 places in 201 ms of which 1 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 66 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:51:55] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 0 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 1 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 0 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 0 ms to minimize.
[2022-05-17 21:51:56] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 1 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 102 places in 181 ms of which 0 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 86 places in 183 ms of which 1 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 0 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 102 places in 186 ms of which 0 ms to minimize.
[2022-05-17 21:51:57] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 0 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 10 places in 246 ms of which 0 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 20 places in 248 ms of which 1 ms to minimize.
[2022-05-17 21:51:58] [INFO ] Deduced a trap composed of 10 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 0 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 32 places in 185 ms of which 0 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 28 places in 179 ms of which 0 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 0 ms to minimize.
[2022-05-17 21:51:59] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 1 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 1 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 98 places in 102 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 1 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 98 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:52:00] [INFO ] Deduced a trap composed of 82 places in 92 ms of which 0 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 58 places in 236 ms of which 1 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 1 ms to minimize.
[2022-05-17 21:52:01] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 28 places in 240 ms of which 1 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 44 places in 236 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:52:02] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 1 ms to minimize.
[2022-05-17 21:52:03] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 1 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 0 ms to minimize.
[2022-05-17 21:52:04] [INFO ] Trap strengthening (SAT) tested/added 70/69 trap constraints in 16860 ms
[2022-05-17 21:52:04] [INFO ] Computed and/alt/rep : 1141/3164/1141 causal constraints (skipped 84 transitions) in 71 ms.
[2022-05-17 21:52:18] [INFO ] Deduced a trap composed of 12 places in 241 ms of which 1 ms to minimize.
[2022-05-17 21:52:19] [INFO ] Deduced a trap composed of 64 places in 179 ms of which 1 ms to minimize.
[2022-05-17 21:52:19] [INFO ] Deduced a trap composed of 44 places in 188 ms of which 0 ms to minimize.
[2022-05-17 21:52:19] [INFO ] Deduced a trap composed of 40 places in 198 ms of which 0 ms to minimize.
[2022-05-17 21:52:20] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 1 ms to minimize.
[2022-05-17 21:52:20] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 1 ms to minimize.
[2022-05-17 21:52:20] [INFO ] Deduced a trap composed of 70 places in 149 ms of which 0 ms to minimize.
[2022-05-17 21:52:20] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 0 ms to minimize.
[2022-05-17 21:52:21] [INFO ] Deduced a trap composed of 46 places in 165 ms of which 1 ms to minimize.
[2022-05-17 21:52:21] [INFO ] Deduced a trap composed of 30 places in 171 ms of which 0 ms to minimize.
[2022-05-17 21:52:21] [INFO ] Deduced a trap composed of 80 places in 148 ms of which 0 ms to minimize.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 1 ms to minimize.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 1 ms to minimize.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 87 places in 142 ms of which 0 ms to minimize.
[2022-05-17 21:52:22] [INFO ] Deduced a trap composed of 64 places in 145 ms of which 0 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 80 places in 126 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 1 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 80 places in 122 ms of which 0 ms to minimize.
[2022-05-17 21:52:23] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 0 ms to minimize.
[2022-05-17 21:52:24] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 0 ms to minimize.
[2022-05-17 21:52:24] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 0 ms to minimize.
[2022-05-17 21:52:25] [INFO ] Deduced a trap composed of 148 places in 102 ms of which 0 ms to minimize.
[2022-05-17 21:52:25] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 6697 ms
[2022-05-17 21:52:25] [INFO ] Added : 1008 causal constraints over 203 iterations in 21284 ms.(timeout) Result :sat
Minimization took 708 ms.
Current structural bounds on expressions (after SMT) : [294] Max seen :[6]
Incomplete Parikh walk after 178000 steps, including 1000 resets, run finished after 771 ms. (steps per millisecond=230 ) properties (out of 1) seen :6 could not realise parikh vector
Support contains 294 out of 735 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 16 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 735/735 places, 1442/1442 transitions.
Applied a total of 0 rules in 15 ms. Remains 735 /735 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-05-17 21:52:27] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:52:27] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-17 21:52:27] [INFO ] Implicit Places using invariants in 302 ms returned []
[2022-05-17 21:52:27] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:52:27] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:52:27] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:52:30] [INFO ] Implicit Places using invariants and state equation in 2975 ms returned []
Implicit Place search using SMT with State Equation took 3279 ms to find 0 implicit places.
[2022-05-17 21:52:30] [INFO ] Redundant transitions in 24 ms returned []
[2022-05-17 21:52:30] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 735 cols
[2022-05-17 21:52:30] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 21:52:30] [INFO ] Dead Transitions using invariants and state equation in 522 ms returned []
Finished structural reductions, in 1 iterations. Remains : 735/735 places, 1442/1442 transitions.
Ending property specific reduction for Peterson-PT-6-UpperBounds-03 in 112150 ms.
Starting property specific reduction for Peterson-PT-6-UpperBounds-15
Normalized transition count is 1233 out of 1443 initially.
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:52:30] [INFO ] Computed 20 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) 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:52:30] [INFO ] Flow matrix only has 1233 transitions (discarded 210 similar events)
// Phase 1: matrix 1233 rows 736 cols
[2022-05-17 21:52:30] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 21:52:31] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-05-17 21:52:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:31] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2022-05-17 21:52:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:31] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2022-05-17 21:52:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:31] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2022-05-17 21:52:31] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-05-17 21:52:31] [INFO ] [Nat]Added 366 Read/Feed constraints in 54 ms returned sat
[2022-05-17 21:52:32] [INFO ] Deduced a trap composed of 46 places in 218 ms of which 0 ms to minimize.
[2022-05-17 21:52:32] [INFO ] Deduced a trap composed of 28 places in 217 ms of which 0 ms to minimize.
[2022-05-17 21:52:32] [INFO ] Deduced a trap composed of 28 places in 237 ms of which 0 ms to minimize.
[2022-05-17 21:52:32] [INFO ] Deduced a trap composed of 14 places in 216 ms of which 0 ms to minimize.
[2022-05-17 21:52:33] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2022-05-17 21:52:33] [INFO ] Deduced a trap composed of 12 places in 213 ms of which 1 ms to minimize.
[2022-05-17 21:52:33] [INFO ] Deduced a trap composed of 62 places in 218 ms of which 1 ms to minimize.
[2022-05-17 21:52:33] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 1 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 1 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 0 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 87 places in 212 ms of which 0 ms to minimize.
[2022-05-17 21:52:34] [INFO ] Deduced a trap composed of 79 places in 210 ms of which 0 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 1 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 95 places in 205 ms of which 1 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 62 places in 210 ms of which 1 ms to minimize.
[2022-05-17 21:52:35] [INFO ] Deduced a trap composed of 62 places in 219 ms of which 1 ms to minimize.
[2022-05-17 21:52:36] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2022-05-17 21:52:36] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 1 ms to minimize.
[2022-05-17 21:52: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 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:588)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [1] Max seen :[0]
Support contains 1 out of 736 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions, iteration 0 : 736/736 places, 1442/1442 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 735 transition count 1365
Reduce places removed 77 places and 2 transitions.
Iterating post reduction 1 with 77 rules applied. Total rules applied 154 place count 658 transition count 1363
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 657 transition count 1362
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 656 transition count 1360
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 157 place count 655 transition count 1359
Performed 215 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 215 Pre rules applied. Total rules applied 157 place count 655 transition count 1144
Deduced a syphon composed of 215 places in 1 ms
Reduce places removed 215 places and 0 transitions.
Iterating global reduction 5 with 430 rules applied. Total rules applied 587 place count 440 transition count 1144
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 669 place count 399 transition count 1103
Applied a total of 669 rules in 83 ms. Remains 399 /736 variables (removed 337) and now considering 1103/1442 (removed 339) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/736 places, 1103/1442 transitions.
Normalized transition count is 893 out of 1103 initially.
// Phase 1: matrix 893 rows 399 cols
[2022-05-17 21:52:36] [INFO ] Computed 20 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1646 ms. (steps per millisecond=607 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=2044 ) properties (out of 1) seen :0
[2022-05-17 21:52:38] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2022-05-17 21:52:38] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 21:52:38] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-05-17 21:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:38] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2022-05-17 21:52:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:52:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-17 21:52:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:52:39] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2022-05-17 21:52:39] [INFO ] State equation strengthened by 364 read => feed constraints.
[2022-05-17 21:52:39] [INFO ] [Nat]Added 364 Read/Feed constraints in 33 ms returned sat
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 1 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:52:39] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 1 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 0 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 42 places in 112 ms of which 0 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:52:40] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 0 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 45 places in 102 ms of which 1 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 1 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:52:41] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 0 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 0 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 1 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:52:42] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 1 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 51 places in 100 ms of which 0 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 0 ms to minimize.
[2022-05-17 21:52:43] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 0 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 0 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 0 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2022-05-17 21:52:44] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 50 places in 89 ms of which 1 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 0 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 1 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 0 ms to minimize.
[2022-05-17 21:52:45] [INFO ] Deduced a trap composed of 37 places in 80 ms of which 0 ms to minimize.
[2022-05-17 21:52:46] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 0 ms to minimize.
[2022-05-17 21:52:46] [INFO ] Deduced a trap composed of 51 places in 79 ms of which 0 ms to minimize.
[2022-05-17 21:52:46] [INFO ] Trap strengthening (SAT) tested/added 56/55 trap constraints in 7079 ms
[2022-05-17 21:52:46] [INFO ] Computed and/alt/rep : 802/2816/802 causal constraints (skipped 84 transitions) in 50 ms.
[2022-05-17 21:52:49] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 0 ms to minimize.
[2022-05-17 21:52:49] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 0 ms to minimize.
[2022-05-17 21:52:49] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 0 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2022-05-17 21:52:50] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 0 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 0 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 0 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-05-17 21:52:51] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2400 ms
[2022-05-17 21:52:51] [INFO ] Added : 330 causal constraints over 66 iterations in 5662 ms. Result :sat
Minimization took 260 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Incomplete Parikh walk after 257000 steps, including 1000 resets, run finished after 381 ms. (steps per millisecond=674 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 1103/1103 transitions.
Applied a total of 0 rules in 14 ms. Remains 399 /399 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1103/1103 transitions.
Starting structural reductions, iteration 0 : 399/399 places, 1103/1103 transitions.
Applied a total of 0 rules in 11 ms. Remains 399 /399 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2022-05-17 21:52:52] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2022-05-17 21:52:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:52:52] [INFO ] Implicit Places using invariants in 238 ms returned []
[2022-05-17 21:52:52] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2022-05-17 21:52:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 21:52:53] [INFO ] State equation strengthened by 364 read => feed constraints.
[2022-05-17 21:52:54] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
[2022-05-17 21:52:54] [INFO ] Redundant transitions in 12 ms returned []
[2022-05-17 21:52:54] [INFO ] Flow matrix only has 893 transitions (discarded 210 similar events)
// Phase 1: matrix 893 rows 399 cols
[2022-05-17 21:52:54] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 21:52:55] [INFO ] Dead Transitions using invariants and state equation in 343 ms returned []
Finished structural reductions, in 1 iterations. Remains : 399/399 places, 1103/1103 transitions.
Ending property specific reduction for Peterson-PT-6-UpperBounds-15 in 24110 ms.
[2022-05-17 21:52:55] [INFO ] Flatten gal took : 131 ms
[2022-05-17 21:52:55] [INFO ] Applying decomposition
[2022-05-17 21:52:55] [INFO ] Flatten gal took : 70 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/graph865740185723660335.txt, -o, /tmp/graph865740185723660335.bin, -w, /tmp/graph865740185723660335.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/graph865740185723660335.bin, -l, -1, -v, -w, /tmp/graph865740185723660335.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-05-17 21:52:55] [INFO ] Decomposing Gal with order
[2022-05-17 21:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 21:52:56] [INFO ] Removed a total of 2000 redundant transitions.
[2022-05-17 21:52:56] [INFO ] Flatten gal took : 143 ms
[2022-05-17 21:52:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 35 ms.
[2022-05-17 21:52:56] [INFO ] Time to serialize gal into /tmp/UpperBounds5295097423357340298.gal : 18 ms
[2022-05-17 21:52:56] [INFO ] Time to serialize properties into /tmp/UpperBounds5803595275802151089.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds5295097423357340298.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds5803595275802151089.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5295097423357340298.gal -t CGAL -reachable-file /tmp/UpperBounds5803595275802151089.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds5803595275802151089.prop.
Detected timeout of ITS tools.
[2022-05-17 22:15:34] [INFO ] Applying decomposition
[2022-05-17 22:15:35] [INFO ] Flatten gal took : 478 ms
[2022-05-17 22:15:35] [INFO ] Decomposing Gal with order
[2022-05-17 22:15:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 22:15:36] [INFO ] Removed a total of 1380 redundant transitions.
[2022-05-17 22:15:36] [INFO ] Flatten gal took : 576 ms
[2022-05-17 22:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 600 labels/synchronizations in 67 ms.
[2022-05-17 22:15:36] [INFO ] Time to serialize gal into /tmp/UpperBounds18384410758120427318.gal : 25 ms
[2022-05-17 22:15:36] [INFO ] Time to serialize properties into /tmp/UpperBounds9976281557066064958.prop : 2 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/UpperBounds18384410758120427318.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds9976281557066064958.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds18384410758120427318.gal -t CGAL -reachable-file /tmp/UpperBounds9976281557066064958.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/UpperBounds9976281557066064958.prop.
Detected timeout of ITS tools.
[2022-05-17 22:38:09] [INFO ] Flatten gal took : 342 ms
[2022-05-17 22:38:12] [INFO ] Input system was already deterministic with 1443 transitions.
[2022-05-17 22:38:12] [INFO ] Transformed 736 places.
[2022-05-17 22:38:12] [INFO ] Transformed 1443 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-17 22:38:12] [INFO ] Time to serialize gal into /tmp/UpperBounds5495266926654651169.gal : 34 ms
[2022-05-17 22:38:12] [INFO ] Time to serialize properties into /tmp/UpperBounds7484736810305679625.prop : 3 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/UpperBounds5495266926654651169.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7484736810305679625.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds5495266926654651169.gal -t CGAL -reachable-file /tmp/UpperBounds7484736810305679625.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds7484736810305679625.prop.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-6"
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-6, 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-165277026700031"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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