Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 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-08-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680846220786

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 05:43:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 05:43:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 05:43:42] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2023-04-07 05:43:42] [INFO ] Transformed 712 places.
[2023-04-07 05:43:42] [INFO ] Transformed 2816 transitions.
[2023-04-07 05:43:42] [INFO ] Found NUPN structural information;
[2023-04-07 05:43:42] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 1368 out of 2816 initially.
// Phase 1: matrix 1368 rows 712 cols
[2023-04-07 05:43:42] [INFO ] Computed 25 invariants in 34 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 16) seen :10
FORMULA EisenbergMcGuire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
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 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 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 6) seen :0
[2023-04-07 05:43:42] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-07 05:43:42] [INFO ] Computed 25 invariants in 9 ms
[2023-04-07 05:43:43] [INFO ] [Real]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-04-07 05:43:43] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2023-04-07 05:43:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:43:43] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2023-04-07 05:43:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:43:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-04-07 05:43:44] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:43:44] [INFO ] [Nat]Absence check using state equation in 458 ms returned sat
[2023-04-07 05:43:44] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-07 05:43:44] [INFO ] [Nat]Added 676 Read/Feed constraints in 145 ms returned sat
[2023-04-07 05:43:45] [INFO ] Deduced a trap composed of 3 places in 587 ms of which 3 ms to minimize.
[2023-04-07 05:43:45] [INFO ] Deduced a trap composed of 67 places in 410 ms of which 1 ms to minimize.
[2023-04-07 05:43:46] [INFO ] Deduced a trap composed of 49 places in 1015 ms of which 2 ms to minimize.
[2023-04-07 05:43:47] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 2 ms to minimize.
[2023-04-07 05:43:47] [INFO ] Deduced a trap composed of 3 places in 294 ms of which 1 ms to minimize.
[2023-04-07 05:43:47] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 1 ms to minimize.
[2023-04-07 05:43:48] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 0 ms to minimize.
[2023-04-07 05:43:48] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 1 ms to minimize.
[2023-04-07 05:43:48] [INFO ] Deduced a trap composed of 81 places in 261 ms of which 1 ms to minimize.
[2023-04-07 05:43:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.verifyPossible(DeadlockTester.java:919)
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)
[2023-04-07 05:43:49] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-07 05:43:49] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:43:49] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2023-04-07 05:43:49] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:43:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-04-07 05:43:49] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:43:49] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-04-07 05:43:49] [INFO ] [Nat]Added 676 Read/Feed constraints in 89 ms returned sat
[2023-04-07 05:43:50] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 1 ms to minimize.
[2023-04-07 05:43:50] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 0 ms to minimize.
[2023-04-07 05:43:50] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 1 ms to minimize.
[2023-04-07 05:43:51] [INFO ] Deduced a trap composed of 40 places in 251 ms of which 0 ms to minimize.
[2023-04-07 05:43:51] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 1 ms to minimize.
[2023-04-07 05:43:51] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 1 ms to minimize.
[2023-04-07 05:43:51] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 1 ms to minimize.
[2023-04-07 05:43:52] [INFO ] Deduced a trap composed of 3 places in 242 ms of which 1 ms to minimize.
[2023-04-07 05:43:52] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 0 ms to minimize.
[2023-04-07 05:43:52] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 0 ms to minimize.
[2023-04-07 05:43:53] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 1 ms to minimize.
[2023-04-07 05:43:53] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 0 ms to minimize.
[2023-04-07 05:43:53] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2023-04-07 05:43:53] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2023-04-07 05:43:53] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2023-04-07 05:43:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4150 ms
[2023-04-07 05:43:54] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 126 ms.
[2023-04-07 05:43:54] [INFO ] Added : 15 causal constraints over 3 iterations in 350 ms. Result :unknown
[2023-04-07 05:43:54] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-04-07 05:43:54] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:43:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:43:54] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-04-07 05:43:54] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:43:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-04-07 05:43:54] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:43:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:43:55] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-04-07 05:43:55] [INFO ] [Nat]Added 676 Read/Feed constraints in 76 ms returned sat
[2023-04-07 05:43:55] [INFO ] Deduced a trap composed of 64 places in 285 ms of which 1 ms to minimize.
[2023-04-07 05:43:55] [INFO ] Deduced a trap composed of 88 places in 259 ms of which 1 ms to minimize.
[2023-04-07 05:43:56] [INFO ] Deduced a trap composed of 38 places in 259 ms of which 0 ms to minimize.
[2023-04-07 05:43:56] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 0 ms to minimize.
[2023-04-07 05:43:56] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 0 ms to minimize.
[2023-04-07 05:43:57] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 1 ms to minimize.
[2023-04-07 05:43:57] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 1 ms to minimize.
[2023-04-07 05:43:57] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 1 ms to minimize.
[2023-04-07 05:43:58] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 1 ms to minimize.
[2023-04-07 05:43:58] [INFO ] Deduced a trap composed of 3 places in 207 ms of which 1 ms to minimize.
[2023-04-07 05:43:58] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 4 ms to minimize.
[2023-04-07 05:43:58] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 0 ms to minimize.
[2023-04-07 05:43:59] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 0 ms to minimize.
[2023-04-07 05:43:59] [INFO ] Deduced a trap composed of 30 places in 146 ms of which 1 ms to minimize.
[2023-04-07 05:43:59] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 0 ms to minimize.
[2023-04-07 05:43:59] [INFO ] Deduced a trap composed of 32 places in 135 ms of which 0 ms to minimize.
[2023-04-07 05:43:59] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 1 ms to minimize.
[2023-04-07 05:43:59] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 0 ms to minimize.
[2023-04-07 05:43:59] [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.verifyPossible(DeadlockTester.java:919)
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)
[2023-04-07 05:44:00] [INFO ] [Real]Absence check using 17 positive place invariants in 44 ms returned sat
[2023-04-07 05:44:00] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:44:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:00] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-04-07 05:44:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 05:44:00] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:00] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2023-04-07 05:44:00] [INFO ] [Nat]Added 676 Read/Feed constraints in 81 ms returned sat
[2023-04-07 05:44:01] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 1 ms to minimize.
[2023-04-07 05:44:01] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 0 ms to minimize.
[2023-04-07 05:44:01] [INFO ] Deduced a trap composed of 37 places in 217 ms of which 0 ms to minimize.
[2023-04-07 05:44:02] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 0 ms to minimize.
[2023-04-07 05:44:02] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 0 ms to minimize.
[2023-04-07 05:44:02] [INFO ] Deduced a trap composed of 41 places in 244 ms of which 0 ms to minimize.
[2023-04-07 05:44:02] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 1 ms to minimize.
[2023-04-07 05:44:03] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 1 ms to minimize.
[2023-04-07 05:44:03] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 1 ms to minimize.
[2023-04-07 05:44:03] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 1 ms to minimize.
[2023-04-07 05:44:04] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2023-04-07 05:44:04] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 0 ms to minimize.
[2023-04-07 05:44:04] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 0 ms to minimize.
[2023-04-07 05:44:04] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 1 ms to minimize.
[2023-04-07 05:44:05] [INFO ] Deduced a trap composed of 82 places in 238 ms of which 6 ms to minimize.
[2023-04-07 05:44:05] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 0 ms to minimize.
[2023-04-07 05:44:05] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 1 ms to minimize.
[2023-04-07 05:44:05] [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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
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)
[2023-04-07 05:44:05] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-07 05:44:05] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-07 05:44:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:06] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2023-04-07 05:44:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:06] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 05:44:06] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:06] [INFO ] [Nat]Absence check using state equation in 273 ms returned sat
[2023-04-07 05:44:06] [INFO ] [Nat]Added 676 Read/Feed constraints in 83 ms returned sat
[2023-04-07 05:44:06] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 0 ms to minimize.
[2023-04-07 05:44:07] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 0 ms to minimize.
[2023-04-07 05:44:07] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 0 ms to minimize.
[2023-04-07 05:44:07] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 0 ms to minimize.
[2023-04-07 05:44:08] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 1 ms to minimize.
[2023-04-07 05:44:08] [INFO ] Deduced a trap composed of 3 places in 208 ms of which 1 ms to minimize.
[2023-04-07 05:44:08] [INFO ] Deduced a trap composed of 6 places in 275 ms of which 4 ms to minimize.
[2023-04-07 05:44:08] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 2 ms to minimize.
[2023-04-07 05:44:09] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 3 ms to minimize.
[2023-04-07 05:44:09] [INFO ] Deduced a trap composed of 50 places in 226 ms of which 0 ms to minimize.
[2023-04-07 05:44:09] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 0 ms to minimize.
[2023-04-07 05:44:10] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 0 ms to minimize.
[2023-04-07 05:44:10] [INFO ] Deduced a trap composed of 30 places in 150 ms of which 1 ms to minimize.
[2023-04-07 05:44:10] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 0 ms to minimize.
[2023-04-07 05:44:10] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 0 ms to minimize.
[2023-04-07 05:44:10] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-07 05:44:10] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 0 ms to minimize.
[2023-04-07 05:44:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4462 ms
[2023-04-07 05:44:11] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 114 ms.
[2023-04-07 05:44:11] [INFO ] Added : 0 causal constraints over 0 iterations in 124 ms. Result :unknown
[2023-04-07 05:44:11] [INFO ] [Real]Absence check using 17 positive place invariants in 30 ms returned sat
[2023-04-07 05:44:11] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 34 ms returned sat
[2023-04-07 05:44:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:11] [INFO ] [Real]Absence check using state equation in 248 ms returned sat
[2023-04-07 05:44:11] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:11] [INFO ] [Nat]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-07 05:44:11] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:44:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:12] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2023-04-07 05:44:12] [INFO ] [Nat]Added 676 Read/Feed constraints in 70 ms returned sat
[2023-04-07 05:44:12] [INFO ] Deduced a trap composed of 3 places in 249 ms of which 0 ms to minimize.
[2023-04-07 05:44:12] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 1 ms to minimize.
[2023-04-07 05:44:13] [INFO ] Deduced a trap composed of 37 places in 248 ms of which 0 ms to minimize.
[2023-04-07 05:44:13] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 11 ms to minimize.
[2023-04-07 05:44:13] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 5 ms to minimize.
[2023-04-07 05:44:13] [INFO ] Deduced a trap composed of 3 places in 252 ms of which 1 ms to minimize.
[2023-04-07 05:44:14] [INFO ] Deduced a trap composed of 86 places in 241 ms of which 1 ms to minimize.
[2023-04-07 05:44:14] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 0 ms to minimize.
[2023-04-07 05:44:14] [INFO ] Deduced a trap composed of 47 places in 182 ms of which 1 ms to minimize.
[2023-04-07 05:44:14] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 0 ms to minimize.
[2023-04-07 05:44:15] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-07 05:44:15] [INFO ] Deduced a trap composed of 36 places in 133 ms of which 0 ms to minimize.
[2023-04-07 05:44:15] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 0 ms to minimize.
[2023-04-07 05:44:15] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 0 ms to minimize.
[2023-04-07 05:44:15] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 1 ms to minimize.
[2023-04-07 05:44:16] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 0 ms to minimize.
[2023-04-07 05:44:16] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-07 05:44:16] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4168 ms
[2023-04-07 05:44:16] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 92 ms.
[2023-04-07 05:44:16] [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 5
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)
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 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 196 Pre rules applied. Total rules applied 16 place count 704 transition count 2612
Deduced a syphon composed of 196 places in 3 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 408 place count 508 transition count 2612
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 464 place count 452 transition count 2164
Iterating global reduction 2 with 56 rules applied. Total rules applied 520 place count 452 transition count 2164
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 632 place count 396 transition count 2108
Applied a total of 632 rules in 268 ms. Remains 396 /712 variables (removed 316) and now considering 2108/2816 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 396/712 places, 2108/2816 transitions.
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:17] [INFO ] Computed 25 invariants in 10 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 463 ms. (steps per millisecond=2159 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 459 ms. (steps per millisecond=2178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 440 ms. (steps per millisecond=2272 ) properties (out of 6) seen :0
[2023-04-07 05:44:21] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:21] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:44:21] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:21] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:22] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-04-07 05:44:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:22] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:22] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:22] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-04-07 05:44:22] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:22] [INFO ] [Nat]Added 284 Read/Feed constraints in 41 ms returned sat
[2023-04-07 05:44:22] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2023-04-07 05:44:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-04-07 05:44:22] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 62 ms.
[2023-04-07 05:44:22] [INFO ] Added : 34 causal constraints over 7 iterations in 334 ms. Result :sat
Minimization took 74 ms.
[2023-04-07 05:44:23] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:23] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:23] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-04-07 05:44:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:23] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:23] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-04-07 05:44:23] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 05:44:23] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 05:44:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-07 05:44:23] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 62 ms.
[2023-04-07 05:44:23] [INFO ] Added : 24 causal constraints over 5 iterations in 260 ms. Result :sat
Minimization took 86 ms.
[2023-04-07 05:44:23] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 05:44:23] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:24] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2023-04-07 05:44:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:24] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:24] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2023-04-07 05:44:24] [INFO ] [Nat]Added 284 Read/Feed constraints in 29 ms returned sat
[2023-04-07 05:44:24] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 49 ms.
[2023-04-07 05:44:25] [INFO ] Added : 67 causal constraints over 14 iterations in 599 ms. Result :sat
Minimization took 73 ms.
[2023-04-07 05:44:25] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:25] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:25] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:44:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:25] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:25] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-04-07 05:44:25] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 05:44:25] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 05:44:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-07 05:44:25] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 46 ms.
[2023-04-07 05:44:26] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 0 ms to minimize.
[2023-04-07 05:44:26] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2023-04-07 05:44:26] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-04-07 05:44:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 413 ms
[2023-04-07 05:44:26] [INFO ] Added : 80 causal constraints over 17 iterations in 1114 ms. Result :sat
Minimization took 80 ms.
[2023-04-07 05:44:27] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:27] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:27] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2023-04-07 05:44:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:27] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:27] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:27] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:44:27] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 05:44:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-07 05:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-07 05:44:27] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 59 ms.
[2023-04-07 05:44:27] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2023-04-07 05:44:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2023-04-07 05:44:27] [INFO ] Added : 40 causal constraints over 8 iterations in 530 ms. Result :sat
Minimization took 74 ms.
[2023-04-07 05:44:28] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:28] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 05:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:28] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-04-07 05:44:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:28] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:44:28] [INFO ] [Nat]Added 284 Read/Feed constraints in 29 ms returned sat
[2023-04-07 05:44:28] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 05:44:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-07 05:44:28] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 52 ms.
[2023-04-07 05:44:29] [INFO ] Added : 70 causal constraints over 14 iterations in 558 ms. Result :sat
Minimization took 79 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-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 77 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 396/396 places, 2108/2108 transitions.
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:29] [INFO ] Computed 25 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 447 ms. (steps per millisecond=2237 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 439 ms. (steps per millisecond=2277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 5) seen :0
[2023-04-07 05:44:33] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:33] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 05:44:34] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:34] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:34] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:44:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:34] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:34] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-04-07 05:44:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:34] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-07 05:44:34] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-07 05:44:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-07 05:44:34] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 53 ms.
[2023-04-07 05:44:34] [INFO ] Added : 34 causal constraints over 7 iterations in 327 ms. Result :sat
Minimization took 72 ms.
[2023-04-07 05:44:35] [INFO ] [Real]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 05:44:35] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 21 ms returned sat
[2023-04-07 05:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:35] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:44:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:35] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:35] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-04-07 05:44:35] [INFO ] [Nat]Added 284 Read/Feed constraints in 28 ms returned sat
[2023-04-07 05:44:35] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 87 ms.
[2023-04-07 05:44:36] [INFO ] Added : 67 causal constraints over 14 iterations in 607 ms. Result :sat
Minimization took 76 ms.
[2023-04-07 05:44:36] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:36] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:36] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:44:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:36] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:36] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-04-07 05:44:36] [INFO ] [Nat]Added 284 Read/Feed constraints in 29 ms returned sat
[2023-04-07 05:44:36] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 0 ms to minimize.
[2023-04-07 05:44:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-07 05:44:36] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 47 ms.
[2023-04-07 05:44:37] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 05:44:37] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2023-04-07 05:44:37] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2023-04-07 05:44:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 392 ms
[2023-04-07 05:44:37] [INFO ] Added : 80 causal constraints over 17 iterations in 1048 ms. Result :sat
Minimization took 88 ms.
[2023-04-07 05:44:37] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:37] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:38] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-04-07 05:44:38] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:38] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:38] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:44:38] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 05:44:38] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2023-04-07 05:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-07 05:44:38] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 92 ms.
[2023-04-07 05:44:38] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 0 ms to minimize.
[2023-04-07 05:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-04-07 05:44:38] [INFO ] Added : 40 causal constraints over 8 iterations in 570 ms. Result :sat
Minimization took 73 ms.
[2023-04-07 05:44:39] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:39] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:39] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:44:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-04-07 05:44:39] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 05:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:39] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2023-04-07 05:44:39] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 05:44:39] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 05:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 132 ms
[2023-04-07 05:44:39] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 64 ms.
[2023-04-07 05:44:40] [INFO ] Added : 70 causal constraints over 14 iterations in 564 ms. Result :sat
Minimization took 80 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 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 64 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 396/396 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 65 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-04-07 05:44:40] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-07 05:44:40] [INFO ] Invariant cache hit.
[2023-04-07 05:44:41] [INFO ] Implicit Places using invariants in 636 ms returned []
[2023-04-07 05:44:41] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-07 05:44:41] [INFO ] Invariant cache hit.
[2023-04-07 05:44:41] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:43] [INFO ] Implicit Places using invariants and state equation in 1498 ms returned []
Implicit Place search using SMT with State Equation took 2156 ms to find 0 implicit places.
[2023-04-07 05:44:43] [INFO ] Redundant transitions in 112 ms returned []
[2023-04-07 05:44:43] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-07 05:44:43] [INFO ] Invariant cache hit.
[2023-04-07 05:44:43] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3046 ms. Remains : 396/396 places, 2108/2108 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-02
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:43] [INFO ] Computed 25 invariants in 3 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
[2023-04-07 05:44:43] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:43] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:44:44] [INFO ] [Real]Absence check using 17 positive place invariants in 20 ms returned sat
[2023-04-07 05:44:44] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:44] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-04-07 05:44:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:44] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:44] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-04-07 05:44:44] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:44] [INFO ] [Nat]Added 284 Read/Feed constraints in 73 ms returned sat
[2023-04-07 05:44:44] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 0 ms to minimize.
[2023-04-07 05:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-04-07 05:44:44] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 49 ms.
[2023-04-07 05:44:45] [INFO ] Added : 34 causal constraints over 7 iterations in 329 ms. Result :sat
Minimization took 70 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 65 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:44:45] [INFO ] Computed 25 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1862 ms. (steps per millisecond=537 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 1) seen :0
[2023-04-07 05:44:47] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:44:47] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:44:47] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:47] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:47] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-04-07 05:44:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:47] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:48] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:44:48] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:48] [INFO ] [Nat]Added 284 Read/Feed constraints in 60 ms returned sat
[2023-04-07 05:44:48] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2023-04-07 05:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-04-07 05:44:48] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 81 ms.
[2023-04-07 05:44:49] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2023-04-07 05:44:49] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2023-04-07 05:44:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 233 ms
[2023-04-07 05:44:49] [INFO ] Added : 96 causal constraints over 22 iterations in 1143 ms. Result :sat
Minimization took 90 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 58 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 57 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 05:44:49] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:44:49] [INFO ] Invariant cache hit.
[2023-04-07 05:44:50] [INFO ] Implicit Places using invariants in 1108 ms returned []
[2023-04-07 05:44:50] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:44:50] [INFO ] Invariant cache hit.
[2023-04-07 05:44:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:52] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 2633 ms to find 0 implicit places.
[2023-04-07 05:44:52] [INFO ] Redundant transitions in 143 ms returned []
[2023-04-07 05:44:52] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:44:52] [INFO ] Invariant cache hit.
[2023-04-07 05:44:53] [INFO ] Dead Transitions using invariants and state equation in 754 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3628 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-02 in 9429 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-04
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:53] [INFO ] Computed 25 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 05:44:53] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:44:53] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:44:53] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:53] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:53] [INFO ] [Real]Absence check using state equation in 209 ms returned sat
[2023-04-07 05:44:53] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:53] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:53] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-04-07 05:44:53] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:53] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 05:44:53] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 47 ms.
[2023-04-07 05:44:54] [INFO ] Added : 67 causal constraints over 14 iterations in 549 ms. Result :sat
Minimization took 89 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 63 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:44:54] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1759 ms. (steps per millisecond=568 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 1) seen :0
[2023-04-07 05:44:56] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:44:56] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:44:57] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:44:57] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:57] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2023-04-07 05:44:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:44:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:44:57] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:44:57] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:44:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:44:57] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 05:44:57] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 47 ms.
[2023-04-07 05:44:57] [INFO ] Added : 57 causal constraints over 12 iterations in 483 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 55 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 54 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 05:44:58] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:44:58] [INFO ] Invariant cache hit.
[2023-04-07 05:44:58] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-04-07 05:44:58] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:44:58] [INFO ] Invariant cache hit.
[2023-04-07 05:44:58] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:00] [INFO ] Implicit Places using invariants and state equation in 1731 ms returned []
Implicit Place search using SMT with State Equation took 2137 ms to find 0 implicit places.
[2023-04-07 05:45:00] [INFO ] Redundant transitions in 43 ms returned []
[2023-04-07 05:45:00] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:45:00] [INFO ] Invariant cache hit.
[2023-04-07 05:45:01] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2940 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-04 in 7797 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-08
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:45:01] [INFO ] Computed 25 invariants in 3 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-07 05:45:01] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:45:01] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:45:01] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:45:01] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:01] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:45:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:45:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:45:01] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:01] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-04-07 05:45:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:01] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 05:45:01] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 05:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-07 05:45:01] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 52 ms.
[2023-04-07 05:45:02] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 0 ms to minimize.
[2023-04-07 05:45:02] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 0 ms to minimize.
[2023-04-07 05:45:02] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2023-04-07 05:45:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 397 ms
[2023-04-07 05:45:02] [INFO ] Added : 80 causal constraints over 17 iterations in 1122 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 396 transition count 2104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 392 transition count 2104
Applied a total of 8 rules in 61 ms. Remains 392 /396 variables (removed 4) and now considering 2104/2108 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 392/396 places, 2104/2108 transitions.
Normalized transition count is 656 out of 2104 initially.
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:45:03] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1658 ms. (steps per millisecond=603 ) properties (out of 1) 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 1) seen :0
[2023-04-07 05:45:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 05:45:05] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 05:45:05] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-04-07 05:45:05] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:05] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-04-07 05:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:45:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:45:05] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:05] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:45:05] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:05] [INFO ] [Nat]Added 284 Read/Feed constraints in 29 ms returned sat
[2023-04-07 05:45:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 05:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-07 05:45:05] [INFO ] Computed and/alt/rep : 569/1392/401 causal constraints (skipped 247 transitions) in 47 ms.
[2023-04-07 05:45:06] [INFO ] Added : 47 causal constraints over 10 iterations in 407 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 05:45:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:45:06] [INFO ] Invariant cache hit.
[2023-04-07 05:45:06] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-04-07 05:45:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:45:06] [INFO ] Invariant cache hit.
[2023-04-07 05:45:07] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:08] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 1947 ms to find 0 implicit places.
[2023-04-07 05:45:08] [INFO ] Redundant transitions in 40 ms returned []
[2023-04-07 05:45:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 05:45:08] [INFO ] Invariant cache hit.
[2023-04-07 05:45:09] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2705 ms. Remains : 392/392 places, 2104/2104 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-08 in 8008 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-12
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:45:09] [INFO ] Computed 25 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-07 05:45:09] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:45:09] [INFO ] Computed 25 invariants in 3 ms
[2023-04-07 05:45:09] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:45:09] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:09] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:45:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:45:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:45:09] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 05:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:09] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-04-07 05:45:09] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:09] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
[2023-04-07 05:45:09] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-04-07 05:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-07 05:45:09] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 53 ms.
[2023-04-07 05:45:10] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-04-07 05:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2023-04-07 05:45:10] [INFO ] Added : 40 causal constraints over 8 iterations in 508 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 88 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:45:10] [INFO ] Computed 25 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 1) seen :0
[2023-04-07 05:45:12] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:45:12] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:45:12] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:45:12] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:12] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:45:12] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:45:12] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:45:12] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:13] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2023-04-07 05:45:13] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:13] [INFO ] [Nat]Added 284 Read/Feed constraints in 43 ms returned sat
[2023-04-07 05:45:13] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 46 ms.
[2023-04-07 05:45:13] [INFO ] Added : 44 causal constraints over 9 iterations in 371 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 54 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 53 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 05:45:13] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:45:13] [INFO ] Invariant cache hit.
[2023-04-07 05:45:14] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-04-07 05:45:14] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:45:14] [INFO ] Invariant cache hit.
[2023-04-07 05:45:14] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:15] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 1973 ms to find 0 implicit places.
[2023-04-07 05:45:15] [INFO ] Redundant transitions in 41 ms returned []
[2023-04-07 05:45:15] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:45:15] [INFO ] Invariant cache hit.
[2023-04-07 05:45:16] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2760 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-12 in 7339 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-13
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:45:16] [INFO ] Computed 25 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 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-07 05:45:16] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 05:45:16] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 05:45:16] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:45:16] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 05:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:16] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-04-07 05:45:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:45:16] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 05:45:16] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:16] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:45:16] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:16] [INFO ] [Nat]Added 284 Read/Feed constraints in 46 ms returned sat
[2023-04-07 05:45:17] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 05:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-07 05:45:17] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 48 ms.
[2023-04-07 05:45:17] [INFO ] Added : 70 causal constraints over 14 iterations in 556 ms. Result :sat
Minimization took 82 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 59 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:45:17] [INFO ] Computed 25 invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1663 ms. (steps per millisecond=601 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 443 ms. (steps per millisecond=2257 ) properties (out of 1) seen :0
[2023-04-07 05:45:20] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 05:45:20] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 05:45:20] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:45:20] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:20] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-04-07 05:45:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 05:45:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 05:45:20] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 05:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 05:45:20] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-04-07 05:45:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:20] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
[2023-04-07 05:45:20] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 47 ms.
[2023-04-07 05:45:20] [INFO ] Added : 62 causal constraints over 13 iterations in 504 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 52 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 52 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 05:45:21] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:45:21] [INFO ] Invariant cache hit.
[2023-04-07 05:45:21] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-04-07 05:45:21] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:45:21] [INFO ] Invariant cache hit.
[2023-04-07 05:45:21] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 05:45:23] [INFO ] Implicit Places using invariants and state equation in 1517 ms returned []
Implicit Place search using SMT with State Equation took 1905 ms to find 0 implicit places.
[2023-04-07 05:45:23] [INFO ] Redundant transitions in 41 ms returned []
[2023-04-07 05:45:23] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 05:45:23] [INFO ] Invariant cache hit.
[2023-04-07 05:45:23] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2717 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-13 in 7495 ms.
[2023-04-07 05:45:24] [INFO ] Flatten gal took : 371 ms
[2023-04-07 05:45:24] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-04-07 05:45:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 396 places, 2108 transitions and 11128 arcs took 12 ms.
Total runtime 102421 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1095/ub_0_ --maxsum=/tmp/1095/ub_1_ --maxsum=/tmp/1095/ub_2_ --maxsum=/tmp/1095/ub_3_ --maxsum=/tmp/1095/ub_4_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15127824 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16102468 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-08, 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 r521-tall-167987246400261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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