fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r255-tall-167856440300025
Last Updated
May 14, 2023

About the Execution of 2022-gold for JoinFreeModules-PT-0200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1043.207 314363.00 341624.00 577.20 202 201 203 202 201 203 202 202 200 202 202 202 202 203 201 203 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440300025.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is JoinFreeModules-PT-0200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440300025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 984K
-rw-r--r-- 1 mcc users 7.5K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 613K Mar 5 18:22 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 JoinFreeModules-PT-0200-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0200-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678747810528

Running Version 202205111006
[2023-03-13 22:50:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 22:50:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 22:50:12] [INFO ] Load time of PNML (sax parser for PT used): 178 ms
[2023-03-13 22:50:12] [INFO ] Transformed 1001 places.
[2023-03-13 22:50:12] [INFO ] Transformed 1601 transitions.
[2023-03-13 22:50:12] [INFO ] Parsed PT model containing 1001 places and 1601 transitions in 429 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-13 22:50:12] [INFO ] Computed 200 place invariants in 39 ms
Incomplete random walk after 10147 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=90 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :214
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 16) seen :212
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :211
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 16) seen :212
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :223
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 16) seen :220
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 16) seen :223
// Phase 1: matrix 1601 rows 1000 cols
[2023-03-13 22:50:13] [INFO ] Computed 200 place invariants in 14 ms
[2023-03-13 22:50:14] [INFO ] [Real]Absence check using 200 positive place invariants in 61 ms returned sat
[2023-03-13 22:50:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:14] [INFO ] [Real]Absence check using state equation in 428 ms returned sat
[2023-03-13 22:50:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:14] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-13 22:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:16] [INFO ] [Nat]Absence check using state equation in 1448 ms returned sat
[2023-03-13 22:50:16] [INFO ] State equation strengthened by 200 read => feed constraints.
[2023-03-13 22:50:16] [INFO ] [Nat]Added 200 Read/Feed constraints in 140 ms returned sat
[2023-03-13 22:50:16] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 131 ms.
[2023-03-13 22:50:19] [INFO ] Added : 155 causal constraints over 31 iterations in 3165 ms. Result :unknown
[2023-03-13 22:50:19] [INFO ] [Real]Absence check using 200 positive place invariants in 55 ms returned sat
[2023-03-13 22:50:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:20] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-13 22:50:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:20] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-13 22:50:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:21] [INFO ] [Nat]Absence check using state equation in 1440 ms returned sat
[2023-03-13 22:50:22] [INFO ] [Nat]Added 200 Read/Feed constraints in 250 ms returned sat
[2023-03-13 22:50:22] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 73 ms.
[2023-03-13 22:50:25] [INFO ] Deduced a trap composed of 3 places in 448 ms of which 7 ms to minimize.
[2023-03-13 22:50:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:50:25] [INFO ] [Real]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-13 22:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:26] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-13 22:50:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:26] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-13 22:50:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:27] [INFO ] [Nat]Absence check using state equation in 1472 ms returned sat
[2023-03-13 22:50:28] [INFO ] [Nat]Added 200 Read/Feed constraints in 122 ms returned sat
[2023-03-13 22:50:28] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 83 ms.
[2023-03-13 22:50:31] [INFO ] Deduced a trap composed of 3 places in 396 ms of which 1 ms to minimize.
[2023-03-13 22:50:31] [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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:50:31] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-13 22:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:32] [INFO ] [Real]Absence check using state equation in 352 ms returned sat
[2023-03-13 22:50:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:32] [INFO ] [Nat]Absence check using 200 positive place invariants in 60 ms returned sat
[2023-03-13 22:50:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:33] [INFO ] [Nat]Absence check using state equation in 1361 ms returned sat
[2023-03-13 22:50:33] [INFO ] [Nat]Added 200 Read/Feed constraints in 120 ms returned sat
[2023-03-13 22:50:34] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 88 ms.
[2023-03-13 22:50:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:50:37] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-13 22:50:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:37] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-13 22:50:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:38] [INFO ] [Nat]Absence check using 200 positive place invariants in 41 ms returned sat
[2023-03-13 22:50:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:39] [INFO ] [Nat]Absence check using state equation in 1524 ms returned sat
[2023-03-13 22:50:39] [INFO ] [Nat]Added 200 Read/Feed constraints in 132 ms returned sat
[2023-03-13 22:50:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-13 22:50:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2023-03-13 22:50:39] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 78 ms.
[2023-03-13 22:50:43] [INFO ] Deduced a trap composed of 3 places in 383 ms of which 3 ms to minimize.
[2023-03-13 22:50:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:50:43] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-13 22:50:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:43] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-13 22:50:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:44] [INFO ] [Nat]Absence check using 200 positive place invariants in 36 ms returned sat
[2023-03-13 22:50:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:45] [INFO ] [Nat]Absence check using state equation in 1349 ms returned sat
[2023-03-13 22:50:45] [INFO ] [Nat]Added 200 Read/Feed constraints in 116 ms returned sat
[2023-03-13 22:50:45] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 61 ms.
[2023-03-13 22:50:48] [INFO ] Added : 175 causal constraints over 35 iterations in 3362 ms. Result :unknown
[2023-03-13 22:50:49] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-13 22:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:49] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-13 22:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:49] [INFO ] [Nat]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-13 22:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:50] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2023-03-13 22:50:51] [INFO ] [Nat]Added 200 Read/Feed constraints in 105 ms returned sat
[2023-03-13 22:50:51] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 65 ms.
[2023-03-13 22:50:54] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 1 ms to minimize.
[2023-03-13 22:50:54] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:50:55] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-13 22:50:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:55] [INFO ] [Real]Absence check using state equation in 354 ms returned sat
[2023-03-13 22:50:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:50:55] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-13 22:50:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:50:57] [INFO ] [Nat]Absence check using state equation in 1707 ms returned sat
[2023-03-13 22:50:57] [INFO ] [Nat]Added 200 Read/Feed constraints in 87 ms returned sat
[2023-03-13 22:50:57] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 76 ms.
[2023-03-13 22:51:00] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 1 ms to minimize.
[2023-03-13 22:51:00] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:51:00] [INFO ] [Real]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-13 22:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:01] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2023-03-13 22:51:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:01] [INFO ] [Nat]Absence check using 200 positive place invariants in 38 ms returned sat
[2023-03-13 22:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:02] [INFO ] [Nat]Absence check using state equation in 1339 ms returned sat
[2023-03-13 22:51:02] [INFO ] [Nat]Added 200 Read/Feed constraints in 80 ms returned sat
[2023-03-13 22:51:03] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-13 22:51:06] [INFO ] Deduced a trap composed of 3 places in 402 ms of which 1 ms to minimize.
[2023-03-13 22:51:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:51:06] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-13 22:51:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:07] [INFO ] [Real]Absence check using state equation in 371 ms returned sat
[2023-03-13 22:51:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:07] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-13 22:51:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:08] [INFO ] [Nat]Absence check using state equation in 1235 ms returned sat
[2023-03-13 22:51:08] [INFO ] [Nat]Added 200 Read/Feed constraints in 84 ms returned sat
[2023-03-13 22:51:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2023-03-13 22:51:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-13 22:51:09] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 67 ms.
[2023-03-13 22:51:12] [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 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:51:12] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-13 22:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:12] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2023-03-13 22:51:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:13] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-13 22:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:14] [INFO ] [Nat]Absence check using state equation in 1348 ms returned sat
[2023-03-13 22:51:14] [INFO ] [Nat]Added 200 Read/Feed constraints in 128 ms returned sat
[2023-03-13 22:51:14] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
1timeout
^^^^^^^^
(error "Invalid token: 1timeout")
[2023-03-13 22:51:18] [INFO ] Deduced a trap composed of 3 places in 393 ms of which 1 ms to minimize.
[2023-03-13 22:51:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:51:18] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-13 22:51:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:18] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2023-03-13 22:51:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:18] [INFO ] [Nat]Absence check using 200 positive place invariants in 37 ms returned sat
[2023-03-13 22:51:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:20] [INFO ] [Nat]Absence check using state equation in 1499 ms returned sat
[2023-03-13 22:51:20] [INFO ] [Nat]Added 200 Read/Feed constraints in 146 ms returned sat
[2023-03-13 22:51:20] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-13 22:51:23] [INFO ] Added : 175 causal constraints over 35 iterations in 3196 ms. Result :unknown
[2023-03-13 22:51:24] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-13 22:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:24] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-13 22:51:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:24] [INFO ] [Nat]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-13 22:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:25] [INFO ] [Nat]Absence check using state equation in 1376 ms returned sat
[2023-03-13 22:51:26] [INFO ] [Nat]Added 200 Read/Feed constraints in 125 ms returned sat
[2023-03-13 22:51:26] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 63 ms.
[2023-03-13 22:51:29] [INFO ] Deduced a trap composed of 3 places in 375 ms of which 1 ms to minimize.
[2023-03-13 22:51:29] [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 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:51:29] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2023-03-13 22:51:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:30] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-13 22:51:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:30] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-13 22:51:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:31] [INFO ] [Nat]Absence check using state equation in 1331 ms returned sat
[2023-03-13 22:51:31] [INFO ] [Nat]Added 200 Read/Feed constraints in 120 ms returned sat
[2023-03-13 22:51:32] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-13 22:51:35] [INFO ] Added : 180 causal constraints over 36 iterations in 3387 ms. Result :unknown
[2023-03-13 22:51:35] [INFO ] [Real]Absence check using 200 positive place invariants in 32 ms returned sat
[2023-03-13 22:51:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:35] [INFO ] [Real]Absence check using state equation in 363 ms returned sat
[2023-03-13 22:51:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:36] [INFO ] [Nat]Absence check using 200 positive place invariants in 35 ms returned sat
[2023-03-13 22:51:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:37] [INFO ] [Nat]Absence check using state equation in 1415 ms returned sat
[2023-03-13 22:51:37] [INFO ] [Nat]Added 200 Read/Feed constraints in 118 ms returned sat
[2023-03-13 22:51:37] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-13 22:51:40] [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 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1188)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 22:51:41] [INFO ] [Real]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-13 22:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:41] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2023-03-13 22:51:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:51:41] [INFO ] [Nat]Absence check using 200 positive place invariants in 34 ms returned sat
[2023-03-13 22:51:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:51:43] [INFO ] [Nat]Absence check using state equation in 1507 ms returned sat
[2023-03-13 22:51:43] [INFO ] [Nat]Added 200 Read/Feed constraints in 214 ms returned sat
[2023-03-13 22:51:43] [INFO ] Computed and/alt/rep : 1200/3000/1200 causal constraints (skipped 0 transitions) in 64 ms.
[2023-03-13 22:51:46] [INFO ] Added : 175 causal constraints over 35 iterations in 3109 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203, 203] Max seen :[9, 10, 12, 9, 10, 12, 3, 9, 200, 2, 2, 9, 2, 12, 10, 12]
Support contains 16 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1000/1000 places, 1601/1601 transitions.
Graph (complete) has 2400 edges and 1000 vertex of which 80 are kept as prefixes of interest. Removing 920 places using SCC suffix rule.11 ms
Discarding 920 places :
Also discarding 1472 output transitions
Drop transitions removed 1472 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 80 transition count 128
Applied a total of 2 rules in 34 ms. Remains 80 /1000 variables (removed 920) and now considering 128/1601 (removed 1473) transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:16] [INFO ] Computed 16 place invariants in 1 ms
[2023-03-13 22:54:16] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 80/1000 places, 128/1601 transitions.
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:16] [INFO ] Computed 16 place invariants in 1 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties (out of 16) seen :3195
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 16) seen :773
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1064 ms. (steps per millisecond=939 ) properties (out of 16) seen :747
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 16) seen :805
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1089 ms. (steps per millisecond=918 ) properties (out of 16) seen :792
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 16) seen :828
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 16) seen :792
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties (out of 16) seen :689
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1099 ms. (steps per millisecond=909 ) properties (out of 16) seen :774
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1097 ms. (steps per millisecond=911 ) properties (out of 16) seen :589
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1119 ms. (steps per millisecond=893 ) properties (out of 16) seen :656
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1116 ms. (steps per millisecond=896 ) properties (out of 16) seen :691
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1111 ms. (steps per millisecond=900 ) properties (out of 16) seen :760
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 16) seen :648
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 16) seen :776
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 16) seen :734
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1090 ms. (steps per millisecond=917 ) properties (out of 16) seen :854
// Phase 1: matrix 128 rows 80 cols
[2023-03-13 22:54:35] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-13 22:54:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 22:54:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:54:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:35] [INFO ] Added : 45 causal constraints over 10 iterations in 106 ms. Result :sat
Minimization took 37 ms.
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:35] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-03-13 22:54:35] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:35] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:54:35] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 65 ms
[2023-03-13 22:54:36] [INFO ] Added : 49 causal constraints over 11 iterations in 206 ms. Result :sat
Minimization took 29 ms.
[2023-03-13 22:54:36] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:36] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2023-03-13 22:54:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 9 ms returned sat
[2023-03-13 22:54:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:36] [INFO ] Added : 29 causal constraints over 6 iterations in 59 ms. Result :sat
Minimization took 45 ms.
[2023-03-13 22:54:36] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:36] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:36] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-03-13 22:54:36] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:36] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2023-03-13 22:54:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 56 ms
[2023-03-13 22:54:36] [INFO ] Added : 51 causal constraints over 11 iterations in 347 ms. Result :sat
Minimization took 52 ms.
[2023-03-13 22:54:36] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:36] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:37] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 7 ms returned sat
[2023-03-13 22:54:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:37] [INFO ] Added : 41 causal constraints over 10 iterations in 130 ms. Result :sat
Minimization took 37 ms.
[2023-03-13 22:54:37] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:37] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:54:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:37] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:37] [INFO ] Added : 32 causal constraints over 7 iterations in 146 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:54:37] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:37] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:54:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:37] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Nat]Added 16 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:54:37] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:37] [INFO ] Added : 25 causal constraints over 6 iterations in 90 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 22:54:37] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:37] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-13 22:54:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:38] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:54:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:38] [INFO ] Added : 39 causal constraints over 9 iterations in 82 ms. Result :sat
Minimization took 44 ms.
[2023-03-13 22:54:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:54:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:38] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:38] [INFO ] Added : 46 causal constraints over 10 iterations in 94 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 22:54:38] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:38] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-13 22:54:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:38] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:38] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2023-03-13 22:54:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 20 ms
[2023-03-13 22:54:38] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:38] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:54:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:38] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:38] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-13 22:54:38] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:38] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:39] [INFO ] Added : 49 causal constraints over 11 iterations in 116 ms. Result :sat
Minimization took 46 ms.
[2023-03-13 22:54:39] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:39] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:54:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:39] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:39] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-13 22:54:39] [INFO ] Added : 33 causal constraints over 7 iterations in 70 ms. Result :sat
Minimization took 52 ms.
[2023-03-13 22:54:39] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:54:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:39] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:39] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:39] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2023-03-13 22:54:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2023-03-13 22:54:39] [INFO ] Added : 42 causal constraints over 10 iterations in 159 ms. Result :sat
Minimization took 33 ms.
[2023-03-13 22:54:39] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:39] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:54:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:39] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:39] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2023-03-13 22:54:39] [INFO ] [Nat]Added 16 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:39] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:39] [INFO ] Added : 29 causal constraints over 8 iterations in 77 ms. Result :sat
Minimization took 41 ms.
[2023-03-13 22:54:40] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:40] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:54:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:40] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2023-03-13 22:54:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-13 22:54:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2023-03-13 22:54:40] [INFO ] Added : 59 causal constraints over 12 iterations in 223 ms. Result :sat
Minimization took 39 ms.
[2023-03-13 22:54:40] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:40] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:54:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:40] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:40] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-03-13 22:54:40] [INFO ] [Nat]Added 16 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:40] [INFO ] Computed and/alt/rep : 96/240/96 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:40] [INFO ] Added : 49 causal constraints over 12 iterations in 149 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203, 203, 202, 203, 203, 203, 203, 203, 203] Max seen :[200, 201, 202, 200, 201, 202, 198, 200, 200, 202, 197, 200, 198, 202, 201, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-09 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-15 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-13 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-05 203 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 12 out of 80 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 80/80 places, 128/128 transitions.
Graph (complete) has 192 edges and 80 vertex of which 60 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 4 ms. Remains 60 /80 variables (removed 20) and now considering 96/128 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 60/80 places, 96/128 transitions.
// Phase 1: matrix 96 rows 60 cols
[2023-03-13 22:54:41] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000015 steps, including 2 resets, run finished after 785 ms. (steps per millisecond=1273 ) properties (out of 12) seen :2382
FORMULA JoinFreeModules-PT-0200-UpperBounds-02 203 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 11) seen :837
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=1173 ) properties (out of 11) seen :735
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 879 ms. (steps per millisecond=1137 ) properties (out of 11) seen :804
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 11) seen :741
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 871 ms. (steps per millisecond=1148 ) properties (out of 11) seen :747
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 11) seen :797
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 11) seen :620
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 878 ms. (steps per millisecond=1138 ) properties (out of 11) seen :766
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 851 ms. (steps per millisecond=1175 ) properties (out of 11) seen :848
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 875 ms. (steps per millisecond=1142 ) properties (out of 11) seen :773
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 861 ms. (steps per millisecond=1161 ) properties (out of 11) seen :725
// Phase 1: matrix 96 rows 60 cols
[2023-03-13 22:54:52] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-13 22:54:52] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:52] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2023-03-13 22:54:52] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 22:54:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 26 ms returned sat
[2023-03-13 22:54:52] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:54:52] [INFO ] Added : 28 causal constraints over 6 iterations in 65 ms. Result :sat
Minimization took 34 ms.
[2023-03-13 22:54:52] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:52] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:52] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:52] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:54:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-13 22:54:52] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:52] [INFO ] Added : 27 causal constraints over 6 iterations in 108 ms. Result :sat
Minimization took 26 ms.
[2023-03-13 22:54:52] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:54:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:52] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:52] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-13 22:54:52] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:52] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:54:53] [INFO ] Added : 31 causal constraints over 7 iterations in 77 ms. Result :sat
Minimization took 32 ms.
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2023-03-13 22:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:54:53] [INFO ] Added : 33 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 27 ms.
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 18 ms
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 6 ms returned sat
[2023-03-13 22:54:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2023-03-13 22:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-13 22:54:53] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-13 22:54:53] [INFO ] Added : 30 causal constraints over 7 iterations in 64 ms. Result :sat
Minimization took 35 ms.
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:54:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:53] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-13 22:54:53] [INFO ] [Nat]Added 12 Read/Feed constraints in 5 ms returned sat
[2023-03-13 22:54:53] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:54:53] [INFO ] Added : 29 causal constraints over 7 iterations in 54 ms. Result :sat
Minimization took 28 ms.
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 24 ms
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 22:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:54] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:54:54] [INFO ] Added : 29 causal constraints over 8 iterations in 84 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-13 22:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-13 22:54:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:54:54] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-13 22:54:54] [INFO ] [Nat]Added 12 Read/Feed constraints in 4 ms returned sat
[2023-03-13 22:54:54] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2023-03-13 22:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2023-03-13 22:54:54] [INFO ] Computed and/alt/rep : 72/180/72 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:54:54] [INFO ] Added : 34 causal constraints over 7 iterations in 58 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 202, 203, 203, 202, 203, 202, 203] Max seen :[201, 201, 200, 201, 202, 200, 200, 202, 200, 202, 201]
FORMULA JoinFreeModules-PT-0200-UpperBounds-12 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-10 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0200-UpperBounds-06 202 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 8 out of 60 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 60/60 places, 96/96 transitions.
Graph (complete) has 144 edges and 60 vertex of which 40 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 32 output transitions
Drop transitions removed 32 transitions
Applied a total of 1 rules in 4 ms. Remains 40 /60 variables (removed 20) and now considering 64/96 (removed 32) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/60 places, 64/96 transitions.
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:54:55] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 1000034 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=1894 ) properties (out of 8) seen :1592
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties (out of 8) seen :1026
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 8) seen :867
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 8) seen :1057
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 8) seen :881
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties (out of 8) seen :1066
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 603 ms. (steps per millisecond=1658 ) properties (out of 8) seen :871
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 573 ms. (steps per millisecond=1745 ) properties (out of 8) seen :1048
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 8) seen :866
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:00] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:00] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-13 22:55:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:00] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:55:00] [INFO ] Added : 31 causal constraints over 8 iterations in 77 ms. Result :sat
Minimization took 36 ms.
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:00] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:00] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:00] [INFO ] Added : 27 causal constraints over 6 iterations in 74 ms. Result :sat
Minimization took 17 ms.
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:00] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:00] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:00] [INFO ] Added : 25 causal constraints over 6 iterations in 39 ms. Result :sat
Minimization took 37 ms.
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:00] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-13 22:55:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:01] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:01] [INFO ] Added : 30 causal constraints over 7 iterations in 62 ms. Result :sat
Minimization took 40 ms.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:01] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:01] [INFO ] Added : 28 causal constraints over 6 iterations in 61 ms. Result :sat
Minimization took 19 ms.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-13 22:55:01] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:01] [INFO ] Added : 24 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 21 ms.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:55:01] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:01] [INFO ] Added : 27 causal constraints over 6 iterations in 73 ms. Result :sat
Minimization took 19 ms.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:01] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-13 22:55:01] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-13 22:55:01] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:01] [INFO ] Added : 28 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203] Max seen :[201, 201, 200, 201, 200, 200, 200, 201]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:02] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 22:55:02] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:02] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:02] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:02] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-13 22:55:02] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:02] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 22:55:02] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 64/64 transitions.
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:02] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 1000025 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=1893 ) properties (out of 8) seen :1601
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 582 ms. (steps per millisecond=1718 ) properties (out of 8) seen :1044
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties (out of 8) seen :880
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 586 ms. (steps per millisecond=1706 ) properties (out of 8) seen :1051
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 562 ms. (steps per millisecond=1779 ) properties (out of 8) seen :873
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 578 ms. (steps per millisecond=1730 ) properties (out of 8) seen :1024
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 579 ms. (steps per millisecond=1727 ) properties (out of 8) seen :882
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 587 ms. (steps per millisecond=1703 ) properties (out of 8) seen :1055
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 568 ms. (steps per millisecond=1760 ) properties (out of 8) seen :892
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:07] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 22:55:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:07] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-13 22:55:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:07] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:55:07] [INFO ] Added : 31 causal constraints over 8 iterations in 82 ms. Result :sat
Minimization took 30 ms.
[2023-03-13 22:55:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:07] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:07] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:07] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:07] [INFO ] Added : 27 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 18 ms.
[2023-03-13 22:55:07] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:07] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:07] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-13 22:55:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:07] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:08] [INFO ] Added : 23 causal constraints over 5 iterations in 34 ms. Result :sat
Minimization took 25 ms.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:08] [INFO ] Added : 30 causal constraints over 7 iterations in 60 ms. Result :sat
Minimization took 43 ms.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-13 22:55:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:08] [INFO ] Added : 28 causal constraints over 6 iterations in 60 ms. Result :sat
Minimization took 20 ms.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 10 ms returned sat
[2023-03-13 22:55:08] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:08] [INFO ] Added : 24 causal constraints over 5 iterations in 61 ms. Result :sat
Minimization took 21 ms.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-13 22:55:08] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-13 22:55:08] [INFO ] Added : 30 causal constraints over 7 iterations in 55 ms. Result :sat
Minimization took 23 ms.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:08] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-13 22:55:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 11 ms returned sat
[2023-03-13 22:55:08] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-13 22:55:08] [INFO ] Added : 28 causal constraints over 6 iterations in 42 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [203, 203, 203, 203, 203, 203, 203, 203] Max seen :[201, 201, 201, 201, 200, 200, 201, 201]
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:09] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:09] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:09] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-13 22:55:09] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:09] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:09] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/40 places, 64/64 transitions.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:09] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10017 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 1) seen :176
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :121
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:09] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 22:55:09] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:09] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:09] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-13 22:55:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:09] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:09] [INFO ] Added : 22 causal constraints over 6 iterations in 71 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[176]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:09] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:09] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:09] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000003 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=8196 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=6993 ) properties (out of 1) seen :198
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:09] [INFO ] Computed 1 place invariants in 3 ms
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:55:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:10] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 22:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:55:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-03-13 22:55:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:55:10] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:10] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-13 22:55:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-00 in 751 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:10] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10064 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1437 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :187
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:10] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:10] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-13 22:55:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:10] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:10] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:10] [INFO ] Added : 27 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000068 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=8197 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 256 ms. (steps per millisecond=3906 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:10] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2023-03-13 22:55:10] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:55:10] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:10] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-13 22:55:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:10] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-01 in 785 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:10] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10015 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1669 ) properties (out of 1) seen :102
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :113
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:10] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-13 22:55:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:11] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:55:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:11] [INFO ] Added : 19 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[113]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:11] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:11] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000045 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=8000 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=6578 ) properties (out of 1) seen :198
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:11] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:11] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:55:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:11] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:55:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:11] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2023-03-13 22:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-03-13 22:55:11] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:55:11] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:11] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2023-03-13 22:55:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:11] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:11] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-03 in 821 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:11] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10038 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1254 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :187
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:11] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:11] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:11] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:11] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-13 22:55:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:11] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:11] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:11] [INFO ] Added : 30 causal constraints over 7 iterations in 57 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:12] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000004 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=8333 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=6134 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:55:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:12] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:12] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:55:12] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:12] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:12] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-13 22:55:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:12] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-04 in 686 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:12] [INFO ] Computed 8 place invariants in 0 ms
Incomplete random walk after 10024 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1113 ) properties (out of 1) seen :152
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :113
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:12] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:12] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:12] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:12] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-13 22:55:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:12] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:55:12] [INFO ] Added : 27 causal constraints over 6 iterations in 35 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[152]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:12] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000009 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=7936 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=7142 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:12] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:13] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:55:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:13] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:55:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-13 22:55:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:55:13] [INFO ] Added : 5 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:13] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:13] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-13 22:55:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000002 steps, including 2 resets, run finished after 125 ms. (steps per millisecond=8000 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=7299 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:13] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:55:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:13] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2023-03-13 22:55:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-03-13 22:55:13] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:55:13] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2023-03-13 22:55:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-07 in 1174 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:13] [INFO ] Computed 8 place invariants in 2 ms
Incomplete random walk after 10087 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1120 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :200
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:13] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 22:55:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:13] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-13 22:55:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2023-03-13 22:55:13] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-13 22:55:13] [INFO ] Added : 24 causal constraints over 5 iterations in 59 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:13] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000020 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8264 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 145 ms. (steps per millisecond=6896 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:55:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2023-03-13 22:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:55:14] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[200]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:14] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-13 22:55:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:14] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-08 in 648 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:14] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :103
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :113
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:14] [INFO ] Computed 8 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:14] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-13 22:55:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:14] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-13 22:55:14] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2023-03-13 22:55:14] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-13 22:55:14] [INFO ] Added : 18 causal constraints over 4 iterations in 56 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[113]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000012 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=8264 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :198
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:14] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:55:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:14] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2023-03-13 22:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-13 22:55:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2023-03-13 22:55:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-03-13 22:55:14] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2023-03-13 22:55:14] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:14] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-13 22:55:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:14] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:15] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:15] [INFO ] Computed 1 place invariants in 0 ms
Incomplete random walk after 1000030 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=8064 ) properties (out of 1) seen :200
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 139 ms. (steps per millisecond=7194 ) properties (out of 1) seen :200
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:15] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-13 22:55:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:15] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 22:55:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2023-03-13 22:55:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2023-03-13 22:55:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-13 22:55:15] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:55:15] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:15] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:15] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-13 22:55:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-11 in 1216 ms.
Starting property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:15] [INFO ] Computed 8 place invariants in 1 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1251 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :187
// Phase 1: matrix 64 rows 40 cols
[2023-03-13 22:55:15] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 22:55:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:15] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-13 22:55:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 22:55:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:15] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-13 22:55:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-13 22:55:15] [INFO ] [Nat]Added 8 Read/Feed constraints in 14 ms returned sat
[2023-03-13 22:55:15] [INFO ] Computed and/alt/rep : 48/120/48 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-13 22:55:15] [INFO ] Added : 28 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 40/40 places, 64/64 transitions.
Graph (complete) has 96 edges and 40 vertex of which 5 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.0 ms
Discarding 35 places :
Also discarding 56 output transitions
Drop transitions removed 56 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /40 variables (removed 35) and now considering 8/64 (removed 56) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:15] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-13 22:55:15] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/40 places, 8/64 transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:15] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000005 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=8130 ) properties (out of 1) seen :201
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=6535 ) properties (out of 1) seen :201
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:16] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-13 22:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:16] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:55:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 22:55:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-13 22:55:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 22:55:16] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2023-03-13 22:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-13 22:55:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-13 22:55:16] [INFO ] Added : 6 causal constraints over 3 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : [203] Max seen :[201]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:16] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 22:55:16] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-13 22:55:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2023-03-13 22:55:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-13 22:55:16] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Ending property specific reduction for JoinFreeModules-PT-0200-UpperBounds-14 in 697 ms.
[2023-03-13 22:55:16] [INFO ] Flatten gal took : 38 ms
[2023-03-13 22:55:16] [INFO ] Applying decomposition
[2023-03-13 22:55:16] [INFO ] Flatten gal took : 6 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/graph8929486718378521161.txt' '-o' '/tmp/graph8929486718378521161.bin' '-w' '/tmp/graph8929486718378521161.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8929486718378521161.bin' '-l' '-1' '-v' '-w' '/tmp/graph8929486718378521161.weights' '-q' '0' '-e' '0.001'
[2023-03-13 22:55:16] [INFO ] Decomposing Gal with order
[2023-03-13 22:55:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-13 22:55:16] [INFO ] Flatten gal took : 5 ms
[2023-03-13 22:55:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2023-03-13 22:55:16] [INFO ] Time to serialize gal into /tmp/UpperBounds13336715673574355864.gal : 2 ms
[2023-03-13 22:55:16] [INFO ] Time to serialize properties into /tmp/UpperBounds3247382656791740710.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13336715673574355864.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds3247382656791740710.prop' '--nowitness'

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...275
Loading property file /tmp/UpperBounds3247382656791740710.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.28639e+62,7.97351,118148,10,1419,28,339629,39,0,62,399420,0
Total reachable state count : 9.286394904134454819325340960680338519279e+62

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-00 :0 <= u5.p704 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-00 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-00,0,7.99229,118148,1,0,48,339629,87,9,277,399420,78
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-01 :0 <= u7.p907 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-01 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-01,0,8.15539,118148,1,0,52,339629,106,9,489,399420,87
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-03 :0 <= u6.p764 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-03 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-03,0,8.15555,118148,1,0,55,339629,122,9,489,399420,92
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-04 :0 <= u0.p337 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-04 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-04,0,8.15566,118148,1,0,63,339629,141,9,489,399420,107
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-07 :0 <= u2.p494 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-07 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-07,0,8.15575,118148,1,0,70,339629,153,9,489,399420,120
Min sum of variable value : 0
Maximum sum along a path : 200
Bounds property JoinFreeModules-PT-0200-UpperBounds-08 :0 <= u4.p508 <= 200
FORMULA JoinFreeModules-PT-0200-UpperBounds-08 200 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-08,0,8.2422,118148,1,0,76,339629,168,9,697,399420,130
Min sum of variable value : 0
Maximum sum along a path : 202
Bounds property JoinFreeModules-PT-0200-UpperBounds-11 :0 <= u3.p499 <= 202
FORMULA JoinFreeModules-PT-0200-UpperBounds-11 202 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-11,0,8.24241,118148,1,0,82,339629,181,9,697,399420,141
Min sum of variable value : 0
Maximum sum along a path : 201
Bounds property JoinFreeModules-PT-0200-UpperBounds-14 :0 <= u1.p402 <= 201
FORMULA JoinFreeModules-PT-0200-UpperBounds-14 201 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
JoinFreeModules-PT-0200-UpperBounds-14,0,8.24252,118148,1,0,90,339629,192,9,697,399420,156
Total runtime 313086 ms.

BK_STOP 1678748124891

--------------------
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="JoinFreeModules-PT-0200"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool gold2022"
echo " Input is JoinFreeModules-PT-0200, 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 r255-tall-167856440300025"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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