About the Execution of ITS-Tools for Sudoku-PT-AN16
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r258-tall-165303545600325.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Sudoku-PT-AN16, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545600325
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 61M
-rw-r--r-- 1 mcc users 1.2M Apr 30 12:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 5.4M Apr 30 12:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0M Apr 30 11:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 33M Apr 30 11:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 445K May 9 09:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.5M May 9 09:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1M May 9 09:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3M May 9 09:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 199K May 9 09:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 480K May 9 09:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 2.3M May 10 09:34 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-00
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-01
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-02
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-03
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-04
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-05
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-06
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-07
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-08
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-09
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-10
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-11
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-12
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-13
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-14
FORMULA_NAME Sudoku-PT-AN16-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1653116913114
Running Version 202205111006
[2022-05-21 07:08:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-21 07:08:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 07:08:34] [INFO ] Load time of PNML (sax parser for PT used): 305 ms
[2022-05-21 07:08:34] [INFO ] Transformed 4864 places.
[2022-05-21 07:08:34] [INFO ] Transformed 4096 transitions.
[2022-05-21 07:08:34] [INFO ] Parsed PT model containing 4864 places and 4096 transitions in 428 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 208 ms.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:08:35] [INFO ] Computed 768 place invariants in 76 ms
FORMULA Sudoku-PT-AN16-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-06 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-04 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-02 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-01 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN16-UpperBounds-00 256 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 44 resets, run finished after 5220 ms. (steps per millisecond=1 ) properties (out of 4) seen :691
FORMULA Sudoku-PT-AN16-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 943 ms. (steps per millisecond=10 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 879 ms. (steps per millisecond=11 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 854 ms. (steps per millisecond=11 ) properties (out of 3) seen :3
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:08:43] [INFO ] Computed 768 place invariants in 35 ms
[2022-05-21 07:08:44] [INFO ] [Real]Absence check using 768 positive place invariants in 1091 ms returned sat
[2022-05-21 07:08:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:08:47] [INFO ] [Real]Absence check using state equation in 3196 ms returned sat
[2022-05-21 07:08:56] [INFO ] Deduced a trap composed of 17 places in 8555 ms of which 16 ms to minimize.
[2022-05-21 07:08: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 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:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-21 07:08:58] [INFO ] [Real]Absence check using 768 positive place invariants in 1096 ms returned sat
[2022-05-21 07:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:09:01] [INFO ] [Real]Absence check using state equation in 3233 ms returned sat
[2022-05-21 07:09:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1001)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-05-21 07:09:03] [INFO ] [Real]Absence check using 768 positive place invariants in 1148 ms returned sat
[2022-05-21 07:09:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:09:06] [INFO ] [Real]Absence check using state equation in 3223 ms returned sat
[2022-05-21 07:09:15] [INFO ] Deduced a trap composed of 17 places in 8726 ms of which 6 ms to minimize.
[2022-05-21 07:09:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
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) : [4096, 4096, 4096] Max seen :[230, 230, 230]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 334 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:09:16] [INFO ] Computed 768 place invariants in 33 ms
Finished random walk after 58660 steps, including 259 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 59797 steps, including 0 resets, run visited all 3 properties in 5037 ms. (steps per millisecond=11 )
Finished Best-First random walk after 49217 steps, including 0 resets, run visited all 3 properties in 5095 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49199 steps, including 0 resets, run visited all 3 properties in 5013 ms. (steps per millisecond=9 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:10:01] [INFO ] Computed 768 place invariants in 22 ms
[2022-05-21 07:10:04] [INFO ] [Real]Absence check using 768 positive place invariants in 2285 ms returned sat
[2022-05-21 07:10:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:10:07] [INFO ] [Real]Absence check using state equation in 3134 ms returned sat
[2022-05-21 07:10:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:10:10] [INFO ] [Nat]Absence check using 768 positive place invariants in 3102 ms returned sat
[2022-05-21 07:10:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:10:14] [INFO ] [Nat]Absence check using state equation in 3304 ms returned sat
[2022-05-21 07:10:14] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 156 ms.
[2022-05-21 07:10:15] [INFO ] Added : 0 causal constraints over 0 iterations in 602 ms. Result :sat
[2022-05-21 07:10:18] [INFO ] [Real]Absence check using 768 positive place invariants in 2283 ms returned sat
[2022-05-21 07:10:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:10:21] [INFO ] [Real]Absence check using state equation in 3318 ms returned sat
[2022-05-21 07:10:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:10:25] [INFO ] [Nat]Absence check using 768 positive place invariants in 3152 ms returned sat
[2022-05-21 07:10:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:10:28] [INFO ] [Nat]Absence check using state equation in 3378 ms returned sat
[2022-05-21 07:10:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 161 ms.
[2022-05-21 07:10:29] [INFO ] Added : 0 causal constraints over 0 iterations in 514 ms. Result :sat
[2022-05-21 07:10:32] [INFO ] [Real]Absence check using 768 positive place invariants in 2308 ms returned sat
[2022-05-21 07:10:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:10:35] [INFO ] [Real]Absence check using state equation in 3253 ms returned sat
[2022-05-21 07:10:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:10:39] [INFO ] [Nat]Absence check using 768 positive place invariants in 3013 ms returned sat
[2022-05-21 07:10:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:10:42] [INFO ] [Nat]Absence check using state equation in 3424 ms returned sat
[2022-05-21 07:10:43] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 149 ms.
[2022-05-21 07:10:43] [INFO ] Added : 0 causal constraints over 0 iterations in 529 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096, 4096, 4096] Max seen :[232, 232, 232]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 206 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 104 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:11:04] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:11:05] [INFO ] Implicit Places using invariants in 1387 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:11:05] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:11:06] [INFO ] Implicit Places using invariants and state equation in 1502 ms returned []
Implicit Place search using SMT with State Equation took 2892 ms to find 0 implicit places.
[2022-05-21 07:11:07] [INFO ] Redundant transitions in 268 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:11:07] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-21 07:11:10] [INFO ] Dead Transitions using invariants and state equation in 2782 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:11:10] [INFO ] Computed 768 place invariants in 20 ms
Finished random walk after 58699 steps, including 259 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 48195 steps, including 0 resets, run visited all 3 properties in 5026 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49219 steps, including 0 resets, run visited all 3 properties in 5082 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49237 steps, including 0 resets, run visited all 3 properties in 5087 ms. (steps per millisecond=9 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:11:55] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:11:57] [INFO ] [Real]Absence check using 768 positive place invariants in 1407 ms returned sat
[2022-05-21 07:11:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:12:00] [INFO ] [Real]Absence check using state equation in 3067 ms returned sat
[2022-05-21 07:12:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:12:07] [INFO ] [Nat]Absence check using 768 positive place invariants in 6991 ms returned sat
[2022-05-21 07:12:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:12:11] [INFO ] [Nat]Absence check using state equation in 3749 ms returned sat
[2022-05-21 07:12:11] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 143 ms.
[2022-05-21 07:12:12] [INFO ] Added : 0 causal constraints over 0 iterations in 503 ms. Result :sat
[2022-05-21 07:12:14] [INFO ] [Real]Absence check using 768 positive place invariants in 1334 ms returned sat
[2022-05-21 07:12:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:12:17] [INFO ] [Real]Absence check using state equation in 3033 ms returned sat
[2022-05-21 07:12:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:12:24] [INFO ] [Nat]Absence check using 768 positive place invariants in 6837 ms returned sat
[2022-05-21 07:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:12:28] [INFO ] [Nat]Absence check using state equation in 3735 ms returned sat
[2022-05-21 07:12:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 137 ms.
[2022-05-21 07:12:28] [INFO ] Added : 0 causal constraints over 0 iterations in 450 ms. Result :sat
[2022-05-21 07:12:30] [INFO ] [Real]Absence check using 768 positive place invariants in 1334 ms returned sat
[2022-05-21 07:12:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:12:33] [INFO ] [Real]Absence check using state equation in 2984 ms returned sat
[2022-05-21 07:12:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:12:41] [INFO ] [Nat]Absence check using 768 positive place invariants in 6957 ms returned sat
[2022-05-21 07:12:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:12:45] [INFO ] [Nat]Absence check using state equation in 3744 ms returned sat
[2022-05-21 07:12:45] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 157 ms.
[2022-05-21 07:12:45] [INFO ] Added : 0 causal constraints over 0 iterations in 524 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096, 4096, 4096] Max seen :[234, 234, 234]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 228 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 190 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:13:06] [INFO ] Computed 768 place invariants in 25 ms
[2022-05-21 07:13:07] [INFO ] Implicit Places using invariants in 1427 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:13:07] [INFO ] Computed 768 place invariants in 21 ms
[2022-05-21 07:13:09] [INFO ] Implicit Places using invariants and state equation in 1416 ms returned []
Implicit Place search using SMT with State Equation took 2860 ms to find 0 implicit places.
[2022-05-21 07:13:09] [INFO ] Redundant transitions in 262 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:13:09] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:13:12] [INFO ] Dead Transitions using invariants and state equation in 2776 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:13:12] [INFO ] Computed 768 place invariants in 19 ms
Finished random walk after 58729 steps, including 259 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 49745 steps, including 0 resets, run visited all 3 properties in 5019 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49777 steps, including 0 resets, run visited all 3 properties in 5055 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49759 steps, including 0 resets, run visited all 3 properties in 5026 ms. (steps per millisecond=9 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:13:57] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:13:59] [INFO ] [Real]Absence check using 768 positive place invariants in 1496 ms returned sat
[2022-05-21 07:13:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:02] [INFO ] [Real]Absence check using state equation in 3419 ms returned sat
[2022-05-21 07:14:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:14:04] [INFO ] [Nat]Absence check using 768 positive place invariants in 1412 ms returned sat
[2022-05-21 07:14:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:08] [INFO ] [Nat]Absence check using state equation in 3320 ms returned sat
[2022-05-21 07:14:08] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 165 ms.
[2022-05-21 07:14:08] [INFO ] Added : 0 causal constraints over 0 iterations in 478 ms. Result :sat
[2022-05-21 07:14:10] [INFO ] [Real]Absence check using 768 positive place invariants in 1471 ms returned sat
[2022-05-21 07:14:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:14] [INFO ] [Real]Absence check using state equation in 3451 ms returned sat
[2022-05-21 07:14:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:14:16] [INFO ] [Nat]Absence check using 768 positive place invariants in 1395 ms returned sat
[2022-05-21 07:14:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:19] [INFO ] [Nat]Absence check using state equation in 3446 ms returned sat
[2022-05-21 07:14:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 145 ms.
[2022-05-21 07:14:20] [INFO ] Added : 0 causal constraints over 0 iterations in 457 ms. Result :sat
[2022-05-21 07:14:22] [INFO ] [Real]Absence check using 768 positive place invariants in 1465 ms returned sat
[2022-05-21 07:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:26] [INFO ] [Real]Absence check using state equation in 3431 ms returned sat
[2022-05-21 07:14:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:14:28] [INFO ] [Nat]Absence check using 768 positive place invariants in 1478 ms returned sat
[2022-05-21 07:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:14:31] [INFO ] [Nat]Absence check using state equation in 3697 ms returned sat
[2022-05-21 07:14:32] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 158 ms.
[2022-05-21 07:14:32] [INFO ] Added : 0 causal constraints over 0 iterations in 485 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096, 4096, 4096] Max seen :[235, 235, 235]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 75 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 76 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:14:53] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-21 07:14:54] [INFO ] Implicit Places using invariants in 1290 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:14:54] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:14:55] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 2698 ms to find 0 implicit places.
[2022-05-21 07:14:55] [INFO ] Redundant transitions in 169 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:14:55] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:14:58] [INFO ] Dead Transitions using invariants and state equation in 2652 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:14:58] [INFO ] Computed 768 place invariants in 15 ms
Finished random walk after 58934 steps, including 260 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 49835 steps, including 0 resets, run visited all 3 properties in 5055 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49225 steps, including 0 resets, run visited all 3 properties in 5079 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49213 steps, including 0 resets, run visited all 3 properties in 5062 ms. (steps per millisecond=9 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:15:43] [INFO ] Computed 768 place invariants in 15 ms
[2022-05-21 07:15:46] [INFO ] [Real]Absence check using 768 positive place invariants in 2043 ms returned sat
[2022-05-21 07:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:15:49] [INFO ] [Real]Absence check using state equation in 3353 ms returned sat
[2022-05-21 07:15:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:15:54] [INFO ] [Nat]Absence check using 768 positive place invariants in 3981 ms returned sat
[2022-05-21 07:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:15:57] [INFO ] [Nat]Absence check using state equation in 3511 ms returned sat
[2022-05-21 07:15:58] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 167 ms.
[2022-05-21 07:15:58] [INFO ] Added : 0 causal constraints over 0 iterations in 525 ms. Result :sat
[2022-05-21 07:16:01] [INFO ] [Real]Absence check using 768 positive place invariants in 2003 ms returned sat
[2022-05-21 07:16:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:04] [INFO ] [Real]Absence check using state equation in 3322 ms returned sat
[2022-05-21 07:16:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:16:09] [INFO ] [Nat]Absence check using 768 positive place invariants in 4223 ms returned sat
[2022-05-21 07:16:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:13] [INFO ] [Nat]Absence check using state equation in 3701 ms returned sat
[2022-05-21 07:16:13] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 179 ms.
[2022-05-21 07:16:13] [INFO ] Added : 0 causal constraints over 0 iterations in 508 ms. Result :sat
[2022-05-21 07:16:16] [INFO ] [Real]Absence check using 768 positive place invariants in 2005 ms returned sat
[2022-05-21 07:16:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:19] [INFO ] [Real]Absence check using state equation in 3314 ms returned sat
[2022-05-21 07:16:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:16:24] [INFO ] [Nat]Absence check using 768 positive place invariants in 3990 ms returned sat
[2022-05-21 07:16:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:16:27] [INFO ] [Nat]Absence check using state equation in 3496 ms returned sat
[2022-05-21 07:16:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 161 ms.
[2022-05-21 07:16:28] [INFO ] Added : 0 causal constraints over 0 iterations in 480 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096, 4096, 4096] Max seen :[236, 236, 236]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 70 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 67 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:16:49] [INFO ] Computed 768 place invariants in 20 ms
[2022-05-21 07:16:50] [INFO ] Implicit Places using invariants in 1420 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:16:50] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-21 07:16:51] [INFO ] Implicit Places using invariants and state equation in 1407 ms returned []
Implicit Place search using SMT with State Equation took 2828 ms to find 0 implicit places.
[2022-05-21 07:16:52] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:16:52] [INFO ] Computed 768 place invariants in 15 ms
[2022-05-21 07:16:54] [INFO ] Dead Transitions using invariants and state equation in 2802 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:16:54] [INFO ] Computed 768 place invariants in 17 ms
Finished random walk after 58717 steps, including 259 resets, run visited all 3 properties in 30001 ms. (steps per millisecond=1 )
Finished Best-First random walk after 49767 steps, including 0 resets, run visited all 3 properties in 5027 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49225 steps, including 0 resets, run visited all 3 properties in 5015 ms. (steps per millisecond=9 )
Finished Best-First random walk after 49767 steps, including 0 resets, run visited all 3 properties in 5041 ms. (steps per millisecond=9 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:17:40] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:17:42] [INFO ] [Real]Absence check using 768 positive place invariants in 2230 ms returned sat
[2022-05-21 07:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:17:46] [INFO ] [Real]Absence check using state equation in 3420 ms returned sat
[2022-05-21 07:17:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:17:52] [INFO ] [Nat]Absence check using 768 positive place invariants in 5772 ms returned unknown
[2022-05-21 07:17:55] [INFO ] [Real]Absence check using 768 positive place invariants in 2352 ms returned sat
[2022-05-21 07:17:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:17:58] [INFO ] [Real]Absence check using state equation in 3584 ms returned sat
[2022-05-21 07:17:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:18:05] [INFO ] [Nat]Absence check using 768 positive place invariants in 5853 ms returned unknown
[2022-05-21 07:18:07] [INFO ] [Real]Absence check using 768 positive place invariants in 2214 ms returned sat
[2022-05-21 07:18:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:18:11] [INFO ] [Real]Absence check using state equation in 3429 ms returned sat
[2022-05-21 07:18:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:18:17] [INFO ] [Nat]Absence check using 768 positive place invariants in 5902 ms returned unknown
Current structural bounds on expressions (after SMT) : [4096, 4096, 4096] Max seen :[237, 237, 237]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 67 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 69 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:18:18] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:18:19] [INFO ] Implicit Places using invariants in 1325 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:18:19] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:18:20] [INFO ] Implicit Places using invariants and state equation in 1329 ms returned []
Implicit Place search using SMT with State Equation took 2675 ms to find 0 implicit places.
[2022-05-21 07:18:20] [INFO ] Redundant transitions in 163 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:18:20] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:18:23] [INFO ] Dead Transitions using invariants and state equation in 2628 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting property specific reduction for Sudoku-PT-AN16-UpperBounds-03
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:18:23] [INFO ] Computed 768 place invariants in 11 ms
Incomplete random walk after 10000 steps, including 44 resets, run finished after 3506 ms. (steps per millisecond=2 ) properties (out of 1) seen :230
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 840 ms. (steps per millisecond=11 ) properties (out of 1) seen :1
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:18:27] [INFO ] Computed 768 place invariants in 24 ms
[2022-05-21 07:18:29] [INFO ] [Real]Absence check using 768 positive place invariants in 1210 ms returned sat
[2022-05-21 07:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:18:32] [INFO ] [Real]Absence check using state equation in 3353 ms returned sat
[2022-05-21 07:18:41] [INFO ] Deduced a trap composed of 17 places in 8668 ms of which 4 ms to minimize.
[2022-05-21 07:18:41] [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:2620)
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) : [4096] Max seen :[230]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 80 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:18:41] [INFO ] Computed 768 place invariants in 29 ms
Finished random walk after 86044 steps, including 380 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65528 steps, including 0 resets, run visited all 1 properties in 5036 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:19:16] [INFO ] Computed 768 place invariants in 21 ms
[2022-05-21 07:19:18] [INFO ] [Real]Absence check using 768 positive place invariants in 1379 ms returned sat
[2022-05-21 07:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:19:21] [INFO ] [Real]Absence check using state equation in 3159 ms returned sat
[2022-05-21 07:19:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:19:29] [INFO ] [Nat]Absence check using 768 positive place invariants in 7045 ms returned sat
[2022-05-21 07:19:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:19:33] [INFO ] [Nat]Absence check using state equation in 3737 ms returned sat
[2022-05-21 07:19:33] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 144 ms.
[2022-05-21 07:19:33] [INFO ] Added : 0 causal constraints over 0 iterations in 450 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[234]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 84 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 83 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:19:37] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:19:38] [INFO ] Implicit Places using invariants in 1341 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:19:38] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-21 07:19:39] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 2727 ms to find 0 implicit places.
[2022-05-21 07:19:40] [INFO ] Redundant transitions in 166 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:19:40] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-21 07:19:42] [INFO ] Dead Transitions using invariants and state equation in 2629 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:19:42] [INFO ] Computed 768 place invariants in 12 ms
Finished random walk after 86026 steps, including 380 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65693 steps, including 0 resets, run visited all 1 properties in 5041 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:20:17] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:20:19] [INFO ] [Real]Absence check using 768 positive place invariants in 1538 ms returned sat
[2022-05-21 07:20:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:20:23] [INFO ] [Real]Absence check using state equation in 3258 ms returned sat
[2022-05-21 07:20:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:20:24] [INFO ] [Nat]Absence check using 768 positive place invariants in 1383 ms returned sat
[2022-05-21 07:20:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:20:28] [INFO ] [Nat]Absence check using state equation in 3234 ms returned sat
[2022-05-21 07:20:28] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 137 ms.
[2022-05-21 07:20:28] [INFO ] Added : 0 causal constraints over 0 iterations in 444 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[235]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 65 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 74 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:20:32] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:20:33] [INFO ] Implicit Places using invariants in 1333 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:20:33] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:20:34] [INFO ] Implicit Places using invariants and state equation in 1315 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
[2022-05-21 07:20:35] [INFO ] Redundant transitions in 164 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:20:35] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:20:38] [INFO ] Dead Transitions using invariants and state equation in 3040 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:20:38] [INFO ] Computed 768 place invariants in 11 ms
Finished random walk after 86260 steps, including 381 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 66705 steps, including 0 resets, run visited all 1 properties in 5083 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:21:13] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:21:15] [INFO ] [Real]Absence check using 768 positive place invariants in 1953 ms returned sat
[2022-05-21 07:21:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:21:18] [INFO ] [Real]Absence check using state equation in 3146 ms returned sat
[2022-05-21 07:21:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:21:23] [INFO ] [Nat]Absence check using 768 positive place invariants in 3925 ms returned sat
[2022-05-21 07:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:21:26] [INFO ] [Nat]Absence check using state equation in 3336 ms returned sat
[2022-05-21 07:21:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 145 ms.
[2022-05-21 07:21:27] [INFO ] Added : 0 causal constraints over 0 iterations in 459 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[236]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 74 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:21:30] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:21:31] [INFO ] Implicit Places using invariants in 1323 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:21:31] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:21:33] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
[2022-05-21 07:21:33] [INFO ] Redundant transitions in 164 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:21:33] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:21:36] [INFO ] Dead Transitions using invariants and state equation in 2608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:21:36] [INFO ] Computed 768 place invariants in 16 ms
Finished random walk after 86259 steps, including 381 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65620 steps, including 0 resets, run visited all 1 properties in 5044 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:22:11] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:22:13] [INFO ] [Real]Absence check using 768 positive place invariants in 2303 ms returned sat
[2022-05-21 07:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:22:17] [INFO ] [Real]Absence check using state equation in 3538 ms returned sat
[2022-05-21 07:22:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:22:23] [INFO ] [Nat]Absence check using 768 positive place invariants in 5719 ms returned unknown
Current structural bounds on expressions (after SMT) : [4096] Max seen :[237]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 83 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 64 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:22:23] [INFO ] Computed 768 place invariants in 22 ms
[2022-05-21 07:22:25] [INFO ] Implicit Places using invariants in 1349 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:22:25] [INFO ] Computed 768 place invariants in 15 ms
[2022-05-21 07:22:26] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 2704 ms to find 0 implicit places.
[2022-05-21 07:22:26] [INFO ] Redundant transitions in 163 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:22:26] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:22:29] [INFO ] Dead Transitions using invariants and state equation in 2600 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Ending property specific reduction for Sudoku-PT-AN16-UpperBounds-03 in 245795 ms.
Starting property specific reduction for Sudoku-PT-AN16-UpperBounds-05
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:22:29] [INFO ] Computed 768 place invariants in 12 ms
Incomplete random walk after 10000 steps, including 44 resets, run finished after 3493 ms. (steps per millisecond=2 ) properties (out of 1) seen :232
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 785 ms. (steps per millisecond=12 ) properties (out of 1) seen :1
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:22:33] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:22:36] [INFO ] [Real]Absence check using 768 positive place invariants in 2272 ms returned sat
[2022-05-21 07:22:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:22:38] [INFO ] [Real]Absence check using state equation in 2334 ms returned unknown
Current structural bounds on expressions (after SMT) : [4096] Max seen :[232]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 66 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:22:38] [INFO ] Computed 768 place invariants in 11 ms
Finished random walk after 86434 steps, including 382 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65590 steps, including 0 resets, run visited all 1 properties in 5046 ms. (steps per millisecond=12 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:23:13] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:23:16] [INFO ] [Real]Absence check using 768 positive place invariants in 2287 ms returned sat
[2022-05-21 07:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:23:19] [INFO ] [Real]Absence check using state equation in 3163 ms returned sat
[2022-05-21 07:23:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:23:23] [INFO ] [Nat]Absence check using 768 positive place invariants in 3022 ms returned sat
[2022-05-21 07:23:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:23:26] [INFO ] [Nat]Absence check using state equation in 3150 ms returned sat
[2022-05-21 07:23:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 133 ms.
[2022-05-21 07:23:27] [INFO ] Added : 0 causal constraints over 0 iterations in 449 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[232]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:23:30] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:23:31] [INFO ] Implicit Places using invariants in 1328 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:23:31] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:23:33] [INFO ] Implicit Places using invariants and state equation in 1375 ms returned []
Implicit Place search using SMT with State Equation took 2747 ms to find 0 implicit places.
[2022-05-21 07:23:33] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:23:33] [INFO ] Computed 768 place invariants in 15 ms
[2022-05-21 07:23:35] [INFO ] Dead Transitions using invariants and state equation in 2602 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:23:35] [INFO ] Computed 768 place invariants in 28 ms
Finished random walk after 86584 steps, including 383 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 66592 steps, including 0 resets, run visited all 1 properties in 5066 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:24:11] [INFO ] Computed 768 place invariants in 20 ms
[2022-05-21 07:24:16] [INFO ] [Real]Absence check using 768 positive place invariants in 5322 ms returned sat
[2022-05-21 07:24:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:24:21] [INFO ] [Real]Absence check using state equation in 4712 ms returned sat
[2022-05-21 07:24:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:24:25] [INFO ] [Nat]Absence check using 768 positive place invariants in 3819 ms returned sat
[2022-05-21 07:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:24:29] [INFO ] [Nat]Absence check using state equation in 3829 ms returned sat
[2022-05-21 07:24:30] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 138 ms.
[2022-05-21 07:24:30] [INFO ] Added : 0 causal constraints over 0 iterations in 452 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[233]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 84 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 65 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:24:33] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:24:35] [INFO ] Implicit Places using invariants in 1296 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:24:35] [INFO ] Computed 768 place invariants in 15 ms
[2022-05-21 07:24:36] [INFO ] Implicit Places using invariants and state equation in 1391 ms returned []
Implicit Place search using SMT with State Equation took 2719 ms to find 0 implicit places.
[2022-05-21 07:24:36] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:24:36] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-21 07:24:39] [INFO ] Dead Transitions using invariants and state equation in 2937 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:24:39] [INFO ] Computed 768 place invariants in 13 ms
Finished random walk after 86375 steps, including 382 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65582 steps, including 0 resets, run visited all 1 properties in 5009 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:25:14] [INFO ] Computed 768 place invariants in 20 ms
[2022-05-21 07:25:16] [INFO ] [Real]Absence check using 768 positive place invariants in 1401 ms returned sat
[2022-05-21 07:25:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:25:19] [INFO ] [Real]Absence check using state equation in 3159 ms returned sat
[2022-05-21 07:25:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:25:27] [INFO ] [Nat]Absence check using 768 positive place invariants in 7204 ms returned sat
[2022-05-21 07:25:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:25:31] [INFO ] [Nat]Absence check using state equation in 3649 ms returned sat
[2022-05-21 07:25:31] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 140 ms.
[2022-05-21 07:25:31] [INFO ] Added : 0 causal constraints over 0 iterations in 455 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[234]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 70 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 61 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:25:34] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-21 07:25:36] [INFO ] Implicit Places using invariants in 1380 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:25:36] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:25:37] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
[2022-05-21 07:25:37] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:25:37] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:25:40] [INFO ] Dead Transitions using invariants and state equation in 2594 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:25:40] [INFO ] Computed 768 place invariants in 12 ms
Finished random walk after 86241 steps, including 381 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65627 steps, including 0 resets, run visited all 1 properties in 5008 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:26:15] [INFO ] Computed 768 place invariants in 20 ms
[2022-05-21 07:26:17] [INFO ] [Real]Absence check using 768 positive place invariants in 1487 ms returned sat
[2022-05-21 07:26:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:26:20] [INFO ] [Real]Absence check using state equation in 3266 ms returned sat
[2022-05-21 07:26:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:26:22] [INFO ] [Nat]Absence check using 768 positive place invariants in 1390 ms returned sat
[2022-05-21 07:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:26:26] [INFO ] [Nat]Absence check using state equation in 3294 ms returned sat
[2022-05-21 07:26:26] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 138 ms.
[2022-05-21 07:26:26] [INFO ] Added : 0 causal constraints over 0 iterations in 477 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[235]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 66 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:26:29] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:26:31] [INFO ] Implicit Places using invariants in 1308 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:26:31] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:26:32] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
[2022-05-21 07:26:32] [INFO ] Redundant transitions in 163 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:26:32] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:26:35] [INFO ] Dead Transitions using invariants and state equation in 2598 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:26:35] [INFO ] Computed 768 place invariants in 15 ms
Finished random walk after 86026 steps, including 380 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65687 steps, including 0 resets, run visited all 1 properties in 5007 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:27:10] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:27:12] [INFO ] [Real]Absence check using 768 positive place invariants in 2017 ms returned sat
[2022-05-21 07:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:27:16] [INFO ] [Real]Absence check using state equation in 3248 ms returned sat
[2022-05-21 07:27:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:27:20] [INFO ] [Nat]Absence check using 768 positive place invariants in 3943 ms returned sat
[2022-05-21 07:27:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:27:24] [INFO ] [Nat]Absence check using state equation in 3385 ms returned sat
[2022-05-21 07:27:24] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 140 ms.
[2022-05-21 07:27:24] [INFO ] Added : 0 causal constraints over 0 iterations in 482 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[236]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 62 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 61 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:27:27] [INFO ] Computed 768 place invariants in 26 ms
[2022-05-21 07:27:29] [INFO ] Implicit Places using invariants in 1340 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:27:29] [INFO ] Computed 768 place invariants in 28 ms
[2022-05-21 07:27:30] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 2684 ms to find 0 implicit places.
[2022-05-21 07:27:30] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:27:30] [INFO ] Computed 768 place invariants in 27 ms
[2022-05-21 07:27:33] [INFO ] Dead Transitions using invariants and state equation in 2603 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:27:33] [INFO ] Computed 768 place invariants in 27 ms
Finished random walk after 86727 steps, including 383 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65583 steps, including 0 resets, run visited all 1 properties in 5004 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:28:08] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-21 07:28:11] [INFO ] [Real]Absence check using 768 positive place invariants in 2409 ms returned sat
[2022-05-21 07:28:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:28:14] [INFO ] [Real]Absence check using state equation in 3545 ms returned sat
[2022-05-21 07:28:15] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:28:21] [INFO ] [Nat]Absence check using 768 positive place invariants in 5851 ms returned unknown
Current structural bounds on expressions (after SMT) : [4096] Max seen :[237]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 68 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 71 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:28:21] [INFO ] Computed 768 place invariants in 16 ms
[2022-05-21 07:28:22] [INFO ] Implicit Places using invariants in 1320 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:28:22] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:28:24] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2022-05-21 07:28:24] [INFO ] Redundant transitions in 162 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:28:24] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:28:26] [INFO ] Dead Transitions using invariants and state equation in 2455 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Ending property specific reduction for Sudoku-PT-AN16-UpperBounds-05 in 357456 ms.
Starting property specific reduction for Sudoku-PT-AN16-UpperBounds-07
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:28:26] [INFO ] Computed 768 place invariants in 19 ms
Incomplete random walk after 10000 steps, including 44 resets, run finished after 3443 ms. (steps per millisecond=2 ) properties (out of 1) seen :231
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 795 ms. (steps per millisecond=12 ) properties (out of 1) seen :1
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:28:31] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:28:36] [INFO ] [Real]Absence check using 768 positive place invariants in 4546 ms returned unknown
Current structural bounds on expressions (after SMT) : [4096] Max seen :[231]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 61 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:28:36] [INFO ] Computed 768 place invariants in 29 ms
Finished random walk after 87414 steps, including 386 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 66618 steps, including 0 resets, run visited all 1 properties in 5069 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:29:11] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-21 07:29:13] [INFO ] [Real]Absence check using 768 positive place invariants in 1407 ms returned sat
[2022-05-21 07:29:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:29:16] [INFO ] [Real]Absence check using state equation in 3137 ms returned sat
[2022-05-21 07:29:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:29:23] [INFO ] [Nat]Absence check using 768 positive place invariants in 6749 ms returned sat
[2022-05-21 07:29:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:29:27] [INFO ] [Nat]Absence check using state equation in 3664 ms returned sat
[2022-05-21 07:29:27] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 167 ms.
[2022-05-21 07:29:27] [INFO ] Added : 0 causal constraints over 0 iterations in 482 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[234]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 58 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 59 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:29:31] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:29:32] [INFO ] Implicit Places using invariants in 1256 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:29:32] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:29:33] [INFO ] Implicit Places using invariants and state equation in 1363 ms returned []
Implicit Place search using SMT with State Equation took 2623 ms to find 0 implicit places.
[2022-05-21 07:29:33] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:29:33] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:29:36] [INFO ] Dead Transitions using invariants and state equation in 2677 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:29:36] [INFO ] Computed 768 place invariants in 15 ms
Finished random walk after 87545 steps, including 387 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 66639 steps, including 0 resets, run visited all 1 properties in 5071 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:30:11] [INFO ] Computed 768 place invariants in 19 ms
[2022-05-21 07:30:13] [INFO ] [Real]Absence check using 768 positive place invariants in 1461 ms returned sat
[2022-05-21 07:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:30:16] [INFO ] [Real]Absence check using state equation in 3183 ms returned sat
[2022-05-21 07:30:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:30:18] [INFO ] [Nat]Absence check using 768 positive place invariants in 1330 ms returned sat
[2022-05-21 07:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:30:21] [INFO ] [Nat]Absence check using state equation in 3216 ms returned sat
[2022-05-21 07:30:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 151 ms.
[2022-05-21 07:30:22] [INFO ] Added : 0 causal constraints over 0 iterations in 467 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[235]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 73 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 59 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:30:25] [INFO ] Computed 768 place invariants in 18 ms
[2022-05-21 07:30:27] [INFO ] Implicit Places using invariants in 1311 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:30:27] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:30:28] [INFO ] Implicit Places using invariants and state equation in 1287 ms returned []
Implicit Place search using SMT with State Equation took 2609 ms to find 0 implicit places.
[2022-05-21 07:30:28] [INFO ] Redundant transitions in 165 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:30:28] [INFO ] Computed 768 place invariants in 12 ms
[2022-05-21 07:30:31] [INFO ] Dead Transitions using invariants and state equation in 2576 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:30:31] [INFO ] Computed 768 place invariants in 12 ms
Finished random walk after 86116 steps, including 381 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 65584 steps, including 0 resets, run visited all 1 properties in 5007 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:31:06] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-21 07:31:08] [INFO ] [Real]Absence check using 768 positive place invariants in 2048 ms returned sat
[2022-05-21 07:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:31:11] [INFO ] [Real]Absence check using state equation in 3082 ms returned sat
[2022-05-21 07:31:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:31:16] [INFO ] [Nat]Absence check using 768 positive place invariants in 3908 ms returned sat
[2022-05-21 07:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-21 07:31:19] [INFO ] [Nat]Absence check using state equation in 3432 ms returned sat
[2022-05-21 07:31:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 139 ms.
[2022-05-21 07:31:20] [INFO ] Added : 0 causal constraints over 0 iterations in 455 ms. Result :sat
Current structural bounds on expressions (after SMT) : [4096] Max seen :[236]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 60 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 75 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:31:23] [INFO ] Computed 768 place invariants in 17 ms
[2022-05-21 07:31:24] [INFO ] Implicit Places using invariants in 1307 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:31:25] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:31:26] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2664 ms to find 0 implicit places.
[2022-05-21 07:31:26] [INFO ] Redundant transitions in 161 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:31:26] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-21 07:31:29] [INFO ] Dead Transitions using invariants and state equation in 2591 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:31:29] [INFO ] Computed 768 place invariants in 21 ms
Finished random walk after 86698 steps, including 383 resets, run visited all 1 properties in 30001 ms. (steps per millisecond=2 )
Finished Best-First random walk after 66540 steps, including 0 resets, run visited all 1 properties in 5019 ms. (steps per millisecond=13 )
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:32:04] [INFO ] Computed 768 place invariants in 13 ms
[2022-05-21 07:32:06] [INFO ] [Real]Absence check using 768 positive place invariants in 2217 ms returned sat
[2022-05-21 07:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-21 07:32:10] [INFO ] [Real]Absence check using state equation in 3319 ms returned sat
[2022-05-21 07:32:10] [INFO ] Solution in real domain found non-integer solution.
[2022-05-21 07:32:16] [INFO ] [Nat]Absence check using 768 positive place invariants in 5738 ms returned unknown
Current structural bounds on expressions (after SMT) : [4096] Max seen :[237]
Support contains 4096 out of 4864 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 61 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 4864/4864 places, 4096/4096 transitions.
Applied a total of 0 rules in 61 ms. Remains 4864 /4864 variables (removed 0) and now considering 4096/4096 (removed 0) transitions.
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:32:16] [INFO ] Computed 768 place invariants in 14 ms
[2022-05-21 07:32:17] [INFO ] Implicit Places using invariants in 1317 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:32:17] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:32:19] [INFO ] Implicit Places using invariants and state equation in 1326 ms returned []
Implicit Place search using SMT with State Equation took 2672 ms to find 0 implicit places.
[2022-05-21 07:32:19] [INFO ] Redundant transitions in 163 ms returned []
// Phase 1: matrix 4096 rows 4864 cols
[2022-05-21 07:32:19] [INFO ] Computed 768 place invariants in 11 ms
[2022-05-21 07:32:21] [INFO ] Dead Transitions using invariants and state equation in 2532 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4864/4864 places, 4096/4096 transitions.
Ending property specific reduction for Sudoku-PT-AN16-UpperBounds-07 in 235151 ms.
[2022-05-21 07:32:22] [INFO ] Flatten gal took : 534 ms
[2022-05-21 07:32:23] [INFO ] Applying decomposition
[2022-05-21 07:32:23] [INFO ] Flatten gal took : 290 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/graph14393114056430633099.txt' '-o' '/tmp/graph14393114056430633099.bin' '-w' '/tmp/graph14393114056430633099.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14393114056430633099.bin' '-l' '-1' '-v' '-w' '/tmp/graph14393114056430633099.weights' '-q' '0' '-e' '0.001'
[2022-05-21 07:32:24] [INFO ] Decomposing Gal with order
[2022-05-21 07:32:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 07:32:25] [INFO ] Removed a total of 7424 redundant transitions.
[2022-05-21 07:32:26] [INFO ] Flatten gal took : 758 ms
[2022-05-21 07:32:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 53 ms.
[2022-05-21 07:32:28] [INFO ] Time to serialize gal into /tmp/UpperBounds17096170713035402442.gal : 61 ms
[2022-05-21 07:32:28] [INFO ] Time to serialize properties into /tmp/UpperBounds15023329681606531059.prop : 12 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/UpperBounds17096170713035402442.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15023329681606531059.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/UpperBounds15023329681606531059.prop.
Detected timeout of ITS tools.
[2022-05-21 08:00:43] [INFO ] Flatten gal took : 844 ms
[2022-05-21 08:00:44] [INFO ] Time to serialize gal into /tmp/UpperBounds6822336021090726086.gal : 131 ms
[2022-05-21 08:00:44] [INFO ] Time to serialize properties into /tmp/UpperBounds11716205630826097675.prop : 39 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/UpperBounds6822336021090726086.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11716205630826097675.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...296
Loading property file /tmp/UpperBounds11716205630826097675.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="Sudoku-PT-AN16"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN16, 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 r258-tall-165303545600325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN16.tgz
mv Sudoku-PT-AN16 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 ;