About the Execution of 2022-gold for Peterson-PT-5
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16213.636 | 3600000.00 | 3179849.00 | 166043.30 | 6 5 6 ? 6 6 6 6 ? 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/mcc2023-input.r287-smll-167863553800079.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is Peterson-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r287-smll-167863553800079
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678922437124
Running Version 202205111006
[2023-03-15 23:20:39] [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]
[2023-03-15 23:20:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 23:20:40] [INFO ] Load time of PNML (sax parser for PT used): 373 ms
[2023-03-15 23:20:40] [INFO ] Transformed 834 places.
[2023-03-15 23:20:40] [INFO ] Transformed 1242 transitions.
[2023-03-15 23:20:40] [INFO ] Found NUPN structural information;
[2023-03-15 23:20:40] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-15 23:20:40] [INFO ] Parsed PT model containing 834 places and 1242 transitions in 637 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 30 ms.
FORMULA Peterson-PT-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 23:20:40] [INFO ] Computed 23 place invariants in 60 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 14) seen :31
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :27
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :27
[2023-03-15 23:20:41] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-15 23:20:41] [INFO ] Computed 23 place invariants in 16 ms
[2023-03-15 23:20:42] [INFO ] [Real]Absence check using 17 positive place invariants in 45 ms returned unsat
[2023-03-15 23:20:42] [INFO ] [Real]Absence check using 17 positive place invariants in 42 ms returned sat
[2023-03-15 23:20:42] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 7 ms returned sat
[2023-03-15 23:20:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:43] [INFO ] [Real]Absence check using state equation in 628 ms returned sat
[2023-03-15 23:20:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:20:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 40 ms returned sat
[2023-03-15 23:20:43] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 12 ms returned sat
[2023-03-15 23:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:44] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2023-03-15 23:20:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:20:44] [INFO ] [Nat]Added 205 Read/Feed constraints in 201 ms returned sat
[2023-03-15 23:20:45] [INFO ] Deduced a trap composed of 11 places in 636 ms of which 6 ms to minimize.
[2023-03-15 23:20:46] [INFO ] Deduced a trap composed of 85 places in 670 ms of which 3 ms to minimize.
[2023-03-15 23:20:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1655 ms
[2023-03-15 23:20:46] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 173 ms.
[2023-03-15 23:20:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 23:20:48] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned unsat
[2023-03-15 23:20:49] [INFO ] [Real]Absence check using 17 positive place invariants in 42 ms returned unsat
[2023-03-15 23:20:49] [INFO ] [Real]Absence check using 17 positive place invariants in 38 ms returned unsat
[2023-03-15 23:20:49] [INFO ] [Real]Absence check using 17 positive place invariants in 37 ms returned unsat
[2023-03-15 23:20:50] [INFO ] [Real]Absence check using 17 positive place invariants in 34 ms returned sat
[2023-03-15 23:20:50] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-15 23:20:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:50] [INFO ] [Real]Absence check using state equation in 603 ms returned sat
[2023-03-15 23:20:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:20:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2023-03-15 23:20:51] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-15 23:20:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:51] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2023-03-15 23:20:51] [INFO ] [Nat]Added 205 Read/Feed constraints in 70 ms returned sat
[2023-03-15 23:20:51] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 104 ms.
[2023-03-15 23:20:56] [INFO ] Deduced a trap composed of 2 places in 1024 ms of which 3 ms to minimize.
[2023-03-15 23:20:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 23:20:57] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-15 23:20:57] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 23:20:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:57] [INFO ] [Real]Absence check using state equation in 486 ms returned sat
[2023-03-15 23:20:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:20:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 28 ms returned sat
[2023-03-15 23:20:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-15 23:20:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:20:58] [INFO ] [Nat]Absence check using state equation in 440 ms returned sat
[2023-03-15 23:20:58] [INFO ] [Nat]Added 205 Read/Feed constraints in 74 ms returned sat
[2023-03-15 23:20:58] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 86 ms.
[2023-03-15 23:21:03] [INFO ] Deduced a trap composed of 41 places in 691 ms of which 3 ms to minimize.
[2023-03-15 23:21:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 23:21:03] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2023-03-15 23:21:03] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-15 23:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:04] [INFO ] [Real]Absence check using state equation in 684 ms returned sat
[2023-03-15 23:21:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:21:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 39 ms returned sat
[2023-03-15 23:21:04] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-15 23:21:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:05] [INFO ] [Nat]Absence check using state equation in 582 ms returned sat
[2023-03-15 23:21:05] [INFO ] [Nat]Added 205 Read/Feed constraints in 74 ms returned sat
[2023-03-15 23:21:05] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 132 ms.
[2023-03-15 23:21:10] [INFO ] Deduced a trap composed of 2 places in 1015 ms of which 2 ms to minimize.
[2023-03-15 23:21:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [6, 180, 6, 6, 6, 6, 1, 1, 1] Max seen :[6, 2, 6, 6, 6, 6, 0, 0, 0]
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 183 out of 834 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 834 transition count 1095
Reduce places removed 147 places and 0 transitions.
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Iterating post reduction 1 with 296 rules applied. Total rules applied 443 place count 687 transition count 946
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 2 with 149 rules applied. Total rules applied 592 place count 538 transition count 946
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 592 place count 538 transition count 886
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 712 place count 478 transition count 886
Applied a total of 712 rules in 239 ms. Remains 478 /834 variables (removed 356) and now considering 886/1242 (removed 356) transitions.
Finished structural reductions, in 1 iterations. Remains : 478/834 places, 886/1242 transitions.
Normalized transition count is 766 out of 886 initially.
// Phase 1: matrix 766 rows 478 cols
[2023-03-15 23:21:10] [INFO ] Computed 23 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4411 ms. (steps per millisecond=226 ) properties (out of 4) seen :6
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2833 ms. (steps per millisecond=352 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 876 ms. (steps per millisecond=1141 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 870 ms. (steps per millisecond=1149 ) properties (out of 3) seen :5
[2023-03-15 23:21:19] [INFO ] Flow matrix only has 766 transitions (discarded 120 similar events)
// Phase 1: matrix 766 rows 478 cols
[2023-03-15 23:21:19] [INFO ] Computed 23 place invariants in 5 ms
[2023-03-15 23:21:19] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 23:21:19] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 23:21:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:20] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2023-03-15 23:21:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:21:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 23:21:20] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-15 23:21:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:20] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2023-03-15 23:21:20] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:21:20] [INFO ] [Nat]Added 205 Read/Feed constraints in 150 ms returned sat
[2023-03-15 23:21:21] [INFO ] Deduced a trap composed of 33 places in 338 ms of which 1 ms to minimize.
[2023-03-15 23:21:21] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 1 ms to minimize.
[2023-03-15 23:21:21] [INFO ] Deduced a trap composed of 41 places in 324 ms of which 2 ms to minimize.
[2023-03-15 23:21:22] [INFO ] Deduced a trap composed of 25 places in 318 ms of which 1 ms to minimize.
[2023-03-15 23:21:22] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:21:22] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 1 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 51 places in 272 ms of which 1 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 49 places in 300 ms of which 1 ms to minimize.
[2023-03-15 23:21:23] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 1 ms to minimize.
[2023-03-15 23:21:24] [INFO ] Deduced a trap composed of 39 places in 338 ms of which 0 ms to minimize.
[2023-03-15 23:21:24] [INFO ] Deduced a trap composed of 13 places in 313 ms of which 1 ms to minimize.
[2023-03-15 23:21:24] [INFO ] Deduced a trap composed of 25 places in 377 ms of which 2 ms to minimize.
[2023-03-15 23:21:25] [INFO ] Deduced a trap composed of 53 places in 375 ms of which 1 ms to minimize.
[2023-03-15 23:21:25] [INFO ] Deduced a trap composed of 49 places in 359 ms of which 1 ms to minimize.
[2023-03-15 23:21:26] [INFO ] Deduced a trap composed of 49 places in 306 ms of which 1 ms to minimize.
[2023-03-15 23:21:26] [INFO ] Deduced a trap composed of 63 places in 221 ms of which 0 ms to minimize.
[2023-03-15 23:21:26] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 5698 ms
[2023-03-15 23:21:26] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 58 ms.
[2023-03-15 23:21:28] [INFO ] Added : 206 causal constraints over 42 iterations in 2516 ms. Result :sat
Minimization took 256 ms.
[2023-03-15 23:21:29] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-03-15 23:21:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 23:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:29] [INFO ] [Real]Absence check using state equation in 254 ms returned sat
[2023-03-15 23:21:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:21:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 23:21:29] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 23:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:30] [INFO ] [Nat]Absence check using state equation in 252 ms returned sat
[2023-03-15 23:21:30] [INFO ] [Nat]Added 205 Read/Feed constraints in 37 ms returned sat
[2023-03-15 23:21:30] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 78 ms.
[2023-03-15 23:21:32] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 1 ms to minimize.
[2023-03-15 23:21:32] [INFO ] Deduced a trap composed of 31 places in 187 ms of which 1 ms to minimize.
[2023-03-15 23:21:32] [INFO ] Deduced a trap composed of 82 places in 274 ms of which 0 ms to minimize.
[2023-03-15 23:21:33] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 0 ms to minimize.
[2023-03-15 23:21:33] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 1 ms to minimize.
[2023-03-15 23:21:33] [INFO ] Deduced a trap composed of 70 places in 313 ms of which 1 ms to minimize.
[2023-03-15 23:21:33] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 1 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Deduced a trap composed of 37 places in 210 ms of which 1 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 0 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 0 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 0 ms to minimize.
[2023-03-15 23:21:34] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3064 ms
[2023-03-15 23:21:35] [INFO ] Added : 177 causal constraints over 37 iterations in 5179 ms. Result :sat
Minimization took 293 ms.
[2023-03-15 23:21:35] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-15 23:21:35] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 23:21:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:36] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2023-03-15 23:21:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:21:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 23:21:36] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 23:21:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:36] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2023-03-15 23:21:36] [INFO ] [Nat]Added 205 Read/Feed constraints in 29 ms returned sat
[2023-03-15 23:21:36] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 56 ms.
[2023-03-15 23:21:37] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 1 ms to minimize.
[2023-03-15 23:21:38] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 1 ms to minimize.
[2023-03-15 23:21:38] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 4 ms to minimize.
[2023-03-15 23:21:38] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 0 ms to minimize.
[2023-03-15 23:21:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1084 ms
[2023-03-15 23:21:38] [INFO ] Added : 108 causal constraints over 23 iterations in 2417 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 478 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 478/478 places, 886/886 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 885
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 477 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 476 transition count 884
Applied a total of 4 rules in 49 ms. Remains 476 /478 variables (removed 2) and now considering 884/886 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/478 places, 884/886 transitions.
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 476 cols
[2023-03-15 23:21:39] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3927 ms. (steps per millisecond=254 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2827 ms. (steps per millisecond=353 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 928 ms. (steps per millisecond=1077 ) properties (out of 3) seen :4
[2023-03-15 23:21:48] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 476 cols
[2023-03-15 23:21:48] [INFO ] Computed 23 place invariants in 24 ms
[2023-03-15 23:21:48] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 23:21:48] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 23:21:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:48] [INFO ] [Real]Absence check using state equation in 272 ms returned sat
[2023-03-15 23:21:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:21:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 23:21:48] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-15 23:21:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:21:49] [INFO ] [Nat]Absence check using state equation in 268 ms returned sat
[2023-03-15 23:21:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:21:49] [INFO ] [Nat]Added 205 Read/Feed constraints in 95 ms returned sat
[2023-03-15 23:21:49] [INFO ] Deduced a trap composed of 9 places in 325 ms of which 0 ms to minimize.
[2023-03-15 23:21:49] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2023-03-15 23:21:50] [INFO ] Deduced a trap composed of 13 places in 338 ms of which 1 ms to minimize.
[2023-03-15 23:21:50] [INFO ] Deduced a trap composed of 11 places in 336 ms of which 1 ms to minimize.
[2023-03-15 23:21:51] [INFO ] Deduced a trap composed of 29 places in 340 ms of which 1 ms to minimize.
[2023-03-15 23:21:51] [INFO ] Deduced a trap composed of 19 places in 370 ms of which 2 ms to minimize.
[2023-03-15 23:21:51] [INFO ] Deduced a trap composed of 11 places in 444 ms of which 1 ms to minimize.
[2023-03-15 23:21:52] [INFO ] Deduced a trap composed of 46 places in 456 ms of which 1 ms to minimize.
[2023-03-15 23:21:52] [INFO ] Deduced a trap composed of 17 places in 415 ms of which 1 ms to minimize.
[2023-03-15 23:21:53] [INFO ] Deduced a trap composed of 50 places in 522 ms of which 1 ms to minimize.
[2023-03-15 23:21:54] [INFO ] Deduced a trap composed of 57 places in 478 ms of which 1 ms to minimize.
[2023-03-15 23:21:54] [INFO ] Deduced a trap composed of 27 places in 501 ms of which 1 ms to minimize.
[2023-03-15 23:21:55] [INFO ] Deduced a trap composed of 11 places in 424 ms of which 2 ms to minimize.
[2023-03-15 23:21:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5976 ms
[2023-03-15 23:21:55] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 85 ms.
[2023-03-15 23:21:58] [INFO ] Deduced a trap composed of 25 places in 409 ms of which 2 ms to minimize.
[2023-03-15 23:21:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 551 ms
[2023-03-15 23:21:59] [INFO ] Added : 173 causal constraints over 36 iterations in 3837 ms. Result :sat
Minimization took 411 ms.
[2023-03-15 23:21:59] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-15 23:21:59] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 23:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:00] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-15 23:22:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:22:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-15 23:22:00] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-15 23:22:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:00] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2023-03-15 23:22:00] [INFO ] [Nat]Added 205 Read/Feed constraints in 54 ms returned sat
[2023-03-15 23:22:01] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 84 ms.
[2023-03-15 23:22:03] [INFO ] Deduced a trap composed of 42 places in 284 ms of which 3 ms to minimize.
[2023-03-15 23:22:03] [INFO ] Deduced a trap composed of 31 places in 338 ms of which 1 ms to minimize.
[2023-03-15 23:22:04] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 0 ms to minimize.
[2023-03-15 23:22:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1174 ms
[2023-03-15 23:22:04] [INFO ] Added : 132 causal constraints over 28 iterations in 3655 ms. Result :sat
Minimization took 220 ms.
[2023-03-15 23:22:05] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-15 23:22:05] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 23:22:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:05] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2023-03-15 23:22:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:22:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 26 ms returned sat
[2023-03-15 23:22:05] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-15 23:22:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:06] [INFO ] [Nat]Absence check using state equation in 399 ms returned sat
[2023-03-15 23:22:06] [INFO ] [Nat]Added 205 Read/Feed constraints in 48 ms returned sat
[2023-03-15 23:22:06] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 82 ms.
[2023-03-15 23:22:08] [INFO ] Deduced a trap composed of 43 places in 419 ms of which 1 ms to minimize.
[2023-03-15 23:22:09] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:22:09] [INFO ] Deduced a trap composed of 69 places in 384 ms of which 4 ms to minimize.
[2023-03-15 23:22:10] [INFO ] Deduced a trap composed of 19 places in 341 ms of which 1 ms to minimize.
[2023-03-15 23:22:10] [INFO ] Deduced a trap composed of 19 places in 363 ms of which 1 ms to minimize.
[2023-03-15 23:22:11] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 1 ms to minimize.
[2023-03-15 23:22:11] [INFO ] Deduced a trap composed of 33 places in 376 ms of which 1 ms to minimize.
[2023-03-15 23:22:12] [INFO ] Deduced a trap composed of 13 places in 357 ms of which 1 ms to minimize.
[2023-03-15 23:22:12] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 1 ms to minimize.
[2023-03-15 23:22:12] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 1 ms to minimize.
[2023-03-15 23:22:13] [INFO ] Deduced a trap composed of 34 places in 385 ms of which 2 ms to minimize.
[2023-03-15 23:22:13] [INFO ] Deduced a trap composed of 84 places in 322 ms of which 1 ms to minimize.
[2023-03-15 23:22:14] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5718 ms
[2023-03-15 23:22:14] [INFO ] Added : 127 causal constraints over 26 iterations in 8158 ms. Result :sat
Minimization took 325 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 476 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 884/884 transitions.
Applied a total of 0 rules in 26 ms. Remains 476 /476 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 476/476 places, 884/884 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 476/476 places, 884/884 transitions.
Applied a total of 0 rules in 22 ms. Remains 476 /476 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2023-03-15 23:22:15] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 476 cols
[2023-03-15 23:22:15] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-15 23:22:16] [INFO ] Implicit Places using invariants in 508 ms returned [440, 452, 453, 454, 455, 456]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 514 ms to find 6 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 470/476 places, 884/884 transitions.
Applied a total of 0 rules in 32 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 470/476 places, 884/884 transitions.
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:22:16] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4593 ms. (steps per millisecond=217 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2977 ms. (steps per millisecond=335 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1048 ms. (steps per millisecond=954 ) properties (out of 3) seen :5
[2023-03-15 23:22:25] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:22:25] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 23:22:25] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-15 23:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:26] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-15 23:22:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:22:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-15 23:22:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:26] [INFO ] [Nat]Absence check using state equation in 368 ms returned sat
[2023-03-15 23:22:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:22:26] [INFO ] [Nat]Added 205 Read/Feed constraints in 86 ms returned sat
[2023-03-15 23:22:27] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 1 ms to minimize.
[2023-03-15 23:22:27] [INFO ] Deduced a trap composed of 57 places in 478 ms of which 3 ms to minimize.
[2023-03-15 23:22:28] [INFO ] Deduced a trap composed of 27 places in 461 ms of which 7 ms to minimize.
[2023-03-15 23:22:28] [INFO ] Deduced a trap composed of 46 places in 466 ms of which 1 ms to minimize.
[2023-03-15 23:22:29] [INFO ] Deduced a trap composed of 37 places in 439 ms of which 1 ms to minimize.
[2023-03-15 23:22:29] [INFO ] Deduced a trap composed of 27 places in 520 ms of which 2 ms to minimize.
[2023-03-15 23:22:30] [INFO ] Deduced a trap composed of 17 places in 520 ms of which 2 ms to minimize.
[2023-03-15 23:22:31] [INFO ] Deduced a trap composed of 49 places in 511 ms of which 1 ms to minimize.
[2023-03-15 23:22:31] [INFO ] Deduced a trap composed of 11 places in 527 ms of which 1 ms to minimize.
[2023-03-15 23:22:32] [INFO ] Deduced a trap composed of 9 places in 492 ms of which 1 ms to minimize.
[2023-03-15 23:22:32] [INFO ] Deduced a trap composed of 49 places in 461 ms of which 1 ms to minimize.
[2023-03-15 23:22:33] [INFO ] Deduced a trap composed of 13 places in 495 ms of which 1 ms to minimize.
[2023-03-15 23:22:33] [INFO ] Deduced a trap composed of 25 places in 507 ms of which 1 ms to minimize.
[2023-03-15 23:22:34] [INFO ] Deduced a trap composed of 53 places in 493 ms of which 1 ms to minimize.
[2023-03-15 23:22:34] [INFO ] Deduced a trap composed of 45 places in 510 ms of which 2 ms to minimize.
[2023-03-15 23:22:35] [INFO ] Deduced a trap composed of 33 places in 453 ms of which 1 ms to minimize.
[2023-03-15 23:22:35] [INFO ] Deduced a trap composed of 55 places in 279 ms of which 1 ms to minimize.
[2023-03-15 23:22:35] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8918 ms
[2023-03-15 23:22:35] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 85 ms.
[2023-03-15 23:22:40] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 1 ms to minimize.
[2023-03-15 23:22:40] [INFO ] Deduced a trap composed of 25 places in 432 ms of which 1 ms to minimize.
[2023-03-15 23:22:41] [INFO ] Deduced a trap composed of 90 places in 227 ms of which 0 ms to minimize.
[2023-03-15 23:22:41] [INFO ] Deduced a trap composed of 51 places in 499 ms of which 1 ms to minimize.
[2023-03-15 23:22:42] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 1 ms to minimize.
[2023-03-15 23:22:42] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 1 ms to minimize.
[2023-03-15 23:22:43] [INFO ] Deduced a trap composed of 61 places in 471 ms of which 1 ms to minimize.
[2023-03-15 23:22:43] [INFO ] Deduced a trap composed of 19 places in 539 ms of which 2 ms to minimize.
[2023-03-15 23:22:44] [INFO ] Deduced a trap composed of 11 places in 499 ms of which 1 ms to minimize.
[2023-03-15 23:22:44] [INFO ] Deduced a trap composed of 31 places in 494 ms of which 1 ms to minimize.
[2023-03-15 23:22:45] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5069 ms
[2023-03-15 23:22:45] [INFO ] Added : 216 causal constraints over 45 iterations in 9394 ms. Result :sat
Minimization took 527 ms.
[2023-03-15 23:22:46] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-15 23:22:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:46] [INFO ] [Real]Absence check using state equation in 374 ms returned sat
[2023-03-15 23:22:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:22:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 27 ms returned sat
[2023-03-15 23:22:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:47] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2023-03-15 23:22:47] [INFO ] [Nat]Added 205 Read/Feed constraints in 58 ms returned sat
[2023-03-15 23:22:47] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 84 ms.
[2023-03-15 23:22:50] [INFO ] Deduced a trap composed of 11 places in 410 ms of which 1 ms to minimize.
[2023-03-15 23:22:50] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 1 ms to minimize.
[2023-03-15 23:22:51] [INFO ] Deduced a trap composed of 25 places in 345 ms of which 1 ms to minimize.
[2023-03-15 23:22:51] [INFO ] Deduced a trap composed of 27 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:22:51] [INFO ] Deduced a trap composed of 11 places in 420 ms of which 1 ms to minimize.
[2023-03-15 23:22:52] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 2 ms to minimize.
[2023-03-15 23:22:52] [INFO ] Deduced a trap composed of 11 places in 368 ms of which 1 ms to minimize.
[2023-03-15 23:22:53] [INFO ] Deduced a trap composed of 11 places in 377 ms of which 0 ms to minimize.
[2023-03-15 23:22:53] [INFO ] Deduced a trap composed of 37 places in 322 ms of which 1 ms to minimize.
[2023-03-15 23:22:54] [INFO ] Deduced a trap composed of 37 places in 292 ms of which 1 ms to minimize.
[2023-03-15 23:22:54] [INFO ] Deduced a trap composed of 39 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:22:55] [INFO ] Deduced a trap composed of 55 places in 290 ms of which 1 ms to minimize.
[2023-03-15 23:22:55] [INFO ] Deduced a trap composed of 70 places in 289 ms of which 1 ms to minimize.
[2023-03-15 23:22:55] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5978 ms
[2023-03-15 23:22:56] [INFO ] Added : 161 causal constraints over 34 iterations in 9040 ms. Result :sat
Minimization took 265 ms.
[2023-03-15 23:22:56] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-15 23:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:57] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-03-15 23:22:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:22:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-15 23:22:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:22:57] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2023-03-15 23:22:57] [INFO ] [Nat]Added 205 Read/Feed constraints in 60 ms returned sat
[2023-03-15 23:22:57] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 78 ms.
[2023-03-15 23:23:00] [INFO ] Deduced a trap composed of 33 places in 400 ms of which 1 ms to minimize.
[2023-03-15 23:23:00] [INFO ] Deduced a trap composed of 45 places in 396 ms of which 1 ms to minimize.
[2023-03-15 23:23:01] [INFO ] Deduced a trap composed of 11 places in 392 ms of which 1 ms to minimize.
[2023-03-15 23:23:01] [INFO ] Deduced a trap composed of 39 places in 413 ms of which 1 ms to minimize.
[2023-03-15 23:23:02] [INFO ] Deduced a trap composed of 13 places in 375 ms of which 1 ms to minimize.
[2023-03-15 23:23:02] [INFO ] Deduced a trap composed of 13 places in 371 ms of which 1 ms to minimize.
[2023-03-15 23:23:03] [INFO ] Deduced a trap composed of 13 places in 369 ms of which 1 ms to minimize.
[2023-03-15 23:23:03] [INFO ] Deduced a trap composed of 27 places in 343 ms of which 0 ms to minimize.
[2023-03-15 23:23:04] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 1 ms to minimize.
[2023-03-15 23:23:04] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 1 ms to minimize.
[2023-03-15 23:23:05] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 0 ms to minimize.
[2023-03-15 23:23:05] [INFO ] Deduced a trap composed of 25 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:23:05] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 1 ms to minimize.
[2023-03-15 23:23:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6023 ms
[2023-03-15 23:23:06] [INFO ] Added : 160 causal constraints over 32 iterations in 8712 ms. Result :sat
Minimization took 437 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 470 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 470/470 places, 884/884 transitions.
Applied a total of 0 rules in 19 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 470/470 places, 884/884 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 470/470 places, 884/884 transitions.
Applied a total of 0 rules in 17 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2023-03-15 23:23:08] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:23:08] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 23:23:08] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-15 23:23:08] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:23:08] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 23:23:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:23:10] [INFO ] Implicit Places using invariants and state equation in 2056 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
[2023-03-15 23:23:10] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-15 23:23:10] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:23:10] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 23:23:12] [INFO ] Dead Transitions using invariants and state equation in 1111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 470/470 places, 884/884 transitions.
Starting property specific reduction for Peterson-PT-5-UpperBounds-03
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:23:12] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :1
[2023-03-15 23:23:12] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:23:12] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 23:23:12] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-15 23:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:23:12] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2023-03-15 23:23:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:23:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-15 23:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:23:13] [INFO ] [Nat]Absence check using state equation in 383 ms returned sat
[2023-03-15 23:23:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:23:13] [INFO ] [Nat]Added 205 Read/Feed constraints in 145 ms returned sat
[2023-03-15 23:23:14] [INFO ] Deduced a trap composed of 59 places in 471 ms of which 1 ms to minimize.
[2023-03-15 23:23:14] [INFO ] Deduced a trap composed of 31 places in 456 ms of which 2 ms to minimize.
[2023-03-15 23:23:15] [INFO ] Deduced a trap composed of 17 places in 472 ms of which 2 ms to minimize.
[2023-03-15 23:23:15] [INFO ] Deduced a trap composed of 17 places in 475 ms of which 1 ms to minimize.
[2023-03-15 23:23:16] [INFO ] Deduced a trap composed of 17 places in 485 ms of which 1 ms to minimize.
[2023-03-15 23:23:16] [INFO ] Deduced a trap composed of 19 places in 479 ms of which 1 ms to minimize.
[2023-03-15 23:23:17] [INFO ] Deduced a trap composed of 19 places in 484 ms of which 1 ms to minimize.
[2023-03-15 23:23:17] [INFO ] Deduced a trap composed of 13 places in 497 ms of which 1 ms to minimize.
[2023-03-15 23:23:18] [INFO ] Deduced a trap composed of 2 places in 477 ms of which 1 ms to minimize.
[2023-03-15 23:23:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [180] Max seen :[4]
Support contains 180 out of 470 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 470/470 places, 884/884 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 470 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 468 transition count 882
Applied a total of 4 rules in 42 ms. Remains 468 /470 variables (removed 2) and now considering 882/884 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/470 places, 882/884 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:23:18] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4382 ms. (steps per millisecond=228 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2865 ms. (steps per millisecond=349 ) properties (out of 1) seen :2
[2023-03-15 23:23:25] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:23:25] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 23:23:25] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-15 23:23:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:23:26] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2023-03-15 23:23:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:23:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 23:23:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:23:26] [INFO ] [Nat]Absence check using state equation in 320 ms returned sat
[2023-03-15 23:23:26] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:23:26] [INFO ] [Nat]Added 205 Read/Feed constraints in 142 ms returned sat
[2023-03-15 23:23:27] [INFO ] Deduced a trap composed of 23 places in 494 ms of which 1 ms to minimize.
[2023-03-15 23:23:27] [INFO ] Deduced a trap composed of 25 places in 482 ms of which 1 ms to minimize.
[2023-03-15 23:23:28] [INFO ] Deduced a trap composed of 17 places in 456 ms of which 1 ms to minimize.
[2023-03-15 23:23:28] [INFO ] Deduced a trap composed of 45 places in 506 ms of which 1 ms to minimize.
[2023-03-15 23:23:29] [INFO ] Deduced a trap composed of 11 places in 495 ms of which 1 ms to minimize.
[2023-03-15 23:23:29] [INFO ] Deduced a trap composed of 11 places in 444 ms of which 1 ms to minimize.
[2023-03-15 23:23:30] [INFO ] Deduced a trap composed of 11 places in 445 ms of which 1 ms to minimize.
[2023-03-15 23:23:30] [INFO ] Deduced a trap composed of 11 places in 438 ms of which 1 ms to minimize.
[2023-03-15 23:23:31] [INFO ] Deduced a trap composed of 11 places in 399 ms of which 1 ms to minimize.
[2023-03-15 23:23:31] [INFO ] Deduced a trap composed of 58 places in 433 ms of which 1 ms to minimize.
[2023-03-15 23:23:32] [INFO ] Deduced a trap composed of 11 places in 419 ms of which 1 ms to minimize.
[2023-03-15 23:23:32] [INFO ] Deduced a trap composed of 33 places in 409 ms of which 1 ms to minimize.
[2023-03-15 23:23:33] [INFO ] Deduced a trap composed of 78 places in 394 ms of which 0 ms to minimize.
[2023-03-15 23:23:33] [INFO ] Deduced a trap composed of 49 places in 326 ms of which 1 ms to minimize.
[2023-03-15 23:23:33] [INFO ] Deduced a trap composed of 91 places in 264 ms of which 1 ms to minimize.
[2023-03-15 23:23:34] [INFO ] Deduced a trap composed of 77 places in 252 ms of which 1 ms to minimize.
[2023-03-15 23:23:34] [INFO ] Deduced a trap composed of 71 places in 293 ms of which 1 ms to minimize.
[2023-03-15 23:23:34] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7809 ms
[2023-03-15 23:23:34] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 75 ms.
[2023-03-15 23:23:37] [INFO ] Deduced a trap composed of 78 places in 424 ms of which 3 ms to minimize.
[2023-03-15 23:23:38] [INFO ] Deduced a trap composed of 27 places in 393 ms of which 1 ms to minimize.
[2023-03-15 23:23:38] [INFO ] Deduced a trap composed of 82 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:23:39] [INFO ] Deduced a trap composed of 34 places in 358 ms of which 1 ms to minimize.
[2023-03-15 23:23:40] [INFO ] Deduced a trap composed of 95 places in 288 ms of which 1 ms to minimize.
[2023-03-15 23:23:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2770 ms
[2023-03-15 23:23:40] [INFO ] Added : 165 causal constraints over 34 iterations in 5901 ms. Result :sat
Minimization took 360 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 27 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 24 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-15 23:23:40] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:23:41] [INFO ] Computed 17 place invariants in 16 ms
[2023-03-15 23:23:41] [INFO ] Implicit Places using invariants in 717 ms returned []
[2023-03-15 23:23:41] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:23:41] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 23:23:42] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:23:44] [INFO ] Implicit Places using invariants and state equation in 2647 ms returned []
Implicit Place search using SMT with State Equation took 3368 ms to find 0 implicit places.
[2023-03-15 23:23:44] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-15 23:23:44] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:23:44] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 23:23:45] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:23:45] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4404 ms. (steps per millisecond=227 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2765 ms. (steps per millisecond=361 ) properties (out of 1) seen :2
[2023-03-15 23:23:52] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:23:52] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 23:23:52] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 23:23:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:23:52] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2023-03-15 23:23:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:23:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-15 23:23:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:23:53] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-15 23:23:53] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:23:53] [INFO ] [Nat]Added 205 Read/Feed constraints in 140 ms returned sat
[2023-03-15 23:23:54] [INFO ] Deduced a trap composed of 23 places in 482 ms of which 1 ms to minimize.
[2023-03-15 23:23:54] [INFO ] Deduced a trap composed of 25 places in 475 ms of which 2 ms to minimize.
[2023-03-15 23:23:55] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2023-03-15 23:23:55] [INFO ] Deduced a trap composed of 45 places in 496 ms of which 1 ms to minimize.
[2023-03-15 23:23:56] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2023-03-15 23:23:56] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 1 ms to minimize.
[2023-03-15 23:23:57] [INFO ] Deduced a trap composed of 11 places in 461 ms of which 1 ms to minimize.
[2023-03-15 23:23:57] [INFO ] Deduced a trap composed of 11 places in 439 ms of which 1 ms to minimize.
[2023-03-15 23:23:58] [INFO ] Deduced a trap composed of 11 places in 499 ms of which 2 ms to minimize.
[2023-03-15 23:23:59] [INFO ] Deduced a trap composed of 58 places in 486 ms of which 1 ms to minimize.
[2023-03-15 23:23:59] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 1 ms to minimize.
[2023-03-15 23:24:00] [INFO ] Deduced a trap composed of 33 places in 459 ms of which 1 ms to minimize.
[2023-03-15 23:24:00] [INFO ] Deduced a trap composed of 78 places in 476 ms of which 2 ms to minimize.
[2023-03-15 23:24:01] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2023-03-15 23:24:01] [INFO ] Deduced a trap composed of 91 places in 323 ms of which 1 ms to minimize.
[2023-03-15 23:24:01] [INFO ] Deduced a trap composed of 77 places in 327 ms of which 1 ms to minimize.
[2023-03-15 23:24:02] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 0 ms to minimize.
[2023-03-15 23:24:02] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8488 ms
[2023-03-15 23:24:02] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 70 ms.
[2023-03-15 23:24:05] [INFO ] Deduced a trap composed of 78 places in 385 ms of which 1 ms to minimize.
[2023-03-15 23:24:05] [INFO ] Deduced a trap composed of 27 places in 382 ms of which 1 ms to minimize.
[2023-03-15 23:24:06] [INFO ] Deduced a trap composed of 82 places in 362 ms of which 1 ms to minimize.
[2023-03-15 23:24:06] [INFO ] Deduced a trap composed of 34 places in 324 ms of which 1 ms to minimize.
[2023-03-15 23:24:07] [INFO ] Deduced a trap composed of 95 places in 250 ms of which 1 ms to minimize.
[2023-03-15 23:24:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2614 ms
[2023-03-15 23:24:07] [INFO ] Added : 165 causal constraints over 34 iterations in 5247 ms. Result :sat
Minimization took 343 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 27 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 24 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-15 23:24:07] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:24:07] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 23:24:08] [INFO ] Implicit Places using invariants in 610 ms returned []
[2023-03-15 23:24:08] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:24:08] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 23:24:09] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:24:11] [INFO ] Implicit Places using invariants and state equation in 2504 ms returned []
Implicit Place search using SMT with State Equation took 3117 ms to find 0 implicit places.
[2023-03-15 23:24:11] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 23:24:11] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-15 23:24:11] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-15 23:24:12] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 468/468 places, 882/882 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-03 in 60152 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-08
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:24:12] [INFO ] Computed 17 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-15 23:24:12] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:24:12] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 23:24:12] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-15 23:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:12] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-15 23:24:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:24:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-15 23:24:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:13] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-03-15 23:24:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:24:13] [INFO ] [Nat]Added 205 Read/Feed constraints in 54 ms returned sat
[2023-03-15 23:24:13] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 93 ms.
[2023-03-15 23:24:16] [INFO ] Deduced a trap composed of 11 places in 391 ms of which 1 ms to minimize.
[2023-03-15 23:24:16] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 0 ms to minimize.
[2023-03-15 23:24:17] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 1 ms to minimize.
[2023-03-15 23:24:17] [INFO ] Deduced a trap composed of 27 places in 361 ms of which 0 ms to minimize.
[2023-03-15 23:24:18] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:24:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 470 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 470/470 places, 882/882 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 469 transition count 825
Reduce places removed 57 places and 2 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 412 transition count 823
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 411 transition count 822
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 410 transition count 820
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 409 transition count 819
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 123 Pre rules applied. Total rules applied 117 place count 409 transition count 696
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 363 place count 286 transition count 696
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 421 place count 257 transition count 667
Applied a total of 421 rules in 107 ms. Remains 257 /470 variables (removed 213) and now considering 667/882 (removed 215) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/470 places, 667/882 transitions.
Normalized transition count is 547 out of 667 initially.
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:18] [INFO ] Computed 17 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1999 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 754 ms. (steps per millisecond=1326 ) properties (out of 1) seen :0
[2023-03-15 23:24:21] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:21] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 23:24:21] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-15 23:24:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:21] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-15 23:24:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:24:21] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-15 23:24:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:21] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2023-03-15 23:24:21] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-15 23:24:21] [INFO ] [Nat]Added 202 Read/Feed constraints in 41 ms returned sat
[2023-03-15 23:24:21] [INFO ] Computed and/alt/rep : 481/1533/481 causal constraints (skipped 60 transitions) in 76 ms.
[2023-03-15 23:24:22] [INFO ] Deduced a trap composed of 9 places in 218 ms of which 1 ms to minimize.
[2023-03-15 23:24:22] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 0 ms to minimize.
[2023-03-15 23:24:23] [INFO ] Deduced a trap composed of 23 places in 194 ms of which 0 ms to minimize.
[2023-03-15 23:24:23] [INFO ] Deduced a trap composed of 17 places in 221 ms of which 1 ms to minimize.
[2023-03-15 23:24:23] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 0 ms to minimize.
[2023-03-15 23:24:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1350 ms
[2023-03-15 23:24:23] [INFO ] Added : 60 causal constraints over 13 iterations in 2223 ms. Result :sat
Minimization took 130 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 16 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 14 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-15 23:24:24] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:24] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 23:24:24] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-15 23:24:24] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:24] [INFO ] Computed 17 place invariants in 17 ms
[2023-03-15 23:24:24] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-15 23:24:25] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 1487 ms to find 0 implicit places.
[2023-03-15 23:24:25] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 23:24:25] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:25] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 23:24:26] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 257/257 places, 667/667 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-08 in 14161 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-12
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:24:26] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
[2023-03-15 23:24:26] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-15 23:24:26] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-15 23:24:26] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-15 23:24:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:26] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-15 23:24:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:24:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-15 23:24:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:27] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2023-03-15 23:24:27] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-15 23:24:27] [INFO ] [Nat]Added 205 Read/Feed constraints in 62 ms returned sat
[2023-03-15 23:24:27] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 83 ms.
[2023-03-15 23:24:29] [INFO ] Deduced a trap composed of 33 places in 426 ms of which 1 ms to minimize.
[2023-03-15 23:24:30] [INFO ] Deduced a trap composed of 45 places in 367 ms of which 1 ms to minimize.
[2023-03-15 23:24:30] [INFO ] Deduced a trap composed of 11 places in 374 ms of which 1 ms to minimize.
[2023-03-15 23:24:31] [INFO ] Deduced a trap composed of 39 places in 404 ms of which 1 ms to minimize.
[2023-03-15 23:24:31] [INFO ] Deduced a trap composed of 13 places in 378 ms of which 1 ms to minimize.
[2023-03-15 23:24:32] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 1 ms to minimize.
[2023-03-15 23:24:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:657)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 470 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 470/470 places, 883/883 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 469 transition count 826
Reduce places removed 56 places and 1 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 413 transition count 825
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 412 transition count 823
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 411 transition count 822
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 410 transition count 820
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 409 transition count 819
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 123 Pre rules applied. Total rules applied 116 place count 409 transition count 696
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 6 with 246 rules applied. Total rules applied 362 place count 286 transition count 696
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 420 place count 257 transition count 667
Applied a total of 420 rules in 77 ms. Remains 257 /470 variables (removed 213) and now considering 667/883 (removed 216) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/470 places, 667/883 transitions.
Normalized transition count is 547 out of 667 initially.
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:32] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2057 ms. (steps per millisecond=486 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 704 ms. (steps per millisecond=1420 ) properties (out of 1) seen :0
[2023-03-15 23:24:35] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:35] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 23:24:35] [INFO ] [Real]Absence check using 17 positive place invariants in 11 ms returned sat
[2023-03-15 23:24:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:35] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-15 23:24:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 23:24:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-15 23:24:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 23:24:35] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2023-03-15 23:24:35] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-15 23:24:35] [INFO ] [Nat]Added 202 Read/Feed constraints in 33 ms returned sat
[2023-03-15 23:24:35] [INFO ] Computed and/alt/rep : 481/1528/481 causal constraints (skipped 60 transitions) in 56 ms.
[2023-03-15 23:24:36] [INFO ] Deduced a trap composed of 16 places in 233 ms of which 0 ms to minimize.
[2023-03-15 23:24:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 318 ms
[2023-03-15 23:24:36] [INFO ] Added : 64 causal constraints over 13 iterations in 1179 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 18 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 15 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-15 23:24:37] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:37] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 23:24:37] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-15 23:24:37] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:37] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-15 23:24:37] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-15 23:24:38] [INFO ] Implicit Places using invariants and state equation in 1297 ms returned []
Implicit Place search using SMT with State Equation took 1691 ms to find 0 implicit places.
[2023-03-15 23:24:38] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 23:24:38] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-15 23:24:38] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 23:24:39] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 257/257 places, 667/667 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-12 in 12982 ms.
[2023-03-15 23:24:39] [INFO ] Flatten gal took : 153 ms
[2023-03-15 23:24:39] [INFO ] Applying decomposition
[2023-03-15 23:24:39] [INFO ] Flatten gal took : 77 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17815219092332736984.txt' '-o' '/tmp/graph17815219092332736984.bin' '-w' '/tmp/graph17815219092332736984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17815219092332736984.bin' '-l' '-1' '-v' '-w' '/tmp/graph17815219092332736984.weights' '-q' '0' '-e' '0.001'
[2023-03-15 23:24:40] [INFO ] Decomposing Gal with order
[2023-03-15 23:24:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 23:24:40] [INFO ] Removed a total of 1156 redundant transitions.
[2023-03-15 23:24:40] [INFO ] Flatten gal took : 193 ms
[2023-03-15 23:24:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 40 ms.
[2023-03-15 23:24:40] [INFO ] Time to serialize gal into /tmp/UpperBounds11908125085255143547.gal : 22 ms
[2023-03-15 23:24:40] [INFO ] Time to serialize properties into /tmp/UpperBounds12784458743916646687.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds11908125085255143547.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds12784458743916646687.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds12784458743916646687.prop.
Detected timeout of ITS tools.
[2023-03-15 23:46:09] [INFO ] Applying decomposition
[2023-03-15 23:46:10] [INFO ] Flatten gal took : 859 ms
[2023-03-15 23:46:11] [INFO ] Decomposing Gal with order
[2023-03-15 23:46:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 23:46:12] [INFO ] Removed a total of 771 redundant transitions.
[2023-03-15 23:46:12] [INFO ] Flatten gal took : 1338 ms
[2023-03-15 23:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 387 labels/synchronizations in 157 ms.
[2023-03-15 23:46:13] [INFO ] Time to serialize gal into /tmp/UpperBounds16523608464024130359.gal : 82 ms
[2023-03-15 23:46:13] [INFO ] Time to serialize properties into /tmp/UpperBounds15584961952849581114.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16523608464024130359.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15584961952849581114.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...297
Loading property file /tmp/UpperBounds15584961952849581114.prop.
Detected timeout of ITS tools.
[2023-03-16 00:07:37] [INFO ] Flatten gal took : 929 ms
[2023-03-16 00:07:41] [INFO ] Input system was already deterministic with 884 transitions.
[2023-03-16 00:07:41] [INFO ] Transformed 470 places.
[2023-03-16 00:07:42] [INFO ] Transformed 884 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-16 00:07:42] [INFO ] Time to serialize gal into /tmp/UpperBounds6133651408669046139.gal : 85 ms
[2023-03-16 00:07:42] [INFO ] Time to serialize properties into /tmp/UpperBounds5633350472884455248.prop : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds6133651408669046139.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds5633350472884455248.prop' '--nowitness' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...340
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds5633350472884455248.prop.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is Peterson-PT-5, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r287-smll-167863553800079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;