Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r175-smll-171636279900106.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is EisenbergMcGuire-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r175-smll-171636279900106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 753K May 18 16:42 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 EisenbergMcGuire-PT-06-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716540850540

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 08:54:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 08:54:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 08:54:13] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-24 08:54:13] [INFO ] Transformed 414 places.
[2024-05-24 08:54:13] [INFO ] Transformed 1296 transitions.
[2024-05-24 08:54:13] [INFO ] Found NUPN structural information;
[2024-05-24 08:54:13] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Normalized transition count is 702 out of 1296 initially.
// Phase 1: matrix 702 rows 414 cols
[2024-05-24 08:54:13] [INFO ] Computed 19 invariants in 38 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 16) seen :10
FORMULA EisenbergMcGuire-PT-06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-06-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
[2024-05-24 08:54:13] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2024-05-24 08:54:13] [INFO ] Computed 19 invariants in 9 ms
[2024-05-24 08:54:14] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2024-05-24 08:54:14] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:14] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-05-24 08:54:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-24 08:54:14] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:15] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2024-05-24 08:54:15] [INFO ] State equation strengthened by 314 read => feed constraints.
[2024-05-24 08:54:15] [INFO ] [Nat]Added 314 Read/Feed constraints in 65 ms returned sat
[2024-05-24 08:54:15] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 5 ms to minimize.
[2024-05-24 08:54:15] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 2 ms to minimize.
[2024-05-24 08:54:16] [INFO ] Deduced a trap composed of 26 places in 272 ms of which 2 ms to minimize.
[2024-05-24 08:54:16] [INFO ] Deduced a trap composed of 33 places in 205 ms of which 3 ms to minimize.
[2024-05-24 08:54:16] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 1 ms to minimize.
[2024-05-24 08:54:16] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 1 ms to minimize.
[2024-05-24 08:54:17] [INFO ] Deduced a trap composed of 32 places in 153 ms of which 1 ms to minimize.
[2024-05-24 08:54:17] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 1 ms to minimize.
[2024-05-24 08:54:17] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 0 ms to minimize.
[2024-05-24 08:54:17] [INFO ] Deduced a trap composed of 6 places in 230 ms of which 1 ms to minimize.
[2024-05-24 08:54:18] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 1 ms to minimize.
[2024-05-24 08:54:18] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 1 ms to minimize.
[2024-05-24 08:54:18] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-05-24 08:54:18] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3086 ms
[2024-05-24 08:54:18] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 81 ms.
[2024-05-24 08:54:20] [INFO ] Deduced a trap composed of 3 places in 335 ms of which 1 ms to minimize.
[2024-05-24 08:54:20] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-24 08:54:20] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-24 08:54:20] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:54:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:20] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2024-05-24 08:54:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-05-24 08:54:20] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 08:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:20] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-24 08:54:20] [INFO ] [Nat]Added 314 Read/Feed constraints in 60 ms returned sat
[2024-05-24 08:54:21] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2024-05-24 08:54:21] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 1 ms to minimize.
[2024-05-24 08:54:21] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 1 ms to minimize.
[2024-05-24 08:54:21] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 1 ms to minimize.
[2024-05-24 08:54:22] [INFO ] Deduced a trap composed of 3 places in 199 ms of which 0 ms to minimize.
[2024-05-24 08:54:22] [INFO ] Deduced a trap composed of 32 places in 169 ms of which 0 ms to minimize.
[2024-05-24 08:54:22] [INFO ] Deduced a trap composed of 3 places in 172 ms of which 0 ms to minimize.
[2024-05-24 08:54:22] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-05-24 08:54:22] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1796 ms
[2024-05-24 08:54:22] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 76 ms.
[2024-05-24 08:54: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-24 08:54:25] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-24 08:54:25] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:25] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2024-05-24 08:54:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2024-05-24 08:54:26] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:54:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:26] [INFO ] [Nat]Absence check using state equation in 241 ms returned sat
[2024-05-24 08:54:26] [INFO ] [Nat]Added 314 Read/Feed constraints in 52 ms returned sat
[2024-05-24 08:54:26] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 0 ms to minimize.
[2024-05-24 08:54:26] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 1 ms to minimize.
[2024-05-24 08:54:26] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 0 ms to minimize.
[2024-05-24 08:54:26] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:54:26] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 08:54:27] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 0 ms to minimize.
[2024-05-24 08:54:27] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:54:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 875 ms
[2024-05-24 08:54:27] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 67 ms.
[2024-05-24 08:54:30] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 0 ms to minimize.
[2024-05-24 08:54:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2024-05-24 08:54:31] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 1 ms to minimize.
[2024-05-24 08:54: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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-24 08:54:31] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-24 08:54:31] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:31] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2024-05-24 08:54:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:31] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-24 08:54:31] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:54:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:31] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2024-05-24 08:54:31] [INFO ] [Nat]Added 314 Read/Feed constraints in 49 ms returned sat
[2024-05-24 08:54:32] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 2 ms to minimize.
[2024-05-24 08:54:32] [INFO ] Deduced a trap composed of 26 places in 178 ms of which 1 ms to minimize.
[2024-05-24 08:54:32] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 2 ms to minimize.
[2024-05-24 08:54:32] [INFO ] Deduced a trap composed of 33 places in 197 ms of which 3 ms to minimize.
[2024-05-24 08:54:33] [INFO ] Deduced a trap composed of 40 places in 193 ms of which 0 ms to minimize.
[2024-05-24 08:54:33] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 0 ms to minimize.
[2024-05-24 08:54:33] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 0 ms to minimize.
[2024-05-24 08:54:33] [INFO ] Deduced a trap composed of 23 places in 236 ms of which 1 ms to minimize.
[2024-05-24 08:54:34] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 1 ms to minimize.
[2024-05-24 08:54:34] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2024-05-24 08:54:34] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2024-05-24 08:54:34] [INFO ] Deduced a trap composed of 50 places in 105 ms of which 1 ms to minimize.
[2024-05-24 08:54:34] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-24 08:54:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2668 ms
[2024-05-24 08:54:34] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 60 ms.
[2024-05-24 08:54:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
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:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
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)
[2024-05-24 08:54:36] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-24 08:54:36] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:36] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2024-05-24 08:54:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-24 08:54:37] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 8 ms returned sat
[2024-05-24 08:54:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:37] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2024-05-24 08:54:37] [INFO ] [Nat]Added 314 Read/Feed constraints in 47 ms returned sat
[2024-05-24 08:54:37] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 0 ms to minimize.
[2024-05-24 08:54:37] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 0 ms to minimize.
[2024-05-24 08:54:38] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 1 ms to minimize.
[2024-05-24 08:54:38] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 1 ms to minimize.
[2024-05-24 08:54:38] [INFO ] Deduced a trap composed of 40 places in 200 ms of which 0 ms to minimize.
[2024-05-24 08:54:38] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 0 ms to minimize.
[2024-05-24 08:54:38] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 1 ms to minimize.
[2024-05-24 08:54:39] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2024-05-24 08:54:39] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 1 ms to minimize.
[2024-05-24 08:54:39] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2024-05-24 08:54:39] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 1 ms to minimize.
[2024-05-24 08:54:39] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2024-05-24 08:54:39] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2387 ms
[2024-05-24 08:54:39] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 65 ms.
[2024-05-24 08:54:41] [INFO ] Added : 210 causal constraints over 42 iterations in 2237 ms. Result :unknown
[2024-05-24 08:54:42] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2024-05-24 08:54:42] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:42] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-05-24 08:54:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-24 08:54:42] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:42] [INFO ] [Nat]Absence check using state equation in 243 ms returned sat
[2024-05-24 08:54:42] [INFO ] [Nat]Added 314 Read/Feed constraints in 51 ms returned sat
[2024-05-24 08:54:43] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2024-05-24 08:54:43] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2024-05-24 08:54:43] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 1 ms to minimize.
[2024-05-24 08:54:43] [INFO ] Deduced a trap composed of 29 places in 203 ms of which 1 ms to minimize.
[2024-05-24 08:54:43] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-24 08:54:44] [INFO ] Deduced a trap composed of 32 places in 138 ms of which 1 ms to minimize.
[2024-05-24 08:54:44] [INFO ] Deduced a trap composed of 63 places in 138 ms of which 0 ms to minimize.
[2024-05-24 08:54:44] [INFO ] Deduced a trap composed of 3 places in 139 ms of which 1 ms to minimize.
[2024-05-24 08:54:44] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 1 ms to minimize.
[2024-05-24 08:54:44] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 3 ms to minimize.
[2024-05-24 08:54:44] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 3 ms to minimize.
[2024-05-24 08:54:44] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 4 ms to minimize.
[2024-05-24 08:54:45] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2187 ms
[2024-05-24 08:54:45] [INFO ] Computed and/alt/rep : 499/1075/409 causal constraints (skipped 287 transitions) in 58 ms.
[2024-05-24 08:54:47] [INFO ] Added : 210 causal constraints over 42 iterations in 2292 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
Support contains 6 out of 414 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 12 place count 408 transition count 1178
Deduced a syphon composed of 112 places in 3 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 236 place count 296 transition count 1178
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 266 place count 266 transition count 998
Iterating global reduction 2 with 30 rules applied. Total rules applied 296 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 356 place count 236 transition count 968
Applied a total of 356 rules in 202 ms. Remains 236 /414 variables (removed 178) and now considering 968/1296 (removed 328) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 236/414 places, 968/1296 transitions.
Normalized transition count is 374 out of 968 initially.
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:54:47] [INFO ] Computed 19 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1776 ms. (steps per millisecond=563 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 460 ms. (steps per millisecond=2173 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 6) seen :0
[2024-05-24 08:54:52] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:54:52] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 08:54:52] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:54:52] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:52] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-24 08:54:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 08:54:52] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 08:54:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:52] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-24 08:54:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:54:52] [INFO ] [Nat]Added 164 Read/Feed constraints in 31 ms returned sat
[2024-05-24 08:54:52] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 08:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-24 08:54:53] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 39 ms.
[2024-05-24 08:54:53] [INFO ] Added : 26 causal constraints over 6 iterations in 221 ms. Result :sat
Minimization took 60 ms.
[2024-05-24 08:54:53] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 08:54:53] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:53] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2024-05-24 08:54:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:53] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-24 08:54:53] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:54:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:53] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-24 08:54:53] [INFO ] [Nat]Added 164 Read/Feed constraints in 30 ms returned sat
[2024-05-24 08:54:53] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-05-24 08:54:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-24 08:54:53] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 37 ms.
[2024-05-24 08:54:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2024-05-24 08:54:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-05-24 08:54:54] [INFO ] Added : 55 causal constraints over 12 iterations in 487 ms. Result :sat
Minimization took 67 ms.
[2024-05-24 08:54:54] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:54:54] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:54] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-05-24 08:54:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:54:54] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:54] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-24 08:54:54] [INFO ] [Nat]Added 164 Read/Feed constraints in 27 ms returned sat
[2024-05-24 08:54:54] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 38 ms.
[2024-05-24 08:54:55] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:54:55] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 0 ms to minimize.
[2024-05-24 08:54:55] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2024-05-24 08:54:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 436 ms
[2024-05-24 08:54:55] [INFO ] Added : 90 causal constraints over 18 iterations in 981 ms. Result :sat
Minimization took 83 ms.
[2024-05-24 08:54:55] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:54:55] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:54:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:56] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-24 08:54:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:54:56] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:56] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-24 08:54:56] [INFO ] [Nat]Added 164 Read/Feed constraints in 24 ms returned sat
[2024-05-24 08:54:56] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 35 ms.
[2024-05-24 08:54:56] [INFO ] Added : 29 causal constraints over 6 iterations in 216 ms. Result :sat
Minimization took 60 ms.
[2024-05-24 08:54:56] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:54:56] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:56] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2024-05-24 08:54:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:54:56] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:57] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-24 08:54:57] [INFO ] [Nat]Added 164 Read/Feed constraints in 28 ms returned sat
[2024-05-24 08:54:57] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 33 ms.
[2024-05-24 08:54:57] [INFO ] Added : 56 causal constraints over 12 iterations in 374 ms. Result :sat
Minimization took 66 ms.
[2024-05-24 08:54:57] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:54:57] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:54:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:57] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-24 08:54:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:54:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:54:57] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:54:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:54:57] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-05-24 08:54:57] [INFO ] [Nat]Added 164 Read/Feed constraints in 28 ms returned sat
[2024-05-24 08:54:57] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 35 ms.
[2024-05-24 08:54:58] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 0 ms to minimize.
[2024-05-24 08:54:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2024-05-24 08:54:58] [INFO ] Added : 66 causal constraints over 14 iterations in 640 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-06-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 37 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 236/236 places, 968/968 transitions.
Normalized transition count is 374 out of 968 initially.
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:54:59] [INFO ] Computed 19 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1764 ms. (steps per millisecond=566 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=2164 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=2136 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=2053 ) properties (out of 5) seen :0
[2024-05-24 08:55:03] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:03] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 08:55:03] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:03] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:03] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-24 08:55:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:03] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 08:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:03] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-24 08:55:03] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:03] [INFO ] [Nat]Added 164 Read/Feed constraints in 31 ms returned sat
[2024-05-24 08:55:03] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-24 08:55:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-24 08:55:03] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 34 ms.
[2024-05-24 08:55:03] [INFO ] Added : 26 causal constraints over 6 iterations in 219 ms. Result :sat
Minimization took 61 ms.
[2024-05-24 08:55:04] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:04] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:04] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2024-05-24 08:55:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 08:55:04] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 08:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:04] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-05-24 08:55:04] [INFO ] [Nat]Added 164 Read/Feed constraints in 25 ms returned sat
[2024-05-24 08:55:04] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 33 ms.
[2024-05-24 08:55:05] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2024-05-24 08:55:05] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 0 ms to minimize.
[2024-05-24 08:55:05] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-24 08:55:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 452 ms
[2024-05-24 08:55:05] [INFO ] Added : 90 causal constraints over 18 iterations in 1018 ms. Result :sat
Minimization took 84 ms.
[2024-05-24 08:55:05] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:55:05] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:05] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-24 08:55:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:05] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:05] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-24 08:55:06] [INFO ] [Nat]Added 164 Read/Feed constraints in 25 ms returned sat
[2024-05-24 08:55:06] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 35 ms.
[2024-05-24 08:55:06] [INFO ] Added : 29 causal constraints over 6 iterations in 213 ms. Result :sat
Minimization took 58 ms.
[2024-05-24 08:55:06] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:06] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:06] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-24 08:55:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:55:06] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:06] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-24 08:55:06] [INFO ] [Nat]Added 164 Read/Feed constraints in 27 ms returned sat
[2024-05-24 08:55:06] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 35 ms.
[2024-05-24 08:55:07] [INFO ] Added : 56 causal constraints over 12 iterations in 376 ms. Result :sat
Minimization took 66 ms.
[2024-05-24 08:55:07] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:55:07] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:07] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-24 08:55:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:07] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:07] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-05-24 08:55:07] [INFO ] [Nat]Added 164 Read/Feed constraints in 29 ms returned sat
[2024-05-24 08:55:07] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 37 ms.
[2024-05-24 08:55:08] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 1 ms to minimize.
[2024-05-24 08:55:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2024-05-24 08:55:08] [INFO ] Added : 66 causal constraints over 14 iterations in 660 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 29 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 29 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 08:55:08] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 08:55:08] [INFO ] Invariant cache hit.
[2024-05-24 08:55:09] [INFO ] Implicit Places using invariants in 397 ms returned []
[2024-05-24 08:55:09] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 08:55:09] [INFO ] Invariant cache hit.
[2024-05-24 08:55:09] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:10] [INFO ] Implicit Places using invariants and state equation in 908 ms returned []
Implicit Place search using SMT with State Equation took 1309 ms to find 0 implicit places.
[2024-05-24 08:55:10] [INFO ] Redundant transitions in 70 ms returned []
[2024-05-24 08:55:10] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 08:55:10] [INFO ] Invariant cache hit.
[2024-05-24 08:55:10] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2024 ms. Remains : 236/236 places, 968/968 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-01
Normalized transition count is 374 out of 968 initially.
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:10] [INFO ] Computed 19 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-24 08:55:10] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:10] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:10] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:55:10] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:10] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-24 08:55:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:11] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:11] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-24 08:55:11] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:11] [INFO ] [Nat]Added 164 Read/Feed constraints in 29 ms returned sat
[2024-05-24 08:55:11] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 08:55:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms
[2024-05-24 08:55:11] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 35 ms.
[2024-05-24 08:55:11] [INFO ] Added : 26 causal constraints over 6 iterations in 221 ms. Result :sat
Minimization took 59 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 236 transition count 967
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 235 transition count 967
Applied a total of 2 rules in 34 ms. Remains 235 /236 variables (removed 1) and now considering 967/968 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 235/236 places, 967/968 transitions.
Normalized transition count is 373 out of 967 initially.
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 08:55:11] [INFO ] Computed 19 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1653 ms. (steps per millisecond=604 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 495 ms. (steps per millisecond=2020 ) properties (out of 1) seen :0
[2024-05-24 08:55:13] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 08:55:13] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:13] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:55:13] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:13] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-05-24 08:55:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:14] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:14] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2024-05-24 08:55:14] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:14] [INFO ] [Nat]Added 164 Read/Feed constraints in 26 ms returned sat
[2024-05-24 08:55:14] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:55:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-24 08:55:14] [INFO ] Computed and/alt/rep : 320/769/230 causal constraints (skipped 137 transitions) in 35 ms.
[2024-05-24 08:55:14] [INFO ] Added : 54 causal constraints over 11 iterations in 343 ms. Result :sat
Minimization took 67 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 25 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 25 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 08:55:14] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:14] [INFO ] Invariant cache hit.
[2024-05-24 08:55:15] [INFO ] Implicit Places using invariants in 366 ms returned []
[2024-05-24 08:55:15] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:15] [INFO ] Invariant cache hit.
[2024-05-24 08:55:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:16] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1256 ms to find 0 implicit places.
[2024-05-24 08:55:16] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 08:55:16] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:16] [INFO ] Invariant cache hit.
[2024-05-24 08:55:16] [INFO ] Dead Transitions using invariants and state equation in 612 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1920 ms. Remains : 235/235 places, 967/967 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-01 in 5986 ms.
Starting property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-06
Normalized transition count is 374 out of 968 initially.
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:16] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-24 08:55:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:16] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:16] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:16] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:55:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:16] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2024-05-24 08:55:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:55:17] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:17] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-24 08:55:17] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:17] [INFO ] [Nat]Added 164 Read/Feed constraints in 25 ms returned sat
[2024-05-24 08:55:17] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 34 ms.
[2024-05-24 08:55:17] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 4 ms to minimize.
[2024-05-24 08:55:17] [INFO ] Deduced a trap composed of 18 places in 153 ms of which 0 ms to minimize.
[2024-05-24 08:55:18] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2024-05-24 08:55:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2024-05-24 08:55:18] [INFO ] Added : 90 causal constraints over 18 iterations in 1018 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 236 transition count 966
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 234 transition count 966
Applied a total of 4 rules in 29 ms. Remains 234 /236 variables (removed 2) and now considering 966/968 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 234/236 places, 966/968 transitions.
Normalized transition count is 372 out of 966 initially.
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 08:55:18] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1642 ms. (steps per millisecond=609 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 1) seen :0
[2024-05-24 08:55:20] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 08:55:20] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 08:55:20] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:20] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:20] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-24 08:55:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 08:55:20] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:20] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-24 08:55:20] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:20] [INFO ] [Nat]Added 164 Read/Feed constraints in 26 ms returned sat
[2024-05-24 08:55:21] [INFO ] Computed and/alt/rep : 319/768/229 causal constraints (skipped 137 transitions) in 35 ms.
[2024-05-24 08:55:21] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 08:55:21] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 0 ms to minimize.
[2024-05-24 08:55:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 258 ms
[2024-05-24 08:55:21] [INFO ] Added : 78 causal constraints over 17 iterations in 786 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 08:55:21] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 08:55:21] [INFO ] Invariant cache hit.
[2024-05-24 08:55:22] [INFO ] Implicit Places using invariants in 374 ms returned []
[2024-05-24 08:55:22] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 08:55:22] [INFO ] Invariant cache hit.
[2024-05-24 08:55:22] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:23] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 1330 ms to find 0 implicit places.
[2024-05-24 08:55:23] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-24 08:55:23] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 08:55:23] [INFO ] Invariant cache hit.
[2024-05-24 08:55:23] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1977 ms. Remains : 234/234 places, 966/966 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-06 in 7226 ms.
Starting property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-07
Normalized transition count is 374 out of 968 initially.
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:23] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-24 08:55:23] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:23] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:24] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 08:55:24] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:24] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2024-05-24 08:55:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:24] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:24] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-24 08:55:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:24] [INFO ] [Nat]Added 164 Read/Feed constraints in 26 ms returned sat
[2024-05-24 08:55:24] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 34 ms.
[2024-05-24 08:55:24] [INFO ] Added : 29 causal constraints over 6 iterations in 216 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 236 transition count 967
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 235 transition count 967
Applied a total of 2 rules in 42 ms. Remains 235 /236 variables (removed 1) and now considering 967/968 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 235/236 places, 967/968 transitions.
Normalized transition count is 373 out of 967 initially.
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 08:55:24] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1680 ms. (steps per millisecond=595 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 1) seen :0
[2024-05-24 08:55:26] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 08:55:26] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 08:55:27] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:27] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-24 08:55:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:27] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:27] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-24 08:55:27] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:27] [INFO ] [Nat]Added 164 Read/Feed constraints in 27 ms returned sat
[2024-05-24 08:55:27] [INFO ] Computed and/alt/rep : 320/769/230 causal constraints (skipped 137 transitions) in 36 ms.
[2024-05-24 08:55:27] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-05-24 08:55:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2024-05-24 08:55:27] [INFO ] Added : 48 causal constraints over 11 iterations in 438 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 23 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 25 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 08:55:28] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:28] [INFO ] Invariant cache hit.
[2024-05-24 08:55:28] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-24 08:55:28] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:28] [INFO ] Invariant cache hit.
[2024-05-24 08:55:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:29] [INFO ] Implicit Places using invariants and state equation in 934 ms returned []
Implicit Place search using SMT with State Equation took 1298 ms to find 0 implicit places.
[2024-05-24 08:55:29] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-24 08:55:29] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:29] [INFO ] Invariant cache hit.
[2024-05-24 08:55:29] [INFO ] Dead Transitions using invariants and state equation in 579 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1923 ms. Remains : 235/235 places, 967/967 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-07 in 6025 ms.
Starting property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-08
Normalized transition count is 374 out of 968 initially.
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:29] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2024-05-24 08:55:29] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:30] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:30] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:30] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:30] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-05-24 08:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:30] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:30] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-24 08:55:30] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:30] [INFO ] [Nat]Added 164 Read/Feed constraints in 25 ms returned sat
[2024-05-24 08:55:30] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 34 ms.
[2024-05-24 08:55:30] [INFO ] Added : 56 causal constraints over 12 iterations in 359 ms. Result :sat
Minimization took 69 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 236 transition count 967
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 235 transition count 967
Applied a total of 2 rules in 27 ms. Remains 235 /236 variables (removed 1) and now considering 967/968 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 235/236 places, 967/968 transitions.
Normalized transition count is 373 out of 967 initially.
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 08:55:30] [INFO ] Computed 19 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1605 ms. (steps per millisecond=623 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 1) seen :0
[2024-05-24 08:55:33] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 08:55:33] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:33] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 08:55:33] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:33] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-24 08:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:33] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 08:55:33] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 08:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:33] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-05-24 08:55:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:33] [INFO ] [Nat]Added 164 Read/Feed constraints in 26 ms returned sat
[2024-05-24 08:55:33] [INFO ] Computed and/alt/rep : 320/769/230 causal constraints (skipped 137 transitions) in 31 ms.
[2024-05-24 08:55:33] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 08:55:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2024-05-24 08:55:33] [INFO ] Added : 48 causal constraints over 11 iterations in 511 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 21 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 20 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 08:55:34] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:34] [INFO ] Invariant cache hit.
[2024-05-24 08:55:34] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-24 08:55:34] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:34] [INFO ] Invariant cache hit.
[2024-05-24 08:55:34] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:35] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1422 ms to find 0 implicit places.
[2024-05-24 08:55:35] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 08:55:35] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 08:55:35] [INFO ] Invariant cache hit.
[2024-05-24 08:55:36] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2203 ms. Remains : 235/235 places, 967/967 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-08 in 6389 ms.
Starting property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-09
Normalized transition count is 374 out of 968 initially.
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:36] [INFO ] Computed 19 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-24 08:55:36] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 08:55:36] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 08:55:36] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-24 08:55:36] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:36] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2024-05-24 08:55:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 08:55:36] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:36] [INFO ] [Nat]Absence check using state equation in 173 ms returned sat
[2024-05-24 08:55:36] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:36] [INFO ] [Nat]Added 164 Read/Feed constraints in 42 ms returned sat
[2024-05-24 08:55:37] [INFO ] Computed and/alt/rep : 321/770/231 causal constraints (skipped 137 transitions) in 52 ms.
[2024-05-24 08:55:37] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 0 ms to minimize.
[2024-05-24 08:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-24 08:55:37] [INFO ] Added : 66 causal constraints over 14 iterations in 922 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 236 transition count 966
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 234 transition count 966
Applied a total of 4 rules in 41 ms. Remains 234 /236 variables (removed 2) and now considering 966/968 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 234/236 places, 966/968 transitions.
Normalized transition count is 372 out of 966 initially.
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 08:55:38] [INFO ] Computed 19 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1737 ms. (steps per millisecond=575 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 1) seen :0
[2024-05-24 08:55:40] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 08:55:40] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 08:55:40] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-24 08:55:40] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-24 08:55:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:40] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-24 08:55:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 08:55:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-24 08:55:40] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 08:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 08:55:40] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2024-05-24 08:55:40] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:40] [INFO ] [Nat]Added 164 Read/Feed constraints in 30 ms returned sat
[2024-05-24 08:55:40] [INFO ] Computed and/alt/rep : 319/768/229 causal constraints (skipped 137 transitions) in 47 ms.
[2024-05-24 08:55:41] [INFO ] Added : 57 causal constraints over 12 iterations in 425 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 35 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 35 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 08:55:41] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 08:55:41] [INFO ] Invariant cache hit.
[2024-05-24 08:55:41] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-24 08:55:41] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 08:55:41] [INFO ] Invariant cache hit.
[2024-05-24 08:55:42] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 08:55:43] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1832 ms to find 0 implicit places.
[2024-05-24 08:55:43] [INFO ] Redundant transitions in 19 ms returned []
[2024-05-24 08:55:43] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 08:55:43] [INFO ] Invariant cache hit.
[2024-05-24 08:55:44] [INFO ] Dead Transitions using invariants and state equation in 721 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2613 ms. Remains : 234/234 places, 966/966 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-06-UpperBounds-09 in 7698 ms.
[2024-05-24 08:55:44] [INFO ] Flatten gal took : 226 ms
[2024-05-24 08:55:44] [INFO ] Applying decomposition
[2024-05-24 08:55:44] [INFO ] Flatten gal took : 120 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12058974155503043298.txt' '-o' '/tmp/graph12058974155503043298.bin' '-w' '/tmp/graph12058974155503043298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12058974155503043298.bin' '-l' '-1' '-v' '-w' '/tmp/graph12058974155503043298.weights' '-q' '0' '-e' '0.001'
[2024-05-24 08:55:45] [INFO ] Decomposing Gal with order
[2024-05-24 08:55:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 08:55:45] [INFO ] Removed a total of 1810 redundant transitions.
[2024-05-24 08:55:45] [INFO ] Flatten gal took : 434 ms
[2024-05-24 08:55:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 347 labels/synchronizations in 86 ms.
[2024-05-24 08:55:46] [INFO ] Time to serialize gal into /tmp/UpperBounds4036326652830551119.gal : 37 ms
[2024-05-24 08:55:46] [INFO ] Time to serialize properties into /tmp/UpperBounds7163402644048444348.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds4036326652830551119.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7163402644048444348.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...283
Loading property file /tmp/UpperBounds7163402644048444348.prop.
Detected timeout of ITS tools.
[2024-05-24 09:16:16] [INFO ] Applying decomposition
[2024-05-24 09:16:16] [INFO ] Flatten gal took : 51 ms
[2024-05-24 09:16:16] [INFO ] Decomposing Gal with order
[2024-05-24 09:16:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 09:16:16] [INFO ] Removed a total of 2122 redundant transitions.
[2024-05-24 09:16:16] [INFO ] Flatten gal took : 156 ms
[2024-05-24 09:16:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 19 ms.
[2024-05-24 09:16:16] [INFO ] Time to serialize gal into /tmp/UpperBounds12748846366970021201.gal : 7 ms
[2024-05-24 09:16:16] [INFO ] Time to serialize properties into /tmp/UpperBounds8408574426056333360.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds12748846366970021201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds8408574426056333360.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds8408574426056333360.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,1.39657e+08,733.833,5156680,104759,15931,6.48543e+06,231231,1500,1.33135e+07,606,2.47415e+06,0
Total reachable state count : 139657484

Verifying 5 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-06-UpperBounds-01 :0 <= u1.p33_4_0 <= 1
FORMULA EisenbergMcGuire-PT-06-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-UpperBounds-01,0,736.504,5156680,1,0,6.48543e+06,231231,1591,1.33135e+07,765,2.47415e+06,252
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-06-UpperBounds-06 :0 <= u1.p37_3_2 <= 1
FORMULA EisenbergMcGuire-PT-06-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-UpperBounds-06,0,736.554,5156680,1,0,6.48543e+06,231231,1614,1.33135e+07,800,2.47415e+06,334
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-06-UpperBounds-07 :0 <= u1.p34_1_2 <= 1
FORMULA EisenbergMcGuire-PT-06-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-UpperBounds-07,0,736.56,5156680,1,0,6.48543e+06,231231,1637,1.33135e+07,925,2.47415e+06,416
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-06-UpperBounds-08 :0 <= u1.p33_1_3 <= 1
FORMULA EisenbergMcGuire-PT-06-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-UpperBounds-08,0,736.569,5156680,1,0,6.48543e+06,231231,1660,1.33135e+07,1038,2.47415e+06,482
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property EisenbergMcGuire-PT-06-UpperBounds-09 :0 <= u1.p37_2_2 <= 1
FORMULA EisenbergMcGuire-PT-06-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
EisenbergMcGuire-PT-06-UpperBounds-09,0,736.575,5156680,1,0,6.48543e+06,231231,1683,1.33135e+07,1135,2.47415e+06,564
Total runtime 2060768 ms.

BK_STOP 1716542914881

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is EisenbergMcGuire-PT-06, 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 r175-smll-171636279900106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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