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-167987246400229.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-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246400229
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.3K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 11K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:20 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 255K 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-04-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680837968451

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-04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 03:26:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 03:26:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:26:14] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-04-07 03:26:14] [INFO ] Transformed 196 places.
[2023-04-07 03:26:14] [INFO ] Transformed 448 transitions.
[2023-04-07 03:26:14] [INFO ] Found NUPN structural information;
[2023-04-07 03:26:14] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 411 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 4 ms.
FORMULA EisenbergMcGuire-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 284 out of 448 initially.
// Phase 1: matrix 284 rows 196 cols
[2023-04-07 03:26:14] [INFO ] Computed 13 invariants in 24 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 15) seen :9
FORMULA EisenbergMcGuire-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
[2023-04-07 03:26:15] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2023-04-07 03:26:15] [INFO ] Computed 13 invariants in 5 ms
[2023-04-07 03:26:15] [INFO ] [Real]Absence check using 9 positive place invariants in 22 ms returned sat
[2023-04-07 03:26:15] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 7 ms returned sat
[2023-04-07 03:26:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:15] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2023-04-07 03:26:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:16] [INFO ] [Nat]Absence check using 9 positive place invariants in 48 ms returned sat
[2023-04-07 03:26:16] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 10 ms returned sat
[2023-04-07 03:26:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:16] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-04-07 03:26:16] [INFO ] State equation strengthened by 112 read => feed constraints.
[2023-04-07 03:26:16] [INFO ] [Nat]Added 112 Read/Feed constraints in 74 ms returned sat
[2023-04-07 03:26:17] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 68 ms.
[2023-04-07 03:26:20] [INFO ] Deduced a trap composed of 4 places in 1738 ms of which 33 ms to minimize.
[2023-04-07 03:26:20] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 1 ms to minimize.
[2023-04-07 03:26:20] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 1 ms to minimize.
[2023-04-07 03:26:20] [INFO ] Deduced a trap composed of 14 places in 196 ms of which 6 ms to minimize.
[2023-04-07 03:26:20] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 6 ms to minimize.
[2023-04-07 03:26:21] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 0 ms to minimize.
[2023-04-07 03:26:21] [INFO ] Trap strengthening (SAT) tested/added 6/6 trap constraints in 2873 ms
[2023-04-07 03:26:21] [INFO ] Deduced a trap composed of 3 places in 295 ms of which 0 ms to minimize.
[2023-04-07 03:26:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:26:21] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-07 03:26:21] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:22] [INFO ] [Real]Absence check using state equation in 760 ms returned sat
[2023-04-07 03:26:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-07 03:26:22] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:22] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-04-07 03:26:22] [INFO ] [Nat]Added 112 Read/Feed constraints in 40 ms returned sat
[2023-04-07 03:26:22] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 3 ms to minimize.
[2023-04-07 03:26:22] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2023-04-07 03:26:23] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 0 ms to minimize.
[2023-04-07 03:26:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 481 ms
[2023-04-07 03:26:23] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 16 ms.
[2023-04-07 03:26:23] [INFO ] Added : 101 causal constraints over 21 iterations in 548 ms. Result :sat
Minimization took 89 ms.
[2023-04-07 03:26:23] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-07 03:26:23] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:26:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:23] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2023-04-07 03:26:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-04-07 03:26:24] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 10 ms returned sat
[2023-04-07 03:26:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:24] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-04-07 03:26:24] [INFO ] [Nat]Added 112 Read/Feed constraints in 21 ms returned sat
[2023-04-07 03:26:24] [INFO ] Deduced a trap composed of 82 places in 263 ms of which 1 ms to minimize.
[2023-04-07 03:26:24] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 0 ms to minimize.
[2023-04-07 03:26:24] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 1 ms to minimize.
[2023-04-07 03:26:24] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 1 ms to minimize.
[2023-04-07 03:26:25] [INFO ] Deduced a trap composed of 3 places in 408 ms of which 0 ms to minimize.
[2023-04-07 03:26:25] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 1 ms to minimize.
[2023-04-07 03:26:25] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 1 ms to minimize.
[2023-04-07 03:26:25] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1549 ms
[2023-04-07 03:26:25] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 38 ms.
[2023-04-07 03:26:27] [INFO ] Added : 159 causal constraints over 32 iterations in 1288 ms. Result :sat
Minimization took 113 ms.
[2023-04-07 03:26:27] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-04-07 03:26:27] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:27] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-04-07 03:26:27] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-04-07 03:26:27] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:27] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2023-04-07 03:26:27] [INFO ] [Nat]Added 112 Read/Feed constraints in 31 ms returned sat
[2023-04-07 03:26:31] [INFO ] Deduced a trap composed of 3 places in 3962 ms of which 19 ms to minimize.
[2023-04-07 03:26:31] [INFO ] Deduced a trap composed of 3 places in 210 ms of which 1 ms to minimize.
[2023-04-07 03:26:33] [INFO ] Deduced a trap composed of 23 places in 1553 ms of which 0 ms to minimize.
[2023-04-07 03:26:33] [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 03:26:33] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2023-04-07 03:26:33] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:33] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-04-07 03:26:33] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-04-07 03:26:33] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:33] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-04-07 03:26:33] [INFO ] [Nat]Added 112 Read/Feed constraints in 15 ms returned sat
[2023-04-07 03:26:33] [INFO ] Deduced a trap composed of 59 places in 104 ms of which 0 ms to minimize.
[2023-04-07 03:26:34] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-04-07 03:26:34] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 0 ms to minimize.
[2023-04-07 03:26:34] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 1 ms to minimize.
[2023-04-07 03:26:34] [INFO ] Deduced a trap composed of 20 places in 449 ms of which 28 ms to minimize.
[2023-04-07 03:26:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1131 ms
[2023-04-07 03:26:35] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 27 ms.
[2023-04-07 03:26:35] [INFO ] Deduced a trap composed of 3 places in 157 ms of which 0 ms to minimize.
[2023-04-07 03:26:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2023-04-07 03:26:36] [INFO ] Added : 143 causal constraints over 29 iterations in 1112 ms. Result :sat
Minimization took 74 ms.
[2023-04-07 03:26:36] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2023-04-07 03:26:36] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:36] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-04-07 03:26:36] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-04-07 03:26:36] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:26:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:36] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-04-07 03:26:36] [INFO ] [Nat]Added 112 Read/Feed constraints in 14 ms returned sat
[2023-04-07 03:26:36] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 0 ms to minimize.
[2023-04-07 03:26:37] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 1 ms to minimize.
[2023-04-07 03:26:37] [INFO ] Deduced a trap composed of 24 places in 107 ms of which 1 ms to minimize.
[2023-04-07 03:26:37] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 1 ms to minimize.
[2023-04-07 03:26:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 622 ms
[2023-04-07 03:26:37] [INFO ] Computed and/alt/rep : 296/974/260 causal constraints (skipped 20 transitions) in 39 ms.
[2023-04-07 03:26:38] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 0 ms to minimize.
[2023-04-07 03:26:40] [INFO ] Deduced a trap composed of 39 places in 1963 ms of which 3 ms to minimize.
[2023-04-07 03:26:41] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 0 ms to minimize.
[2023-04-07 03:26:41] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2023-04-07 03:26:41] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 7 ms to minimize.
[2023-04-07 03:26:41] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2711 ms
[2023-04-07 03:26:41] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 0 ms to minimize.
[2023-04-07 03:26: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 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]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 8 place count 192 transition count 393
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 110 place count 141 transition count 393
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 122 place count 129 transition count 345
Iterating global reduction 2 with 12 rules applied. Total rules applied 134 place count 129 transition count 345
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 158 place count 117 transition count 333
Applied a total of 158 rules in 118 ms. Remains 117 /196 variables (removed 79) and now considering 333/448 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 117/196 places, 333/448 transitions.
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:42] [INFO ] Computed 13 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1456 ms. (steps per millisecond=686 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 348 ms. (steps per millisecond=2873 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 4) seen :0
[2023-04-07 03:26:45] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:45] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 03:26:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:45] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-04-07 03:26:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:45] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-04-07 03:26:45] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:45] [INFO ] [Nat]Added 76 Read/Feed constraints in 23 ms returned sat
[2023-04-07 03:26:45] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2023-04-07 03:26:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2023-04-07 03:26:45] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 14 ms.
[2023-04-07 03:26:45] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 0 ms to minimize.
[2023-04-07 03:26:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2023-04-07 03:26:45] [INFO ] Added : 40 causal constraints over 9 iterations in 238 ms. Result :sat
Minimization took 31 ms.
[2023-04-07 03:26:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:45] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-04-07 03:26:45] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:46] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-04-07 03:26:46] [INFO ] [Nat]Added 76 Read/Feed constraints in 8 ms returned sat
[2023-04-07 03:26:46] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 0 ms to minimize.
[2023-04-07 03:26:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-04-07 03:26:46] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 12 ms.
[2023-04-07 03:26:46] [INFO ] Added : 17 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 22 ms.
[2023-04-07 03:26:46] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-07 03:26:46] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:46] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-04-07 03:26:46] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:46] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 25 ms returned sat
[2023-04-07 03:26:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:47] [INFO ] [Nat]Absence check using state equation in 721 ms returned sat
[2023-04-07 03:26:47] [INFO ] [Nat]Added 76 Read/Feed constraints in 7 ms returned sat
[2023-04-07 03:26:47] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-07 03:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-04-07 03:26:47] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 15 ms.
[2023-04-07 03:26:47] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 0 ms to minimize.
[2023-04-07 03:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-04-07 03:26:47] [INFO ] Added : 45 causal constraints over 9 iterations in 241 ms. Result :sat
Minimization took 26 ms.
[2023-04-07 03:26:47] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:47] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:47] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-04-07 03:26:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 03:26:47] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:47] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-04-07 03:26:47] [INFO ] [Nat]Added 76 Read/Feed constraints in 9 ms returned sat
[2023-04-07 03:26:47] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-04-07 03:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-04-07 03:26:47] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 20 ms.
[2023-04-07 03:26:47] [INFO ] Added : 36 causal constraints over 8 iterations in 117 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 28 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 117/117 places, 333/333 transitions.
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:48] [INFO ] Computed 13 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1033 ms. (steps per millisecond=968 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=2666 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=2645 ) properties (out of 2) seen :0
[2023-04-07 03:26:49] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:49] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:26:49] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:49] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:49] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2023-04-07 03:26:49] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:50] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:50] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-04-07 03:26:50] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:50] [INFO ] [Nat]Added 76 Read/Feed constraints in 8 ms returned sat
[2023-04-07 03:26:50] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2023-04-07 03:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-07 03:26:50] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 16 ms.
[2023-04-07 03:26:50] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2023-04-07 03:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 142 ms
[2023-04-07 03:26:50] [INFO ] Added : 45 causal constraints over 9 iterations in 269 ms. Result :sat
Minimization took 31 ms.
[2023-04-07 03:26:50] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:50] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:50] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-04-07 03:26:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:50] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-04-07 03:26:50] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:26:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-04-07 03:26:50] [INFO ] [Nat]Added 76 Read/Feed constraints in 11 ms returned sat
[2023-04-07 03:26:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2023-04-07 03:26:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-04-07 03:26:50] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 15 ms.
[2023-04-07 03:26:50] [INFO ] Added : 36 causal constraints over 8 iterations in 142 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 15 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 117/117 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 13 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2023-04-07 03:26:51] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:26:51] [INFO ] Invariant cache hit.
[2023-04-07 03:26:51] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-04-07 03:26:51] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:26:51] [INFO ] Invariant cache hit.
[2023-04-07 03:26:51] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:51] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2023-04-07 03:26:51] [INFO ] Redundant transitions in 25 ms returned []
[2023-04-07 03:26:51] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:26:51] [INFO ] Invariant cache hit.
[2023-04-07 03:26:51] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 858 ms. Remains : 117/117 places, 333/333 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-09
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:51] [INFO ] Computed 13 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) 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 03:26:51] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:51] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:26:52] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:52] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:52] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-04-07 03:26:52] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-07 03:26:52] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 8 ms returned sat
[2023-04-07 03:26:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:52] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-04-07 03:26:52] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:52] [INFO ] [Nat]Added 76 Read/Feed constraints in 12 ms returned sat
[2023-04-07 03:26:52] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2023-04-07 03:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-04-07 03:26:52] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 12 ms.
[2023-04-07 03:26:52] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2023-04-07 03:26:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-07 03:26:52] [INFO ] Added : 45 causal constraints over 9 iterations in 222 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 332
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 332
Applied a total of 2 rules in 12 ms. Remains 116 /117 variables (removed 1) and now considering 332/333 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 116/117 places, 332/333 transitions.
Normalized transition count is 168 out of 332 initially.
// Phase 1: matrix 168 rows 116 cols
[2023-04-07 03:26:52] [INFO ] Computed 13 invariants in 7 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 986 ms. (steps per millisecond=1014 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 1) seen :0
[2023-04-07 03:26:53] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
// Phase 1: matrix 168 rows 116 cols
[2023-04-07 03:26:53] [INFO ] Computed 13 invariants in 2 ms
[2023-04-07 03:26:54] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:54] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 03:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:54] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-04-07 03:26:54] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:54] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:54] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-04-07 03:26:54] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:54] [INFO ] [Nat]Added 76 Read/Feed constraints in 9 ms returned sat
[2023-04-07 03:26:54] [INFO ] Computed and/alt/rep : 165/496/129 causal constraints (skipped 35 transitions) in 25 ms.
[2023-04-07 03:26:54] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-04-07 03:26:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-07 03:26:54] [INFO ] Added : 35 causal constraints over 7 iterations in 193 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 9 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 116/116 places, 332/332 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 332/332 transitions.
Applied a total of 0 rules in 8 ms. Remains 116 /116 variables (removed 0) and now considering 332/332 (removed 0) transitions.
[2023-04-07 03:26:54] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2023-04-07 03:26:54] [INFO ] Invariant cache hit.
[2023-04-07 03:26:54] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-04-07 03:26:54] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2023-04-07 03:26:54] [INFO ] Invariant cache hit.
[2023-04-07 03:26:54] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:54] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-04-07 03:26:54] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 03:26:54] [INFO ] Flow matrix only has 168 transitions (discarded 164 similar events)
[2023-04-07 03:26:54] [INFO ] Invariant cache hit.
[2023-04-07 03:26:55] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 496 ms. Remains : 116/116 places, 332/332 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-09 in 3111 ms.
Starting property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-10
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:55] [INFO ] Computed 13 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) 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 03:26:55] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:55] [INFO ] Computed 13 invariants in 1 ms
[2023-04-07 03:26:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-04-07 03:26:55] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:55] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-04-07 03:26:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2023-04-07 03:26:55] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:55] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-04-07 03:26:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:55] [INFO ] [Nat]Added 76 Read/Feed constraints in 8 ms returned sat
[2023-04-07 03:26:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2023-04-07 03:26:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-04-07 03:26:55] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 9 ms.
[2023-04-07 03:26:55] [INFO ] Added : 36 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 26 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 8 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 117/117 places, 333/333 transitions.
Normalized transition count is 169 out of 333 initially.
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:55] [INFO ] Computed 13 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1011 ms. (steps per millisecond=989 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=2849 ) properties (out of 1) seen :0
[2023-04-07 03:26:56] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
// Phase 1: matrix 169 rows 117 cols
[2023-04-07 03:26:56] [INFO ] Computed 13 invariants in 3 ms
[2023-04-07 03:26:56] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:56] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 03:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-04-07 03:26:56] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:26:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-04-07 03:26:56] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 03:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:26:56] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-04-07 03:26:56] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:56] [INFO ] [Nat]Added 76 Read/Feed constraints in 8 ms returned sat
[2023-04-07 03:26:57] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2023-04-07 03:26:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2023-04-07 03:26:57] [INFO ] Computed and/alt/rep : 166/497/130 causal constraints (skipped 35 transitions) in 13 ms.
[2023-04-07 03:26:57] [INFO ] Added : 36 causal constraints over 8 iterations in 105 ms. Result :sat
Minimization took 27 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 22 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 117/117 places, 333/333 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 333/333 transitions.
Applied a total of 0 rules in 11 ms. Remains 117 /117 variables (removed 0) and now considering 333/333 (removed 0) transitions.
[2023-04-07 03:26:57] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:26:57] [INFO ] Invariant cache hit.
[2023-04-07 03:26:57] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-04-07 03:26:57] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:26:57] [INFO ] Invariant cache hit.
[2023-04-07 03:26:57] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-04-07 03:26:57] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2023-04-07 03:26:57] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 03:26:57] [INFO ] Flow matrix only has 169 transitions (discarded 164 similar events)
[2023-04-07 03:26:57] [INFO ] Invariant cache hit.
[2023-04-07 03:26:57] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 572 ms. Remains : 117/117 places, 333/333 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-04-UpperBounds-10 in 2793 ms.
[2023-04-07 03:26:58] [INFO ] Flatten gal took : 86 ms
[2023-04-07 03:26:58] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-04-07 03:26:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 333 transitions and 1626 arcs took 5 ms.
Total runtime 43902 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/758/ub_0_ --maxsum=/tmp/758/ub_1_
FORMULA EisenbergMcGuire-PT-04-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA EisenbergMcGuire-PT-04-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1680838069066

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name EisenbergMcGuire-PT-04-UpperBounds-09
ub formula formula --maxsum=/tmp/758/ub_0_
ub formula name EisenbergMcGuire-PT-04-UpperBounds-10
ub formula formula --maxsum=/tmp/758/ub_1_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 117 places, 333 transitions and 1626 arcs
pnml2lts-sym: Petri net EisenbergMcGuire_PT_04 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 333->329 groups
pnml2lts-sym: Regrouping took 0.070 real 0.070 user 0.000 sys
pnml2lts-sym: state vector length is 117; there are 329 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 1056274 group checks and 0 next state calls
pnml2lts-sym: reachability took 26.980 real 86.670 user 20.870 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.020 user 0.010 sys
pnml2lts-sym: state space has 145507 states, 70151 nodes
pnml2lts-sym: Maximum sum of /tmp/758/ub_0_ is: 1
pnml2lts-sym: Maximum sum of /tmp/758/ub_1_ is: 1
pnml2lts-sym: group_next: 2699 nodes total
pnml2lts-sym: group_explored: 2829 nodes, 2799 short vectors total
pnml2lts-sym: max token count: 1

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-04"
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-04, 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-167987246400229"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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