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.r522-tall-167987247100261.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 marciexred
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 r522-tall-167987247100261
=====================================================================

--------------------
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 1680831821875

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 01:43:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 01:43:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 01:43:43] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-04-07 01:43:43] [INFO ] Transformed 712 places.
[2023-04-07 01:43:43] [INFO ] Transformed 2816 transitions.
[2023-04-07 01:43:43] [INFO ] Found NUPN structural information;
[2023-04-07 01:43:43] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 225 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 01:43:43] [INFO ] Computed 25 invariants in 32 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) 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 13 ms. (steps per millisecond=769 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 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 01:43:43] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-07 01:43:43] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 01:43:44] [INFO ] [Real]Absence check using 17 positive place invariants in 28 ms returned sat
[2023-04-07 01:43:44] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:43:44] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-04-07 01:43:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:43:44] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-04-07 01:43:44] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:43:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:43:45] [INFO ] [Nat]Absence check using state equation in 332 ms returned sat
[2023-04-07 01:43:45] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-07 01:43:45] [INFO ] [Nat]Added 676 Read/Feed constraints in 88 ms returned sat
[2023-04-07 01:43:45] [INFO ] Deduced a trap composed of 3 places in 365 ms of which 72 ms to minimize.
[2023-04-07 01:43:46] [INFO ] Deduced a trap composed of 67 places in 289 ms of which 1 ms to minimize.
[2023-04-07 01:43:46] [INFO ] Deduced a trap composed of 49 places in 258 ms of which 1 ms to minimize.
[2023-04-07 01:43:46] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 2 ms to minimize.
[2023-04-07 01:43:46] [INFO ] Deduced a trap composed of 3 places in 286 ms of which 3 ms to minimize.
[2023-04-07 01:43:47] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 1 ms to minimize.
[2023-04-07 01:43:47] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 1 ms to minimize.
[2023-04-07 01:43:47] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 1 ms to minimize.
[2023-04-07 01:43:48] [INFO ] Deduced a trap composed of 81 places in 249 ms of which 0 ms to minimize.
[2023-04-07 01:43:48] [INFO ] Deduced a trap composed of 5 places in 281 ms of which 0 ms to minimize.
[2023-04-07 01:43:48] [INFO ] Deduced a trap composed of 104 places in 249 ms of which 0 ms to minimize.
[2023-04-07 01:43:49] [INFO ] Deduced a trap composed of 46 places in 203 ms of which 1 ms to minimize.
[2023-04-07 01:43:49] [INFO ] Deduced a trap composed of 148 places in 240 ms of which 0 ms to minimize.
[2023-04-07 01:43:49] [INFO ] Deduced a trap composed of 3 places in 213 ms of which 0 ms to minimize.
[2023-04-07 01:43:49] [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 01:43:49] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-07 01:43:49] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:43:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:43:50] [INFO ] [Real]Absence check using state equation in 283 ms returned sat
[2023-04-07 01:43:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:43:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-04-07 01:43:50] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 01:43:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:43:50] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-04-07 01:43:50] [INFO ] [Nat]Added 676 Read/Feed constraints in 93 ms returned sat
[2023-04-07 01:43:50] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 1 ms to minimize.
[2023-04-07 01:43:51] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 1 ms to minimize.
[2023-04-07 01:43:51] [INFO ] Deduced a trap composed of 37 places in 236 ms of which 0 ms to minimize.
[2023-04-07 01:43:51] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 1 ms to minimize.
[2023-04-07 01:43:52] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2023-04-07 01:43:52] [INFO ] Deduced a trap composed of 26 places in 245 ms of which 0 ms to minimize.
[2023-04-07 01:43:52] [INFO ] Deduced a trap composed of 48 places in 288 ms of which 0 ms to minimize.
[2023-04-07 01:43:53] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 1 ms to minimize.
[2023-04-07 01:43:53] [INFO ] Deduced a trap composed of 38 places in 246 ms of which 1 ms to minimize.
[2023-04-07 01:43:53] [INFO ] Deduced a trap composed of 28 places in 245 ms of which 0 ms to minimize.
[2023-04-07 01:43:54] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 1 ms to minimize.
[2023-04-07 01:43:54] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 0 ms to minimize.
[2023-04-07 01:43:54] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 1 ms to minimize.
[2023-04-07 01:43:54] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2023-04-07 01:43:54] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 1 ms to minimize.
[2023-04-07 01:43:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4111 ms
[2023-04-07 01:43:54] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 134 ms.
[2023-04-07 01:43:55] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 01:43:55] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-07 01:43:55] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:43:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:43:55] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-04-07 01:43:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:43:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 01:43:55] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:43:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:43:56] [INFO ] [Nat]Absence check using state equation in 266 ms returned sat
[2023-04-07 01:43:56] [INFO ] [Nat]Added 676 Read/Feed constraints in 87 ms returned sat
[2023-04-07 01:43:56] [INFO ] Deduced a trap composed of 64 places in 265 ms of which 1 ms to minimize.
[2023-04-07 01:43:56] [INFO ] Deduced a trap composed of 88 places in 262 ms of which 0 ms to minimize.
[2023-04-07 01:43:57] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 0 ms to minimize.
[2023-04-07 01:43:57] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 2 ms to minimize.
[2023-04-07 01:43:57] [INFO ] Deduced a trap composed of 47 places in 270 ms of which 2 ms to minimize.
[2023-04-07 01:43:58] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 5 ms to minimize.
[2023-04-07 01:43:58] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 1 ms to minimize.
[2023-04-07 01:43:58] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 0 ms to minimize.
[2023-04-07 01:43:58] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 0 ms to minimize.
[2023-04-07 01:43:59] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 1 ms to minimize.
[2023-04-07 01:43:59] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 0 ms to minimize.
[2023-04-07 01:43:59] [INFO ] Deduced a trap composed of 3 places in 236 ms of which 0 ms to minimize.
[2023-04-07 01:43:59] [INFO ] Deduced a trap composed of 104 places in 210 ms of which 1 ms to minimize.
[2023-04-07 01:44:00] [INFO ] Deduced a trap composed of 30 places in 173 ms of which 1 ms to minimize.
[2023-04-07 01:44:00] [INFO ] Deduced a trap composed of 35 places in 168 ms of which 0 ms to minimize.
[2023-04-07 01:44:00] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 1 ms to minimize.
[2023-04-07 01:44:01] [INFO ] Deduced a trap composed of 3 places in 364 ms of which 1 ms to minimize.
[2023-04-07 01:44:01] [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 01:44:01] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 01:44:01] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:01] [INFO ] [Real]Absence check using state equation in 284 ms returned sat
[2023-04-07 01:44:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 01:44:01] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:44:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:01] [INFO ] [Nat]Absence check using state equation in 284 ms returned sat
[2023-04-07 01:44:01] [INFO ] [Nat]Added 676 Read/Feed constraints in 87 ms returned sat
[2023-04-07 01:44:02] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 0 ms to minimize.
[2023-04-07 01:44:02] [INFO ] Deduced a trap composed of 3 places in 247 ms of which 1 ms to minimize.
[2023-04-07 01:44:02] [INFO ] Deduced a trap composed of 37 places in 241 ms of which 0 ms to minimize.
[2023-04-07 01:44:03] [INFO ] Deduced a trap composed of 3 places in 233 ms of which 1 ms to minimize.
[2023-04-07 01:44:03] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 2 ms to minimize.
[2023-04-07 01:44:03] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 0 ms to minimize.
[2023-04-07 01:44:04] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 1 ms to minimize.
[2023-04-07 01:44:04] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 1 ms to minimize.
[2023-04-07 01:44:04] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 0 ms to minimize.
[2023-04-07 01:44:04] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2023-04-07 01:44:05] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2023-04-07 01:44:05] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 1 ms to minimize.
[2023-04-07 01:44:05] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 1 ms to minimize.
[2023-04-07 01:44:06] [INFO ] Deduced a trap composed of 48 places in 304 ms of which 0 ms to minimize.
[2023-04-07 01:44:06] [INFO ] Deduced a trap composed of 82 places in 258 ms of which 1 ms to minimize.
[2023-04-07 01:44:06] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 1 ms to minimize.
[2023-04-07 01:44:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 01:44:06] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-07 01:44:06] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:44:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:07] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2023-04-07 01:44:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 01:44:07] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-07 01:44:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:07] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2023-04-07 01:44:07] [INFO ] [Nat]Added 676 Read/Feed constraints in 89 ms returned sat
[2023-04-07 01:44:07] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 0 ms to minimize.
[2023-04-07 01:44:08] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 1 ms to minimize.
[2023-04-07 01:44:08] [INFO ] Deduced a trap composed of 40 places in 236 ms of which 1 ms to minimize.
[2023-04-07 01:44:08] [INFO ] Deduced a trap composed of 3 places in 224 ms of which 2 ms to minimize.
[2023-04-07 01:44:09] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 0 ms to minimize.
[2023-04-07 01:44:09] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2023-04-07 01:44:09] [INFO ] Deduced a trap composed of 6 places in 252 ms of which 1 ms to minimize.
[2023-04-07 01:44:09] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 0 ms to minimize.
[2023-04-07 01:44:10] [INFO ] Deduced a trap composed of 49 places in 234 ms of which 1 ms to minimize.
[2023-04-07 01:44:10] [INFO ] Deduced a trap composed of 50 places in 199 ms of which 1 ms to minimize.
[2023-04-07 01:44:10] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 1 ms to minimize.
[2023-04-07 01:44:10] [INFO ] Deduced a trap composed of 32 places in 180 ms of which 0 ms to minimize.
[2023-04-07 01:44:11] [INFO ] Deduced a trap composed of 30 places in 136 ms of which 0 ms to minimize.
[2023-04-07 01:44:11] [INFO ] Deduced a trap composed of 3 places in 129 ms of which 1 ms to minimize.
[2023-04-07 01:44:11] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 0 ms to minimize.
[2023-04-07 01:44:11] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 0 ms to minimize.
[2023-04-07 01:44:11] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2023-04-07 01:44:11] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4231 ms
[2023-04-07 01:44:11] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 99 ms.
[2023-04-07 01:44:12] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 0 ms to minimize.
[2023-04-07 01:44:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 01:44:12] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-07 01:44:12] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 10 ms returned sat
[2023-04-07 01:44:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:12] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2023-04-07 01:44:12] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-07 01:44:13] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:13] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2023-04-07 01:44:13] [INFO ] [Nat]Added 676 Read/Feed constraints in 73 ms returned sat
[2023-04-07 01:44:13] [INFO ] Deduced a trap composed of 3 places in 248 ms of which 0 ms to minimize.
[2023-04-07 01:44:13] [INFO ] Deduced a trap composed of 3 places in 235 ms of which 1 ms to minimize.
[2023-04-07 01:44:14] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 0 ms to minimize.
[2023-04-07 01:44:14] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 0 ms to minimize.
[2023-04-07 01:44:14] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 0 ms to minimize.
[2023-04-07 01:44:15] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 1 ms to minimize.
[2023-04-07 01:44:15] [INFO ] Deduced a trap composed of 86 places in 265 ms of which 1 ms to minimize.
[2023-04-07 01:44:15] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 1 ms to minimize.
[2023-04-07 01:44:15] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 1 ms to minimize.
[2023-04-07 01:44:16] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 0 ms to minimize.
[2023-04-07 01:44:16] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 0 ms to minimize.
[2023-04-07 01:44:16] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 0 ms to minimize.
[2023-04-07 01:44:16] [INFO ] Deduced a trap composed of 43 places in 116 ms of which 0 ms to minimize.
[2023-04-07 01:44:17] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 1 ms to minimize.
[2023-04-07 01:44:17] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 0 ms to minimize.
[2023-04-07 01:44:17] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 0 ms to minimize.
[2023-04-07 01:44:17] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2023-04-07 01:44:17] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4267 ms
[2023-04-07 01:44:17] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 97 ms.
[2023-04-07 01:44:18] [INFO ] Deduced a trap composed of 3 places in 351 ms of which 1 ms to minimize.
[2023-04-07 01:44:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
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 5 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 6 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 291 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 292 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 01:44:18] [INFO ] Computed 25 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1949 ms. (steps per millisecond=513 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 6) seen :0
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 438 ms. (steps per millisecond=2283 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 6) seen :0
[2023-04-07 01:44:23] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 01:44:23] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 01:44:23] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:23] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:23] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-04-07 01:44:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:23] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:23] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-04-07 01:44:23] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:23] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-07 01:44:23] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-07 01:44:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-07 01:44:23] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 49 ms.
[2023-04-07 01:44:24] [INFO ] Added : 34 causal constraints over 7 iterations in 347 ms. Result :sat
Minimization took 73 ms.
[2023-04-07 01:44:24] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:24] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:24] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-04-07 01:44:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:24] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:24] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-04-07 01:44:24] [INFO ] [Nat]Added 284 Read/Feed constraints in 33 ms returned sat
[2023-04-07 01:44:24] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 01:44:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-07 01:44:24] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 61 ms.
[2023-04-07 01:44:25] [INFO ] Added : 24 causal constraints over 5 iterations in 267 ms. Result :sat
Minimization took 68 ms.
[2023-04-07 01:44:25] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:25] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:25] [INFO ] [Real]Absence check using state equation in 131 ms returned sat
[2023-04-07 01:44:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:25] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:25] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:25] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-04-07 01:44:25] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 01:44:25] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 46 ms.
[2023-04-07 01:44:26] [INFO ] Added : 67 causal constraints over 14 iterations in 549 ms. Result :sat
Minimization took 79 ms.
[2023-04-07 01:44:26] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:26] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:26] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-04-07 01:44:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:26] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:26] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-04-07 01:44:26] [INFO ] [Nat]Added 284 Read/Feed constraints in 33 ms returned sat
[2023-04-07 01:44:26] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-07 01:44:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-04-07 01:44:26] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 51 ms.
[2023-04-07 01:44:27] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2023-04-07 01:44:27] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-04-07 01:44:27] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2023-04-07 01:44:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 373 ms
[2023-04-07 01:44:27] [INFO ] Added : 80 causal constraints over 17 iterations in 1058 ms. Result :sat
Minimization took 86 ms.
[2023-04-07 01:44:28] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:28] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:28] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-04-07 01:44:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:28] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-04-07 01:44:28] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 01:44:28] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2023-04-07 01:44:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-04-07 01:44:28] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 50 ms.
[2023-04-07 01:44:28] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 0 ms to minimize.
[2023-04-07 01:44:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-07 01:44:29] [INFO ] Added : 40 causal constraints over 8 iterations in 529 ms. Result :sat
Minimization took 74 ms.
[2023-04-07 01:44:29] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:29] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:29] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-04-07 01:44:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:29] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:29] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-04-07 01:44:29] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 01:44:29] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 01:44:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 01:44:29] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 50 ms.
[2023-04-07 01:44:30] [INFO ] Added : 70 causal constraints over 14 iterations in 572 ms. Result :sat
Minimization took 80 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 104 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 105 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 01:44:31] [INFO ] Computed 25 invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1808 ms. (steps per millisecond=553 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 473 ms. (steps per millisecond=2114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 478 ms. (steps per millisecond=2092 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=2100 ) properties (out of 5) seen :0
[2023-04-07 01:44:35] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 01:44:35] [INFO ] Computed 25 invariants in 11 ms
[2023-04-07 01:44:35] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:35] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:35] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2023-04-07 01:44:35] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:35] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:35] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-04-07 01:44:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:35] [INFO ] [Nat]Added 284 Read/Feed constraints in 48 ms returned sat
[2023-04-07 01:44:35] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2023-04-07 01:44:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 01:44:35] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 60 ms.
[2023-04-07 01:44:36] [INFO ] Added : 34 causal constraints over 7 iterations in 391 ms. Result :sat
Minimization took 85 ms.
[2023-04-07 01:44:36] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:36] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:36] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-04-07 01:44:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:36] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:36] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:36] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-04-07 01:44:36] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 01:44:36] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 50 ms.
[2023-04-07 01:44:37] [INFO ] Added : 67 causal constraints over 14 iterations in 585 ms. Result :sat
Minimization took 77 ms.
[2023-04-07 01:44:37] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:37] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:37] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2023-04-07 01:44:37] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:37] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:37] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-04-07 01:44:38] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 01:44:38] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-07 01:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2023-04-07 01:44:38] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 54 ms.
[2023-04-07 01:44:38] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 1 ms to minimize.
[2023-04-07 01:44:38] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2023-04-07 01:44:39] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 0 ms to minimize.
[2023-04-07 01:44:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 426 ms
[2023-04-07 01:44:39] [INFO ] Added : 80 causal constraints over 17 iterations in 1163 ms. Result :sat
Minimization took 82 ms.
[2023-04-07 01:44:39] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:39] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:39] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-04-07 01:44:39] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 01:44:39] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:39] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-04-07 01:44:39] [INFO ] [Nat]Added 284 Read/Feed constraints in 34 ms returned sat
[2023-04-07 01:44:39] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 0 ms to minimize.
[2023-04-07 01:44:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2023-04-07 01:44:40] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 58 ms.
[2023-04-07 01:44:40] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2023-04-07 01:44:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-04-07 01:44:40] [INFO ] Added : 40 causal constraints over 8 iterations in 527 ms. Result :sat
Minimization took 74 ms.
[2023-04-07 01:44:40] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:40] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:40] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-04-07 01:44:40] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:40] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-07 01:44:40] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-07 01:44:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:40] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-04-07 01:44:41] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 01:44:41] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2023-04-07 01:44:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2023-04-07 01:44:41] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 50 ms.
[2023-04-07 01:44:41] [INFO ] Added : 70 causal constraints over 14 iterations in 563 ms. Result :sat
Minimization took 83 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 65 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 66 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 67 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-04-07 01:44:42] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-07 01:44:42] [INFO ] Invariant cache hit.
[2023-04-07 01:44:42] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-04-07 01:44:42] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-07 01:44:42] [INFO ] Invariant cache hit.
[2023-04-07 01:44:42] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:44] [INFO ] Implicit Places using invariants and state equation in 1559 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
[2023-04-07 01:44:44] [INFO ] Redundant transitions in 116 ms returned []
[2023-04-07 01:44:44] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-07 01:44:44] [INFO ] Invariant cache hit.
[2023-04-07 01:44:45] [INFO ] Dead Transitions using invariants and state equation in 631 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2760 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 01:44:45] [INFO ] Computed 25 invariants in 5 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 01:44:45] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 01:44:45] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 01:44:45] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:45] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:45] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-04-07 01:44:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:45] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:45] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:45] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-04-07 01:44:45] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:45] [INFO ] [Nat]Added 284 Read/Feed constraints in 43 ms returned sat
[2023-04-07 01:44:45] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-07 01:44:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2023-04-07 01:44:45] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 46 ms.
[2023-04-07 01:44:46] [INFO ] Added : 34 causal constraints over 7 iterations in 322 ms. Result :sat
Minimization took 69 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 69 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 70 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 01:44:46] [INFO ] Computed 25 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1716 ms. (steps per millisecond=582 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=2283 ) properties (out of 1) seen :0
[2023-04-07 01:44:48] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 01:44:48] [INFO ] Computed 25 invariants in 7 ms
[2023-04-07 01:44:48] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:48] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:48] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-04-07 01:44:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:48] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:48] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-04-07 01:44:48] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:48] [INFO ] [Nat]Added 284 Read/Feed constraints in 40 ms returned sat
[2023-04-07 01:44:48] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2023-04-07 01:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-04-07 01:44:49] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 50 ms.
[2023-04-07 01:44:49] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2023-04-07 01:44:49] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 0 ms to minimize.
[2023-04-07 01:44:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2023-04-07 01:44:50] [INFO ] Added : 96 causal constraints over 22 iterations in 1162 ms. Result :sat
Minimization took 92 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 60 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 60 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 56 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 01:44:50] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:44:50] [INFO ] Invariant cache hit.
[2023-04-07 01:44:50] [INFO ] Implicit Places using invariants in 366 ms returned []
[2023-04-07 01:44:50] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:44:50] [INFO ] Invariant cache hit.
[2023-04-07 01:44:51] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:52] [INFO ] Implicit Places using invariants and state equation in 1525 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2023-04-07 01:44:52] [INFO ] Redundant transitions in 140 ms returned []
[2023-04-07 01:44:52] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:44:52] [INFO ] Invariant cache hit.
[2023-04-07 01:44:53] [INFO ] Dead Transitions using invariants and state equation in 698 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2798 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-02 in 8172 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 01:44:53] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
[2023-04-07 01:44:53] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 01:44:53] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 01:44:53] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:53] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:53] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-04-07 01:44:53] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:53] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:44:53] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:53] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-04-07 01:44:53] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:53] [INFO ] [Nat]Added 284 Read/Feed constraints in 31 ms returned sat
[2023-04-07 01:44:53] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 52 ms.
[2023-04-07 01:44:54] [INFO ] Added : 67 causal constraints over 14 iterations in 565 ms. Result :sat
Minimization took 75 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 73 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 73 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 01:44:54] [INFO ] Computed 25 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1780 ms. (steps per millisecond=561 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 1) seen :0
[2023-04-07 01:44:56] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 01:44:56] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:44:57] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-04-07 01:44:57] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:57] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-04-07 01:44:57] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:44:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:44:57] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:44:57] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-04-07 01:44:57] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:44:57] [INFO ] [Nat]Added 284 Read/Feed constraints in 30 ms returned sat
[2023-04-07 01:44:57] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 45 ms.
[2023-04-07 01:44:57] [INFO ] Added : 57 causal constraints over 12 iterations in 504 ms. Result :sat
Minimization took 71 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 53 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 55 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 01:44:58] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:44:58] [INFO ] Invariant cache hit.
[2023-04-07 01:44:58] [INFO ] Implicit Places using invariants in 350 ms returned []
[2023-04-07 01:44:58] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:44:58] [INFO ] Invariant cache hit.
[2023-04-07 01:44:58] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:00] [INFO ] Implicit Places using invariants and state equation in 1709 ms returned []
Implicit Place search using SMT with State Equation took 2062 ms to find 0 implicit places.
[2023-04-07 01:45:00] [INFO ] Redundant transitions in 44 ms returned []
[2023-04-07 01:45:00] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:45:00] [INFO ] Invariant cache hit.
[2023-04-07 01:45:00] [INFO ] Dead Transitions using invariants and state equation in 672 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2839 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-04 in 7707 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 01:45:00] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-07 01:45:00] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 01:45:01] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 01:45:01] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:01] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:45:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:01] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-04-07 01:45:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:45:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:01] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:45:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:01] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-04-07 01:45:01] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:01] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
[2023-04-07 01:45:01] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2023-04-07 01:45:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-07 01:45:01] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 46 ms.
[2023-04-07 01:45:02] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-07 01:45:02] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2023-04-07 01:45:02] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2023-04-07 01:45:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 394 ms
[2023-04-07 01:45:02] [INFO ] Added : 80 causal constraints over 17 iterations in 1080 ms. Result :sat
Minimization took 80 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 63 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 64 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 01:45:02] [INFO ] Computed 25 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1674 ms. (steps per millisecond=597 ) 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 01:45:05] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-07 01:45:05] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:45:05] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:05] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-07 01:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:05] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-04-07 01:45:05] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:45:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:05] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:05] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-04-07 01:45:05] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:05] [INFO ] [Nat]Added 284 Read/Feed constraints in 39 ms returned sat
[2023-04-07 01:45:05] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2023-04-07 01:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2023-04-07 01:45:05] [INFO ] Computed and/alt/rep : 569/1392/401 causal constraints (skipped 247 transitions) in 45 ms.
[2023-04-07 01:45:06] [INFO ] Added : 47 causal constraints over 10 iterations in 413 ms. Result :sat
Minimization took 66 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 52 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 55 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-07 01:45:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:45:06] [INFO ] Invariant cache hit.
[2023-04-07 01:45:06] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-04-07 01:45:06] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:45:06] [INFO ] Invariant cache hit.
[2023-04-07 01:45:06] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:08] [INFO ] Implicit Places using invariants and state equation in 1554 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
[2023-04-07 01:45:08] [INFO ] Redundant transitions in 42 ms returned []
[2023-04-07 01:45:08] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-07 01:45:08] [INFO ] Invariant cache hit.
[2023-04-07 01:45:08] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2723 ms. Remains : 392/392 places, 2104/2104 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-08 in 8017 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 01:45:08] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-07 01:45:09] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 01:45:09] [INFO ] Computed 25 invariants in 2 ms
[2023-04-07 01:45:09] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:45:09] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:09] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2023-04-07 01:45:09] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:45:09] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:09] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:09] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-04-07 01:45:09] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:09] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-07 01:45:09] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 1 ms to minimize.
[2023-04-07 01:45:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-04-07 01:45:09] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 49 ms.
[2023-04-07 01:45:10] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2023-04-07 01:45:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-04-07 01:45:10] [INFO ] Added : 40 causal constraints over 8 iterations in 507 ms. Result :sat
Minimization took 76 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 79 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 80 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 01:45:10] [INFO ] Computed 25 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1975 ms. (steps per millisecond=506 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 1) seen :0
[2023-04-07 01:45:12] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 01:45:12] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 01:45:12] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:12] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:13] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-04-07 01:45:13] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:45:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:13] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:13] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-04-07 01:45:13] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:13] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-07 01:45:13] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 51 ms.
[2023-04-07 01:45:13] [INFO ] Added : 44 causal constraints over 9 iterations in 386 ms. Result :sat
Minimization took 70 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 64 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 64 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 51 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 01:45:14] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:45:14] [INFO ] Invariant cache hit.
[2023-04-07 01:45:14] [INFO ] Implicit Places using invariants in 334 ms returned []
[2023-04-07 01:45:14] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:45:14] [INFO ] Invariant cache hit.
[2023-04-07 01:45:14] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:16] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2023-04-07 01:45:16] [INFO ] Redundant transitions in 44 ms returned []
[2023-04-07 01:45:16] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:45:16] [INFO ] Invariant cache hit.
[2023-04-07 01:45:16] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2748 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-12 in 7779 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 01:45:16] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-04-07 01:45:16] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-07 01:45:16] [INFO ] Computed 25 invariants in 5 ms
[2023-04-07 01:45:16] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2023-04-07 01:45:16] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-07 01:45:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:16] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2023-04-07 01:45:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:45:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:45:17] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:45:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:17] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-04-07 01:45:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:17] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
[2023-04-07 01:45:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-07 01:45:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-07 01:45:17] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 47 ms.
[2023-04-07 01:45:17] [INFO ] Added : 70 causal constraints over 14 iterations in 570 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 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 61 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 62 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 01:45:18] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1670 ms. (steps per millisecond=598 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 487 ms. (steps per millisecond=2053 ) properties (out of 1) seen :0
[2023-04-07 01:45:20] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-07 01:45:20] [INFO ] Computed 25 invariants in 4 ms
[2023-04-07 01:45:20] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-07 01:45:20] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 15 ms returned sat
[2023-04-07 01:45:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:20] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-04-07 01:45:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 01:45:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-07 01:45:20] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-07 01:45:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 01:45:20] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2023-04-07 01:45:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:20] [INFO ] [Nat]Added 284 Read/Feed constraints in 34 ms returned sat
[2023-04-07 01:45:20] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 50 ms.
[2023-04-07 01:45:21] [INFO ] Added : 62 causal constraints over 13 iterations in 513 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 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 50 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-07 01:45:21] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:45:21] [INFO ] Invariant cache hit.
[2023-04-07 01:45:21] [INFO ] Implicit Places using invariants in 333 ms returned []
[2023-04-07 01:45:21] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:45:21] [INFO ] Invariant cache hit.
[2023-04-07 01:45:22] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-07 01:45:23] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1932 ms to find 0 implicit places.
[2023-04-07 01:45:23] [INFO ] Redundant transitions in 40 ms returned []
[2023-04-07 01:45:23] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-07 01:45:23] [INFO ] Invariant cache hit.
[2023-04-07 01:45:24] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2721 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-13 in 7530 ms.
[2023-04-07 01:45:24] [INFO ] Flatten gal took : 156 ms
[2023-04-07 01:45:24] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-04-07 01: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 101291 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: EisenbergMcGuire_PT_08
(NrP: 396 NrTr: 2108 NrArc: 11128)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.115sec

net check time: 0m 0.001sec

init dd package: 0m 2.710sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9611372 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16104996 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.012sec

23378 45707 150275 158161 197809 210674 226480 501200 611028 590891 592047 632430 628929 625287 562592 524003 510831 1193899 1198540 1205684 1195703 1299274 1260065 1255260 1083901 1043829 1002000 1144854 1240268 1320720 1460967 1544635 1689273 1774603

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="marciexred"
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 marciexred"
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 r522-tall-167987247100261"
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 ;