Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 6.3K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 16K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 2.3M 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-09-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680849638565

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-09
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 06:40:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 06:40:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 06:40:41] [INFO ] Load time of PNML (sax parser for PT used): 333 ms
[2023-04-07 06:40:41] [INFO ] Transformed 891 places.
[2023-04-07 06:40:41] [INFO ] Transformed 3888 transitions.
[2023-04-07 06:40:41] [INFO ] Found NUPN structural information;
[2023-04-07 06:40:41] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 609 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 18 ms.
Normalized transition count is 1809 out of 3888 initially.
// Phase 1: matrix 1809 rows 891 cols
[2023-04-07 06:40:42] [INFO ] Computed 28 invariants in 65 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 161 ms. (steps per millisecond=62 ) properties (out of 16) seen :8
FORMULA EisenbergMcGuire-PT-09-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) 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 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
[2023-04-07 06:40:42] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2023-04-07 06:40:42] [INFO ] Computed 28 invariants in 22 ms
[2023-04-07 06:40:43] [INFO ] [Real]Absence check using 19 positive place invariants in 59 ms returned sat
[2023-04-07 06:40:43] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 68 ms returned sat
[2023-04-07 06:40:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:40:43] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2023-04-07 06:40:44] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:40:44] [INFO ] [Nat]Absence check using 19 positive place invariants in 31 ms returned sat
[2023-04-07 06:40:44] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:40:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:40:45] [INFO ] [Nat]Absence check using state equation in 868 ms returned sat
[2023-04-07 06:40:45] [INFO ] State equation strengthened by 932 read => feed constraints.
[2023-04-07 06:40:45] [INFO ] [Nat]Added 932 Read/Feed constraints in 183 ms returned sat
[2023-04-07 06:40:46] [INFO ] Deduced a trap composed of 49 places in 538 ms of which 11 ms to minimize.
[2023-04-07 06:40:47] [INFO ] Deduced a trap composed of 3 places in 826 ms of which 1 ms to minimize.
[2023-04-07 06:40:48] [INFO ] Deduced a trap composed of 38 places in 558 ms of which 17 ms to minimize.
[2023-04-07 06:40:48] [INFO ] Deduced a trap composed of 3 places in 495 ms of which 18 ms to minimize.
[2023-04-07 06:40:49] [INFO ] Deduced a trap composed of 37 places in 490 ms of which 31 ms to minimize.
[2023-04-07 06:40:49] [INFO ] Deduced a trap composed of 27 places in 379 ms of which 0 ms to minimize.
[2023-04-07 06:40: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 06:40:49] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2023-04-07 06:40:49] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 06:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:40:50] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2023-04-07 06:40:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:40:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 35 ms returned sat
[2023-04-07 06:40:50] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:40:51] [INFO ] [Nat]Absence check using state equation in 391 ms returned sat
[2023-04-07 06:40:51] [INFO ] [Nat]Added 932 Read/Feed constraints in 191 ms returned sat
[2023-04-07 06:40:51] [INFO ] Deduced a trap composed of 3 places in 516 ms of which 1 ms to minimize.
[2023-04-07 06:40:52] [INFO ] Deduced a trap composed of 53 places in 483 ms of which 1 ms to minimize.
[2023-04-07 06:40:53] [INFO ] Deduced a trap composed of 3 places in 473 ms of which 1 ms to minimize.
[2023-04-07 06:40:53] [INFO ] Deduced a trap composed of 38 places in 429 ms of which 0 ms to minimize.
[2023-04-07 06:40:54] [INFO ] Deduced a trap composed of 3 places in 438 ms of which 1 ms to minimize.
[2023-04-07 06:40:54] [INFO ] Deduced a trap composed of 72 places in 499 ms of which 2 ms to minimize.
[2023-04-07 06:40:59] [INFO ] Deduced a trap composed of 3 places in 5141 ms of which 31 ms to minimize.
[2023-04-07 06:40:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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.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 06:41:00] [INFO ] [Real]Absence check using 19 positive place invariants in 32 ms returned sat
[2023-04-07 06:41:00] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:00] [INFO ] [Real]Absence check using state equation in 699 ms returned sat
[2023-04-07 06:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:01] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-04-07 06:41:01] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:01] [INFO ] [Nat]Absence check using state equation in 409 ms returned sat
[2023-04-07 06:41:01] [INFO ] [Nat]Added 932 Read/Feed constraints in 135 ms returned sat
[2023-04-07 06:41:02] [INFO ] Deduced a trap composed of 3 places in 444 ms of which 1 ms to minimize.
[2023-04-07 06:41:02] [INFO ] Deduced a trap composed of 26 places in 439 ms of which 1 ms to minimize.
[2023-04-07 06:41:03] [INFO ] Deduced a trap composed of 259 places in 544 ms of which 4 ms to minimize.
[2023-04-07 06:41:03] [INFO ] Deduced a trap composed of 3 places in 442 ms of which 1 ms to minimize.
[2023-04-07 06:41:04] [INFO ] Deduced a trap composed of 20 places in 703 ms of which 1 ms to minimize.
[2023-04-07 06:41:05] [INFO ] Deduced a trap composed of 3 places in 924 ms of which 26 ms to minimize.
[2023-04-07 06:41:06] [INFO ] Deduced a trap composed of 60 places in 532 ms of which 1 ms to minimize.
[2023-04-07 06:41: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 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 06:41:06] [INFO ] [Real]Absence check using 19 positive place invariants in 27 ms returned sat
[2023-04-07 06:41:06] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 06:41:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:06] [INFO ] [Real]Absence check using state equation in 457 ms returned sat
[2023-04-07 06:41:07] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 32 ms returned sat
[2023-04-07 06:41:07] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2023-04-07 06:41:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:08] [INFO ] [Nat]Absence check using state equation in 754 ms returned sat
[2023-04-07 06:41:08] [INFO ] [Nat]Added 932 Read/Feed constraints in 166 ms returned sat
[2023-04-07 06:41:08] [INFO ] Deduced a trap composed of 3 places in 524 ms of which 1 ms to minimize.
[2023-04-07 06:41:09] [INFO ] Deduced a trap composed of 3 places in 427 ms of which 15 ms to minimize.
[2023-04-07 06:41:10] [INFO ] Deduced a trap composed of 66 places in 533 ms of which 1 ms to minimize.
[2023-04-07 06:41:16] [INFO ] Deduced a trap composed of 3 places in 6408 ms of which 34 ms to minimize.
[2023-04-07 06:41:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 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 06:41:16] [INFO ] [Real]Absence check using 19 positive place invariants in 24 ms returned sat
[2023-04-07 06:41:16] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 06:41:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:17] [INFO ] [Real]Absence check using state equation in 674 ms returned sat
[2023-04-07 06:41:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:17] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-04-07 06:41:17] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 06:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:18] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-04-07 06:41:18] [INFO ] [Nat]Added 932 Read/Feed constraints in 114 ms returned sat
[2023-04-07 06:41:18] [INFO ] Deduced a trap composed of 3 places in 595 ms of which 1 ms to minimize.
[2023-04-07 06:41:19] [INFO ] Deduced a trap composed of 3 places in 489 ms of which 4 ms to minimize.
[2023-04-07 06:41:20] [INFO ] Deduced a trap composed of 3 places in 508 ms of which 1 ms to minimize.
[2023-04-07 06:41:20] [INFO ] Deduced a trap composed of 44 places in 373 ms of which 16 ms to minimize.
[2023-04-07 06:41:21] [INFO ] Deduced a trap composed of 43 places in 468 ms of which 1 ms to minimize.
[2023-04-07 06:41:21] [INFO ] Deduced a trap composed of 6 places in 501 ms of which 1 ms to minimize.
[2023-04-07 06:41:22] [INFO ] Deduced a trap composed of 114 places in 378 ms of which 1 ms to minimize.
[2023-04-07 06:41:22] [INFO ] Deduced a trap composed of 3 places in 428 ms of which 1 ms to minimize.
[2023-04-07 06:41:22] [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.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 06:41:22] [INFO ] [Real]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-04-07 06:41:22] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:23] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2023-04-07 06:41:23] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 20 ms returned sat
[2023-04-07 06:41:23] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:24] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2023-04-07 06:41:24] [INFO ] [Nat]Added 932 Read/Feed constraints in 160 ms returned sat
[2023-04-07 06:41:24] [INFO ] Deduced a trap composed of 47 places in 443 ms of which 2 ms to minimize.
[2023-04-07 06:41:25] [INFO ] Deduced a trap composed of 63 places in 700 ms of which 2 ms to minimize.
[2023-04-07 06:41:26] [INFO ] Deduced a trap composed of 3 places in 449 ms of which 5 ms to minimize.
[2023-04-07 06:41:26] [INFO ] Deduced a trap composed of 3 places in 386 ms of which 1 ms to minimize.
[2023-04-07 06:41:27] [INFO ] Deduced a trap composed of 26 places in 408 ms of which 1 ms to minimize.
[2023-04-07 06:41:27] [INFO ] Deduced a trap composed of 3 places in 570 ms of which 1 ms to minimize.
[2023-04-07 06:41:28] [INFO ] Deduced a trap composed of 3 places in 379 ms of which 1 ms to minimize.
[2023-04-07 06:41:28] [INFO ] Deduced a trap composed of 3 places in 716 ms of which 5 ms to minimize.
[2023-04-07 06:41:28] [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.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 06:41:29] [INFO ] [Real]Absence check using 19 positive place invariants in 17 ms returned sat
[2023-04-07 06:41:29] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:29] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2023-04-07 06:41:29] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:29] [INFO ] [Nat]Absence check using 19 positive place invariants in 18 ms returned sat
[2023-04-07 06:41:29] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:30] [INFO ] [Nat]Absence check using state equation in 362 ms returned sat
[2023-04-07 06:41:30] [INFO ] [Nat]Added 932 Read/Feed constraints in 205 ms returned sat
[2023-04-07 06:41:32] [INFO ] Deduced a trap composed of 66 places in 2409 ms of which 1 ms to minimize.
[2023-04-07 06:41:33] [INFO ] Deduced a trap composed of 36 places in 371 ms of which 0 ms to minimize.
[2023-04-07 06:41:33] [INFO ] Deduced a trap composed of 3 places in 489 ms of which 1 ms to minimize.
[2023-04-07 06:41:34] [INFO ] Deduced a trap composed of 3 places in 618 ms of which 1 ms to minimize.
[2023-04-07 06:41:35] [INFO ] Deduced a trap composed of 3 places in 894 ms of which 2 ms to minimize.
[2023-04-07 06:41:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 06:41:35] [INFO ] [Real]Absence check using 19 positive place invariants in 25 ms returned sat
[2023-04-07 06:41:35] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 8 ms returned sat
[2023-04-07 06:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:36] [INFO ] [Real]Absence check using state equation in 731 ms returned sat
[2023-04-07 06:41:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 32 ms returned sat
[2023-04-07 06:41:36] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 06:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:37] [INFO ] [Nat]Absence check using state equation in 372 ms returned sat
[2023-04-07 06:41:37] [INFO ] [Nat]Added 932 Read/Feed constraints in 119 ms returned sat
[2023-04-07 06:41:37] [INFO ] Deduced a trap composed of 3 places in 457 ms of which 1 ms to minimize.
[2023-04-07 06:41:38] [INFO ] Deduced a trap composed of 46 places in 646 ms of which 1 ms to minimize.
[2023-04-07 06:41:39] [INFO ] Deduced a trap composed of 69 places in 416 ms of which 1 ms to minimize.
[2023-04-07 06:41:39] [INFO ] Deduced a trap composed of 3 places in 397 ms of which 1 ms to minimize.
[2023-04-07 06:41:40] [INFO ] Deduced a trap composed of 45 places in 446 ms of which 1 ms to minimize.
[2023-04-07 06:41:40] [INFO ] Deduced a trap composed of 96 places in 433 ms of which 1 ms to minimize.
[2023-04-07 06:41:41] [INFO ] Deduced a trap composed of 44 places in 437 ms of which 0 ms to minimize.
[2023-04-07 06:41:41] [INFO ] Deduced a trap composed of 62 places in 477 ms of which 1 ms to minimize.
[2023-04-07 06:41:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0]
Support contains 8 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 882 transition count 3627
Deduced a syphon composed of 252 places in 5 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 630 transition count 3627
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 594 place count 558 transition count 2979
Iterating global reduction 2 with 72 rules applied. Total rules applied 666 place count 558 transition count 2979
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 7 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 808 place count 487 transition count 2908
Applied a total of 808 rules in 643 ms. Remains 487 /891 variables (removed 404) and now considering 2908/3888 (removed 980) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 644 ms. Remains : 487/891 places, 2908/3888 transitions.
Normalized transition count is 829 out of 2908 initially.
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 06:41:42] [INFO ] Computed 28 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2608 ms. (steps per millisecond=383 ) properties (out of 8) seen :1
FORMULA EisenbergMcGuire-PT-09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 552 ms. (steps per millisecond=1811 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=1953 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=1956 ) properties (out of 7) seen :0
[2023-04-07 06:41:48] [INFO ] Flow matrix only has 829 transitions (discarded 2079 similar events)
// Phase 1: matrix 829 rows 487 cols
[2023-04-07 06:41:48] [INFO ] Computed 28 invariants in 10 ms
[2023-04-07 06:41:48] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-04-07 06:41:48] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 06:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:49] [INFO ] [Real]Absence check using state equation in 313 ms returned sat
[2023-04-07 06:41:49] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:41:49] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:49] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2023-04-07 06:41:49] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:41:49] [INFO ] [Nat]Added 356 Read/Feed constraints in 47 ms returned sat
[2023-04-07 06:41:49] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 169 ms.
[2023-04-07 06:41:51] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-07 06:41:51] [INFO ] Deduced a trap composed of 3 places in 133 ms of which 1 ms to minimize.
[2023-04-07 06:41:51] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 13 ms to minimize.
[2023-04-07 06:41:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 662 ms
[2023-04-07 06:41:52] [INFO ] Added : 113 causal constraints over 24 iterations in 2463 ms. Result :sat
Minimization took 111 ms.
[2023-04-07 06:41:52] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-07 06:41:52] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 06:41:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:52] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-04-07 06:41:52] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:52] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-04-07 06:41:52] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 06:41:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:53] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2023-04-07 06:41:53] [INFO ] [Nat]Added 356 Read/Feed constraints in 74 ms returned sat
[2023-04-07 06:41:53] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-07 06:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-07 06:41:53] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 172 ms.
[2023-04-07 06:41:54] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-07 06:41:55] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 1 ms to minimize.
[2023-04-07 06:41:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 341 ms
[2023-04-07 06:41:55] [INFO ] Added : 74 causal constraints over 15 iterations in 1766 ms. Result :sat
Minimization took 111 ms.
[2023-04-07 06:41:55] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:41:55] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:55] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-04-07 06:41:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:55] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:41:55] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 06:41:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:56] [INFO ] [Nat]Absence check using state equation in 228 ms returned sat
[2023-04-07 06:41:56] [INFO ] [Nat]Added 356 Read/Feed constraints in 54 ms returned sat
[2023-04-07 06:41:56] [INFO ] Deduced a trap composed of 3 places in 143 ms of which 1 ms to minimize.
[2023-04-07 06:41:56] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 0 ms to minimize.
[2023-04-07 06:41:56] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 0 ms to minimize.
[2023-04-07 06:41:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 512 ms
[2023-04-07 06:41:56] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 156 ms.
[2023-04-07 06:41:57] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 0 ms to minimize.
[2023-04-07 06:41:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 195 ms
[2023-04-07 06:41:57] [INFO ] Added : 83 causal constraints over 17 iterations in 1303 ms. Result :sat
Minimization took 113 ms.
[2023-04-07 06:41:58] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:41:58] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 06:41:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:58] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2023-04-07 06:41:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:41:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-07 06:41:58] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:41:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:41:58] [INFO ] [Nat]Absence check using state equation in 299 ms returned sat
[2023-04-07 06:41:58] [INFO ] [Nat]Added 356 Read/Feed constraints in 71 ms returned sat
[2023-04-07 06:41:59] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-07 06:41:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-04-07 06:41:59] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 118 ms.
[2023-04-07 06:41:59] [INFO ] Added : 41 causal constraints over 9 iterations in 665 ms. Result :sat
Minimization took 90 ms.
[2023-04-07 06:42:00] [INFO ] [Real]Absence check using 19 positive place invariants in 11 ms returned sat
[2023-04-07 06:42:00] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 06:42:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:00] [INFO ] [Real]Absence check using state equation in 295 ms returned sat
[2023-04-07 06:42:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:00] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-07 06:42:00] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 06:42:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:05] [INFO ] [Nat]Absence check using state equation in 4584 ms returned sat
[2023-04-07 06:42:05] [INFO ] [Nat]Added 356 Read/Feed constraints in 71 ms returned sat
[2023-04-07 06:42:05] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2023-04-07 06:42:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-07 06:42:05] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 119 ms.
[2023-04-07 06:42:06] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 15 ms to minimize.
[2023-04-07 06:42:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-04-07 06:42:06] [INFO ] Added : 23 causal constraints over 5 iterations in 857 ms. Result :sat
Minimization took 96 ms.
[2023-04-07 06:42:06] [INFO ] [Real]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:42:06] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 06:42:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:06] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2023-04-07 06:42:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:06] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:42:06] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:42:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:07] [INFO ] [Nat]Absence check using state equation in 330 ms returned sat
[2023-04-07 06:42:07] [INFO ] [Nat]Added 356 Read/Feed constraints in 68 ms returned sat
[2023-04-07 06:42:07] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 111 ms.
[2023-04-07 06:42:07] [INFO ] Added : 31 causal constraints over 7 iterations in 509 ms. Result :sat
Minimization took 107 ms.
[2023-04-07 06:42:07] [INFO ] [Real]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 06:42:07] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 7 ms returned sat
[2023-04-07 06:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:08] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-04-07 06:42:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:42:08] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 14 ms returned sat
[2023-04-07 06:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:10] [INFO ] [Nat]Absence check using state equation in 2235 ms returned sat
[2023-04-07 06:42:10] [INFO ] [Nat]Added 356 Read/Feed constraints in 74 ms returned sat
[2023-04-07 06:42:11] [INFO ] Deduced a trap composed of 3 places in 597 ms of which 15 ms to minimize.
[2023-04-07 06:42:11] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 4 ms to minimize.
[2023-04-07 06:42:11] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2023-04-07 06:42:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1055 ms
[2023-04-07 06:42:11] [INFO ] Computed and/alt/rep : 704/1594/488 causal constraints (skipped 332 transitions) in 116 ms.
[2023-04-07 06:42:12] [INFO ] Added : 80 causal constraints over 16 iterations in 1064 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-09-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 2908/2908 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 34 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 2907
Applied a total of 2 rules in 408 ms. Remains 486 /487 variables (removed 1) and now considering 2907/2908 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 408 ms. Remains : 486/487 places, 2907/2908 transitions.
Normalized transition count is 828 out of 2907 initially.
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:15] [INFO ] Computed 28 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2387 ms. (steps per millisecond=418 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=1776 ) properties (out of 2) seen :0
[2023-04-07 06:42:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:19] [INFO ] Computed 28 invariants in 3 ms
[2023-04-07 06:42:19] [INFO ] [Real]Absence check using 19 positive place invariants in 93 ms returned sat
[2023-04-07 06:42:19] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:42:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:19] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2023-04-07 06:42:19] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:19] [INFO ] [Nat]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-04-07 06:42:19] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 37 ms returned sat
[2023-04-07 06:42:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:21] [INFO ] [Nat]Absence check using state equation in 1261 ms returned sat
[2023-04-07 06:42:21] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:42:21] [INFO ] [Nat]Added 356 Read/Feed constraints in 140 ms returned sat
[2023-04-07 06:42:21] [INFO ] Deduced a trap composed of 3 places in 196 ms of which 16 ms to minimize.
[2023-04-07 06:42:21] [INFO ] Deduced a trap composed of 25 places in 162 ms of which 1 ms to minimize.
[2023-04-07 06:42:22] [INFO ] Deduced a trap composed of 3 places in 1240 ms of which 32 ms to minimize.
[2023-04-07 06:42:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1781 ms
[2023-04-07 06:42:23] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 189 ms.
[2023-04-07 06:42:24] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2023-04-07 06:42:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2023-04-07 06:42:24] [INFO ] Added : 66 causal constraints over 14 iterations in 1360 ms. Result :sat
Minimization took 122 ms.
[2023-04-07 06:42:24] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2023-04-07 06:42:24] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 16 ms returned sat
[2023-04-07 06:42:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:25] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2023-04-07 06:42:25] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:25] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2023-04-07 06:42:25] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 11 ms returned sat
[2023-04-07 06:42:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:25] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-04-07 06:42:25] [INFO ] [Nat]Added 356 Read/Feed constraints in 43 ms returned sat
[2023-04-07 06:42:25] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 06:42:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-04-07 06:42:25] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 114 ms.
[2023-04-07 06:42:25] [INFO ] Added : 20 causal constraints over 4 iterations in 404 ms. Result :sat
Minimization took 100 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 112 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 123 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 06:42:26] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:42:26] [INFO ] Invariant cache hit.
[2023-04-07 06:42:34] [INFO ] Implicit Places using invariants in 7600 ms returned []
[2023-04-07 06:42:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:42:34] [INFO ] Invariant cache hit.
[2023-04-07 06:42:34] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:42:38] [INFO ] Implicit Places using invariants and state equation in 3986 ms returned []
Implicit Place search using SMT with State Equation took 11624 ms to find 0 implicit places.
[2023-04-07 06:42:38] [INFO ] Redundant transitions in 323 ms returned []
[2023-04-07 06:42:38] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:42:38] [INFO ] Invariant cache hit.
[2023-04-07 06:42:40] [INFO ] Dead Transitions using invariants and state equation in 2029 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14139 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-07
Normalized transition count is 828 out of 2907 initially.
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:40] [INFO ] Computed 28 invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-04-07 06:42:40] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:40] [INFO ] Computed 28 invariants in 2 ms
[2023-04-07 06:42:40] [INFO ] [Real]Absence check using 19 positive place invariants in 58 ms returned sat
[2023-04-07 06:42:40] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 06:42:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:41] [INFO ] [Real]Absence check using state equation in 275 ms returned sat
[2023-04-07 06:42:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-07 06:42:41] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:41] [INFO ] [Nat]Absence check using state equation in 197 ms returned sat
[2023-04-07 06:42:41] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:42:41] [INFO ] [Nat]Added 356 Read/Feed constraints in 68 ms returned sat
[2023-04-07 06:42:41] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 0 ms to minimize.
[2023-04-07 06:42:42] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 0 ms to minimize.
[2023-04-07 06:42:42] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 0 ms to minimize.
[2023-04-07 06:42:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 547 ms
[2023-04-07 06:42:42] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 112 ms.
[2023-04-07 06:42:43] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 1 ms to minimize.
[2023-04-07 06:42:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 202 ms
[2023-04-07 06:42:43] [INFO ] Added : 66 causal constraints over 14 iterations in 1121 ms. Result :sat
Minimization took 138 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 104 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 486/486 places, 2907/2907 transitions.
Normalized transition count is 828 out of 2907 initially.
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:43] [INFO ] Computed 28 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2715 ms. (steps per millisecond=368 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 1) seen :0
[2023-04-07 06:42:47] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:47] [INFO ] Computed 28 invariants in 18 ms
[2023-04-07 06:42:47] [INFO ] [Real]Absence check using 19 positive place invariants in 45 ms returned sat
[2023-04-07 06:42:47] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2023-04-07 06:42:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:47] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-04-07 06:42:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:48] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-04-07 06:42:48] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:48] [INFO ] [Nat]Absence check using state equation in 278 ms returned sat
[2023-04-07 06:42:48] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:42:48] [INFO ] [Nat]Added 356 Read/Feed constraints in 59 ms returned sat
[2023-04-07 06:42:48] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 06:42:48] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2023-04-07 06:42:48] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 06:42:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 475 ms
[2023-04-07 06:42:49] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 116 ms.
[2023-04-07 06:42:49] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 0 ms to minimize.
[2023-04-07 06:42:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2023-04-07 06:42:50] [INFO ] Added : 66 causal constraints over 14 iterations in 1177 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 228 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 86 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 06:42:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:42:50] [INFO ] Invariant cache hit.
[2023-04-07 06:42:51] [INFO ] Implicit Places using invariants in 783 ms returned []
[2023-04-07 06:42:51] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:42:51] [INFO ] Invariant cache hit.
[2023-04-07 06:42:52] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:42:55] [INFO ] Implicit Places using invariants and state equation in 3883 ms returned []
Implicit Place search using SMT with State Equation took 4708 ms to find 0 implicit places.
[2023-04-07 06:42:55] [INFO ] Redundant transitions in 269 ms returned []
[2023-04-07 06:42:55] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:42:55] [INFO ] Invariant cache hit.
[2023-04-07 06:42:57] [INFO ] Dead Transitions using invariants and state equation in 1926 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7004 ms. Remains : 486/486 places, 2907/2907 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-07 in 17160 ms.
Starting property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-08
Normalized transition count is 828 out of 2907 initially.
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:57] [INFO ] Computed 28 invariants in 9 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
[2023-04-07 06:42:57] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:42:57] [INFO ] Computed 28 invariants in 13 ms
[2023-04-07 06:42:58] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2023-04-07 06:42:58] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2023-04-07 06:42:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:58] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2023-04-07 06:42:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:42:58] [INFO ] [Nat]Absence check using 19 positive place invariants in 13 ms returned sat
[2023-04-07 06:42:58] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2023-04-07 06:42:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:42:59] [INFO ] [Nat]Absence check using state equation in 996 ms returned sat
[2023-04-07 06:42:59] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:42:59] [INFO ] [Nat]Added 356 Read/Feed constraints in 80 ms returned sat
[2023-04-07 06:42:59] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 0 ms to minimize.
[2023-04-07 06:42:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 158 ms
[2023-04-07 06:42:59] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 112 ms.
[2023-04-07 06:43:00] [INFO ] Added : 20 causal constraints over 4 iterations in 374 ms. Result :sat
Minimization took 97 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 486/486 places, 2907/2907 transitions.
Normalized transition count is 828 out of 2907 initially.
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:43:00] [INFO ] Computed 28 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2333 ms. (steps per millisecond=428 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 1) seen :0
[2023-04-07 06:43:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2023-04-07 06:43:03] [INFO ] Computed 28 invariants in 2 ms
[2023-04-07 06:43:03] [INFO ] [Real]Absence check using 19 positive place invariants in 12 ms returned sat
[2023-04-07 06:43:03] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 9 ms returned sat
[2023-04-07 06:43:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 06:43:03] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-04-07 06:43:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 06:43:04] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2023-04-07 06:43:04] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 3 ms returned sat
[2023-04-07 06:43:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 06:43:04] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2023-04-07 06:43:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:43:04] [INFO ] [Nat]Added 356 Read/Feed constraints in 85 ms returned sat
[2023-04-07 06:43:04] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-04-07 06:43:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-04-07 06:43:04] [INFO ] Computed and/alt/rep : 703/1593/487 causal constraints (skipped 332 transitions) in 167 ms.
[2023-04-07 06:43:05] [INFO ] Added : 20 causal constraints over 4 iterations in 392 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 98 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 105 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2023-04-07 06:43:05] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:43:05] [INFO ] Invariant cache hit.
[2023-04-07 06:43:06] [INFO ] Implicit Places using invariants in 832 ms returned []
[2023-04-07 06:43:06] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:43:06] [INFO ] Invariant cache hit.
[2023-04-07 06:43:06] [INFO ] State equation strengthened by 356 read => feed constraints.
[2023-04-07 06:43:10] [INFO ] Implicit Places using invariants and state equation in 3737 ms returned []
Implicit Place search using SMT with State Equation took 4581 ms to find 0 implicit places.
[2023-04-07 06:43:10] [INFO ] Redundant transitions in 78 ms returned []
[2023-04-07 06:43:10] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2023-04-07 06:43:10] [INFO ] Invariant cache hit.
[2023-04-07 06:43:12] [INFO ] Dead Transitions using invariants and state equation in 1966 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6770 ms. Remains : 486/486 places, 2907/2907 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-09-UpperBounds-08 in 14432 ms.
[2023-04-07 06:43:13] [INFO ] Flatten gal took : 411 ms
[2023-04-07 06:43:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-07 06:43:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 486 places, 2907 transitions and 15534 arcs took 19 ms.
Total runtime 152394 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/902/ub_0_ --maxsum=/tmp/902/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15276400 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101688 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is EisenbergMcGuire-PT-09, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r521-tall-167987246400269"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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