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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 9.1K Mar 23 15:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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 14K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 23 15:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:21 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 460K 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-05-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680838233585

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-05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 03:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-07 03:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 03:30:40] [INFO ] Load time of PNML (sax parser for PT used): 231 ms
[2023-04-07 03:30:40] [INFO ] Transformed 295 places.
[2023-04-07 03:30:40] [INFO ] Transformed 800 transitions.
[2023-04-07 03:30:40] [INFO ] Found NUPN structural information;
[2023-04-07 03:30:40] [INFO ] Parsed PT model containing 295 places and 800 transitions and 3600 arcs in 472 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
FORMULA EisenbergMcGuire-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 465 out of 800 initially.
// Phase 1: matrix 465 rows 295 cols
[2023-04-07 03:30:40] [INFO ] Computed 16 invariants in 49 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 15) seen :6
FORMULA EisenbergMcGuire-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) 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 9) 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 9) 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 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 9) 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 9) 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 9) 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 9) 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 9) seen :0
[2023-04-07 03:30:40] [INFO ] Flow matrix only has 465 transitions (discarded 335 similar events)
// Phase 1: matrix 465 rows 295 cols
[2023-04-07 03:30:40] [INFO ] Computed 16 invariants in 4 ms
[2023-04-07 03:30:42] [INFO ] [Real]Absence check using 11 positive place invariants in 48 ms returned sat
[2023-04-07 03:30:42] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2023-04-07 03:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:43] [INFO ] [Real]Absence check using state equation in 1270 ms returned sat
[2023-04-07 03:30:43] [INFO ] State equation strengthened by 196 read => feed constraints.
[2023-04-07 03:30:43] [INFO ] [Real]Added 196 Read/Feed constraints in 85 ms returned sat
[2023-04-07 03:30:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:30:43] [INFO ] [Nat]Absence check using 11 positive place invariants in 18 ms returned sat
[2023-04-07 03:30:43] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 16 ms returned sat
[2023-04-07 03:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:44] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-04-07 03:30:44] [INFO ] [Nat]Added 196 Read/Feed constraints in 65 ms returned sat
[2023-04-07 03:30:44] [INFO ] Deduced a trap composed of 3 places in 326 ms of which 3 ms to minimize.
[2023-04-07 03:30:44] [INFO ] Deduced a trap composed of 3 places in 255 ms of which 1 ms to minimize.
[2023-04-07 03:30:45] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 12 ms to minimize.
[2023-04-07 03:30:45] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 2 ms to minimize.
[2023-04-07 03:30:45] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 16 ms to minimize.
[2023-04-07 03:30:45] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 0 ms to minimize.
[2023-04-07 03:30:45] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 1 ms to minimize.
[2023-04-07 03:30:46] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 4 ms to minimize.
[2023-04-07 03:30:46] [INFO ] Deduced a trap composed of 26 places in 163 ms of which 0 ms to minimize.
[2023-04-07 03:30:46] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2023-04-07 03:30:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2285 ms
[2023-04-07 03:30:46] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 85 ms.
[2023-04-07 03:30:48] [INFO ] Added : 197 causal constraints over 40 iterations in 2055 ms. Result :sat
Minimization took 227 ms.
[2023-04-07 03:30:49] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 03:30:49] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 12 ms returned sat
[2023-04-07 03:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:49] [INFO ] [Real]Absence check using state equation in 259 ms returned sat
[2023-04-07 03:30:49] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:30:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 108 ms returned sat
[2023-04-07 03:30:49] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:30:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:50] [INFO ] [Nat]Absence check using state equation in 413 ms returned sat
[2023-04-07 03:30:50] [INFO ] [Nat]Added 196 Read/Feed constraints in 36 ms returned sat
[2023-04-07 03:30:50] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 0 ms to minimize.
[2023-04-07 03:30:50] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 1 ms to minimize.
[2023-04-07 03:30:50] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 1 ms to minimize.
[2023-04-07 03:30:51] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 1 ms to minimize.
[2023-04-07 03:30:51] [INFO ] Deduced a trap composed of 3 places in 177 ms of which 0 ms to minimize.
[2023-04-07 03:30:51] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 1 ms to minimize.
[2023-04-07 03:30:51] [INFO ] Deduced a trap composed of 17 places in 176 ms of which 0 ms to minimize.
[2023-04-07 03:30:51] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2023-04-07 03:30:52] [INFO ] Deduced a trap composed of 8 places in 162 ms of which 0 ms to minimize.
[2023-04-07 03:30:52] [INFO ] Deduced a trap composed of 20 places in 150 ms of which 0 ms to minimize.
[2023-04-07 03:30:52] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 0 ms to minimize.
[2023-04-07 03:30:52] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2317 ms
[2023-04-07 03:30:52] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 94 ms.
[2023-04-07 03:30:54] [INFO ] Deduced a trap composed of 55 places in 274 ms of which 1 ms to minimize.
[2023-04-07 03:30:54] [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.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:30:54] [INFO ] [Real]Absence check using 11 positive place invariants in 24 ms returned sat
[2023-04-07 03:30:54] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:30:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:55] [INFO ] [Real]Absence check using state equation in 255 ms returned sat
[2023-04-07 03:30:55] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:30:55] [INFO ] [Nat]Absence check using 11 positive place invariants in 16 ms returned sat
[2023-04-07 03:30:55] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:30:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:30:55] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-04-07 03:30:55] [INFO ] [Nat]Added 196 Read/Feed constraints in 27 ms returned sat
[2023-04-07 03:30:55] [INFO ] Deduced a trap composed of 3 places in 162 ms of which 0 ms to minimize.
[2023-04-07 03:30:56] [INFO ] Deduced a trap composed of 23 places in 740 ms of which 1 ms to minimize.
[2023-04-07 03:30:56] [INFO ] Deduced a trap composed of 20 places in 360 ms of which 0 ms to minimize.
[2023-04-07 03:30:57] [INFO ] Deduced a trap composed of 3 places in 275 ms of which 1 ms to minimize.
[2023-04-07 03:30:57] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-07 03:30:57] [INFO ] Deduced a trap composed of 26 places in 385 ms of which 1 ms to minimize.
[2023-04-07 03:30:57] [INFO ] Deduced a trap composed of 19 places in 124 ms of which 1 ms to minimize.
[2023-04-07 03:30:58] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 0 ms to minimize.
[2023-04-07 03:30:58] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 0 ms to minimize.
[2023-04-07 03:30:58] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 0 ms to minimize.
[2023-04-07 03:30:58] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2974 ms
[2023-04-07 03:30:58] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 52 ms.
[2023-04-07 03:31:00] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:31:00] [INFO ] [Real]Absence check using 11 positive place invariants in 33 ms returned sat
[2023-04-07 03:31:00] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 15 ms returned sat
[2023-04-07 03:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:00] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-04-07 03:31:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 56 ms returned sat
[2023-04-07 03:31:00] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 14 ms returned sat
[2023-04-07 03:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:00] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-04-07 03:31:00] [INFO ] [Nat]Added 196 Read/Feed constraints in 34 ms returned sat
[2023-04-07 03:31:01] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2023-04-07 03:31:01] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 1 ms to minimize.
[2023-04-07 03:31:01] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 28 ms to minimize.
[2023-04-07 03:31:01] [INFO ] Deduced a trap composed of 5 places in 214 ms of which 1 ms to minimize.
[2023-04-07 03:31:02] [INFO ] Deduced a trap composed of 34 places in 586 ms of which 0 ms to minimize.
[2023-04-07 03:31:02] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 0 ms to minimize.
[2023-04-07 03:31:02] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 1 ms to minimize.
[2023-04-07 03:31:02] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 0 ms to minimize.
[2023-04-07 03:31:03] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 1 ms to minimize.
[2023-04-07 03:31:03] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2271 ms
[2023-04-07 03:31:03] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 88 ms.
[2023-04-07 03:31:05] [INFO ] Deduced a trap composed of 55 places in 279 ms of which 0 ms to minimize.
[2023-04-07 03:31:05] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.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:31:05] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2023-04-07 03:31:05] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:06] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-04-07 03:31:06] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-04-07 03:31:06] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:06] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2023-04-07 03:31:06] [INFO ] [Nat]Added 196 Read/Feed constraints in 48 ms returned sat
[2023-04-07 03:31:08] [INFO ] Deduced a trap composed of 6 places in 2004 ms of which 11 ms to minimize.
[2023-04-07 03:31:09] [INFO ] Deduced a trap composed of 3 places in 1009 ms of which 15 ms to minimize.
[2023-04-07 03:31:09] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 0 ms to minimize.
[2023-04-07 03:31:10] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2023-04-07 03:31:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3399 ms
[2023-04-07 03:31:10] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 60 ms.
[2023-04-07 03:31:11] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 1 ms to minimize.
[2023-04-07 03:31:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:31:11] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-07 03:31:11] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2023-04-07 03:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:11] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-04-07 03:31:11] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 03:31:12] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:13] [INFO ] [Nat]Absence check using state equation in 1696 ms returned sat
[2023-04-07 03:31:13] [INFO ] [Nat]Added 196 Read/Feed constraints in 44 ms returned sat
[2023-04-07 03:31:13] [INFO ] Deduced a trap composed of 3 places in 164 ms of which 0 ms to minimize.
[2023-04-07 03:31:14] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 1 ms to minimize.
[2023-04-07 03:31:14] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2023-04-07 03:31:14] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 2 ms to minimize.
[2023-04-07 03:31:14] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 0 ms to minimize.
[2023-04-07 03:31:14] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2023-04-07 03:31:15] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 0 ms to minimize.
[2023-04-07 03:31:15] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-04-07 03:31:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1473 ms
[2023-04-07 03:31:15] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 40 ms.
[2023-04-07 03:31:17] [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: Broken pipe ... 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: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1189)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-07 03:31:17] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-07 03:31:17] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 11 ms returned sat
[2023-04-07 03:31:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:17] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2023-04-07 03:31:17] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-04-07 03:31:17] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:17] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-04-07 03:31:17] [INFO ] [Nat]Added 196 Read/Feed constraints in 20 ms returned sat
[2023-04-07 03:31:17] [INFO ] Deduced a trap composed of 26 places in 199 ms of which 9 ms to minimize.
[2023-04-07 03:31:22] [INFO ] Deduced a trap composed of 38 places in 4160 ms of which 21 ms to minimize.
[2023-04-07 03:31:22] [INFO ] Deduced a trap composed of 3 places in 142 ms of which 1 ms to minimize.
[2023-04-07 03:31:22] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 0 ms to minimize.
[2023-04-07 03:31: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 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 03:31:22] [INFO ] [Real]Absence check using 11 positive place invariants in 32 ms returned sat
[2023-04-07 03:31:22] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:22] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-04-07 03:31:22] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:22] [INFO ] [Nat]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-04-07 03:31:22] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-07 03:31:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:23] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-04-07 03:31:23] [INFO ] [Nat]Added 196 Read/Feed constraints in 40 ms returned sat
[2023-04-07 03:31:23] [INFO ] Deduced a trap composed of 3 places in 471 ms of which 1 ms to minimize.
[2023-04-07 03:31:23] [INFO ] Deduced a trap composed of 3 places in 131 ms of which 1 ms to minimize.
[2023-04-07 03:31:23] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 1 ms to minimize.
[2023-04-07 03:31:24] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 0 ms to minimize.
[2023-04-07 03:31:24] [INFO ] Deduced a trap composed of 34 places in 186 ms of which 0 ms to minimize.
[2023-04-07 03:31:24] [INFO ] Deduced a trap composed of 27 places in 178 ms of which 1 ms to minimize.
[2023-04-07 03:31:24] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 2 ms to minimize.
[2023-04-07 03:31:24] [INFO ] Deduced a trap composed of 3 places in 149 ms of which 1 ms to minimize.
[2023-04-07 03:31:25] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 2 ms to minimize.
[2023-04-07 03:31:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1980 ms
[2023-04-07 03:31:25] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 40 ms.
[2023-04-07 03:31:27] [INFO ] Added : 239 causal constraints over 48 iterations in 2571 ms. Result :sat
Minimization took 152 ms.
[2023-04-07 03:31:27] [INFO ] [Real]Absence check using 11 positive place invariants in 10 ms returned sat
[2023-04-07 03:31:27] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:30] [INFO ] [Real]Absence check using state equation in 2162 ms returned sat
[2023-04-07 03:31:30] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:30] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 03:31:30] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 30 ms returned sat
[2023-04-07 03:31:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:30] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-04-07 03:31:30] [INFO ] [Nat]Added 196 Read/Feed constraints in 52 ms returned sat
[2023-04-07 03:31:30] [INFO ] Deduced a trap composed of 3 places in 209 ms of which 8 ms to minimize.
[2023-04-07 03:31:30] [INFO ] Deduced a trap composed of 3 places in 141 ms of which 8 ms to minimize.
[2023-04-07 03:31:31] [INFO ] Deduced a trap composed of 3 places in 161 ms of which 0 ms to minimize.
[2023-04-07 03:31:31] [INFO ] Deduced a trap composed of 32 places in 133 ms of which 1 ms to minimize.
[2023-04-07 03:31:31] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 0 ms to minimize.
[2023-04-07 03:31:31] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 898 ms
[2023-04-07 03:31:31] [INFO ] Computed and/alt/rep : 470/1832/410 causal constraints (skipped 50 transitions) in 57 ms.
[2023-04-07 03:31:34] [INFO ] Deduced a trap composed of 20 places in 269 ms of which 0 ms to minimize.
[2023-04-07 03:31:35] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 0 ms to minimize.
[2023-04-07 03:31:35] [INFO ] Trap strengthening (SAT) tested/added 2/2 trap constraints in 548 ms
[2023-04-07 03:31:35] [INFO ] Deduced a trap composed of 55 places in 235 ms of which 1 ms to minimize.
[2023-04-07 03:31: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 8
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, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 295 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 295/295 places, 800/800 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 295 transition count 795
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 290 transition count 795
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 10 place count 290 transition count 719
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 162 place count 214 transition count 719
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 182 place count 194 transition count 619
Iterating global reduction 2 with 20 rules applied. Total rules applied 202 place count 194 transition count 619
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 11 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 242 place count 174 transition count 599
Applied a total of 242 rules in 264 ms. Remains 174 /295 variables (removed 121) and now considering 599/800 (removed 201) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 264 ms. Remains : 174/295 places, 599/800 transitions.
Normalized transition count is 264 out of 599 initially.
// Phase 1: matrix 264 rows 174 cols
[2023-04-07 03:31:35] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1937 ms. (steps per millisecond=516 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=2227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 471 ms. (steps per millisecond=2123 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 505 ms. (steps per millisecond=1980 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 435 ms. (steps per millisecond=2298 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 420 ms. (steps per millisecond=2380 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=1934 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=2188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=2475 ) properties (out of 9) seen :0
[2023-04-07 03:31:41] [INFO ] Flow matrix only has 264 transitions (discarded 335 similar events)
// Phase 1: matrix 264 rows 174 cols
[2023-04-07 03:31:41] [INFO ] Computed 16 invariants in 2 ms
[2023-04-07 03:31:41] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 03:31:41] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 4 ms returned sat
[2023-04-07 03:31:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:41] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-04-07 03:31:41] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:41] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-07 03:31:41] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 10 ms returned sat
[2023-04-07 03:31:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:42] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-04-07 03:31:42] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:31:42] [INFO ] [Nat]Added 116 Read/Feed constraints in 40 ms returned sat
[2023-04-07 03:31:42] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 48 ms.
[2023-04-07 03:31:42] [INFO ] Added : 36 causal constraints over 8 iterations in 377 ms. Result :sat
Minimization took 71 ms.
[2023-04-07 03:31:42] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:31:42] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 10 ms returned sat
[2023-04-07 03:31:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:42] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-04-07 03:31:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:42] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:31:42] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:43] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2023-04-07 03:31:43] [INFO ] [Nat]Added 116 Read/Feed constraints in 34 ms returned sat
[2023-04-07 03:31:43] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 26 ms.
[2023-04-07 03:31:43] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2023-04-07 03:31:43] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-04-07 03:31:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 207 ms
[2023-04-07 03:31:43] [INFO ] Added : 55 causal constraints over 12 iterations in 515 ms. Result :sat
Minimization took 49 ms.
[2023-04-07 03:31:43] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:43] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-07 03:31:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:43] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-04-07 03:31:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 90 ms returned sat
[2023-04-07 03:31:44] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 35 ms returned sat
[2023-04-07 03:31:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:45] [INFO ] [Nat]Absence check using state equation in 936 ms returned sat
[2023-04-07 03:31:45] [INFO ] [Nat]Added 116 Read/Feed constraints in 13 ms returned sat
[2023-04-07 03:31:45] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 32 ms.
[2023-04-07 03:31:45] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 0 ms to minimize.
[2023-04-07 03:31:45] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2023-04-07 03:31:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2023-04-07 03:31:45] [INFO ] Added : 55 causal constraints over 12 iterations in 744 ms. Result :sat
Minimization took 55 ms.
[2023-04-07 03:31:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:45] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 5 ms returned sat
[2023-04-07 03:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:46] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-04-07 03:31:46] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:46] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 19 ms returned sat
[2023-04-07 03:31:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:47] [INFO ] [Nat]Absence check using state equation in 1218 ms returned sat
[2023-04-07 03:31:47] [INFO ] [Nat]Added 116 Read/Feed constraints in 33 ms returned sat
[2023-04-07 03:31:47] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 25 ms.
[2023-04-07 03:31:47] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-04-07 03:31:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-04-07 03:31:47] [INFO ] Added : 20 causal constraints over 4 iterations in 313 ms. Result :sat
Minimization took 42 ms.
[2023-04-07 03:31:47] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:47] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:47] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2023-04-07 03:31:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:48] [INFO ] [Nat]Absence check using 11 positive place invariants in 19 ms returned sat
[2023-04-07 03:31:48] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-07 03:31:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:48] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-04-07 03:31:48] [INFO ] [Nat]Added 116 Read/Feed constraints in 21 ms returned sat
[2023-04-07 03:31:49] [INFO ] Deduced a trap composed of 28 places in 850 ms of which 11 ms to minimize.
[2023-04-07 03:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 895 ms
[2023-04-07 03:31:49] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 22 ms.
[2023-04-07 03:31:49] [INFO ] Deduced a trap composed of 3 places in 96 ms of which 0 ms to minimize.
[2023-04-07 03:31:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2023-04-07 03:31:49] [INFO ] Added : 48 causal constraints over 10 iterations in 347 ms. Result :sat
Minimization took 52 ms.
[2023-04-07 03:31:49] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:49] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:49] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-04-07 03:31:49] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:49] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-07 03:31:49] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:49] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-04-07 03:31:49] [INFO ] [Nat]Added 116 Read/Feed constraints in 20 ms returned sat
[2023-04-07 03:31:49] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 23 ms.
[2023-04-07 03:31:50] [INFO ] Added : 32 causal constraints over 7 iterations in 134 ms. Result :sat
Minimization took 44 ms.
[2023-04-07 03:31:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:50] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 3 ms returned sat
[2023-04-07 03:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:50] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-04-07 03:31:50] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:50] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:31:50] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-07 03:31:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:50] [INFO ] [Nat]Absence check using state equation in 87 ms returned sat
[2023-04-07 03:31:50] [INFO ] [Nat]Added 116 Read/Feed constraints in 31 ms returned sat
[2023-04-07 03:31:50] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 0 ms to minimize.
[2023-04-07 03:31:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-07 03:31:50] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 33 ms.
[2023-04-07 03:31:50] [INFO ] Added : 18 causal constraints over 4 iterations in 174 ms. Result :sat
Minimization took 35 ms.
[2023-04-07 03:31:50] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:50] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:51] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2023-04-07 03:31:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:51] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:51] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 10 ms returned sat
[2023-04-07 03:31:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:51] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2023-04-07 03:31:51] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2023-04-07 03:31:51] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 17 ms.
[2023-04-07 03:31:51] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 0 ms to minimize.
[2023-04-07 03:31:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-04-07 03:31:51] [INFO ] Added : 41 causal constraints over 9 iterations in 351 ms. Result :sat
Minimization took 79 ms.
[2023-04-07 03:31:51] [INFO ] [Real]Absence check using 11 positive place invariants in 13 ms returned sat
[2023-04-07 03:31:51] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 7 ms returned sat
[2023-04-07 03:31:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:51] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2023-04-07 03:31:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:52] [INFO ] [Nat]Absence check using 11 positive place invariants in 72 ms returned sat
[2023-04-07 03:31:52] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 7 ms returned sat
[2023-04-07 03:31:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:52] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-04-07 03:31:52] [INFO ] [Nat]Added 116 Read/Feed constraints in 34 ms returned sat
[2023-04-07 03:31:52] [INFO ] Deduced a trap composed of 8 places in 242 ms of which 1 ms to minimize.
[2023-04-07 03:31:52] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 0 ms to minimize.
[2023-04-07 03:31:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2023-04-07 03:31:52] [INFO ] Computed and/alt/rep : 265/889/205 causal constraints (skipped 54 transitions) in 29 ms.
[2023-04-07 03:31:53] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 1 ms to minimize.
[2023-04-07 03:31:53] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2023-04-07 03:31:53] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-04-07 03:31:53] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 0 ms to minimize.
[2023-04-07 03:31:53] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 580 ms
[2023-04-07 03:31:53] [INFO ] Added : 101 causal constraints over 21 iterations in 1206 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA EisenbergMcGuire-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA EisenbergMcGuire-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 2 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 599/599 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 174 transition count 597
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 172 transition count 597
Applied a total of 4 rules in 36 ms. Remains 172 /174 variables (removed 2) and now considering 597/599 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 172/174 places, 597/599 transitions.
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2023-04-07 03:31:54] [INFO ] Computed 16 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1428 ms. (steps per millisecond=700 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=2631 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 433 ms. (steps per millisecond=2309 ) properties (out of 2) seen :0
[2023-04-07 03:31:56] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-07 03:31:56] [INFO ] Computed 16 invariants in 6 ms
[2023-04-07 03:31:57] [INFO ] [Real]Absence check using 11 positive place invariants in 56 ms returned sat
[2023-04-07 03:31:57] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 32 ms returned sat
[2023-04-07 03:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:58] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2023-04-07 03:31:58] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:58] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:31:58] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 16 ms returned sat
[2023-04-07 03:31:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:58] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2023-04-07 03:31:58] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:31:58] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2023-04-07 03:31:58] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 0 ms to minimize.
[2023-04-07 03:31:58] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2023-04-07 03:31:58] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2023-04-07 03:31:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 354 ms
[2023-04-07 03:31:58] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 48 ms.
[2023-04-07 03:31:59] [INFO ] Added : 47 causal constraints over 10 iterations in 268 ms. Result :sat
Minimization took 56 ms.
[2023-04-07 03:31:59] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-04-07 03:31:59] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 1 ms returned sat
[2023-04-07 03:31:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:59] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-04-07 03:31:59] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:31:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 03:31:59] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:31:59] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2023-04-07 03:31:59] [INFO ] [Nat]Added 116 Read/Feed constraints in 19 ms returned sat
[2023-04-07 03:31:59] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 23 ms.
[2023-04-07 03:31:59] [INFO ] Added : 43 causal constraints over 9 iterations in 209 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Support contains 2 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 23 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 172/172 places, 597/597 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 transitions.
Applied a total of 0 rules in 20 ms. Remains 172 /172 variables (removed 0) and now considering 597/597 (removed 0) transitions.
[2023-04-07 03:32:00] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-07 03:32:00] [INFO ] Invariant cache hit.
[2023-04-07 03:32:00] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-04-07 03:32:00] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-07 03:32:00] [INFO ] Invariant cache hit.
[2023-04-07 03:32:02] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:32:03] [INFO ] Implicit Places using invariants and state equation in 2694 ms returned []
Implicit Place search using SMT with State Equation took 3126 ms to find 0 implicit places.
[2023-04-07 03:32:03] [INFO ] Redundant transitions in 56 ms returned []
[2023-04-07 03:32:03] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
[2023-04-07 03:32:03] [INFO ] Invariant cache hit.
[2023-04-07 03:32:03] [INFO ] Dead Transitions using invariants and state equation in 512 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3736 ms. Remains : 172/172 places, 597/597 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-04
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2023-04-07 03:32:03] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) 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 1) seen :0
[2023-04-07 03:32:03] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-07 03:32:03] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 03:32:04] [INFO ] [Real]Absence check using 11 positive place invariants in 77 ms returned sat
[2023-04-07 03:32:04] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 63 ms returned sat
[2023-04-07 03:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:05] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2023-04-07 03:32:05] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:32:05] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-04-07 03:32:05] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 13 ms returned sat
[2023-04-07 03:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:05] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-04-07 03:32:05] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:32:05] [INFO ] [Nat]Added 116 Read/Feed constraints in 25 ms returned sat
[2023-04-07 03:32:05] [INFO ] Deduced a trap composed of 3 places in 94 ms of which 0 ms to minimize.
[2023-04-07 03:32:05] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 1 ms to minimize.
[2023-04-07 03:32:05] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2023-04-07 03:32:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 319 ms
[2023-04-07 03:32:06] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 23 ms.
[2023-04-07 03:32:06] [INFO ] Added : 47 causal constraints over 10 iterations in 260 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 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 172 transition count 596
Deduced a syphon composed of 1 places in 16 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 171 transition count 596
Applied a total of 2 rules in 31 ms. Remains 171 /172 variables (removed 1) and now considering 596/597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 171/172 places, 596/597 transitions.
Normalized transition count is 261 out of 596 initially.
// Phase 1: matrix 261 rows 171 cols
[2023-04-07 03:32:06] [INFO ] Computed 16 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1548 ms. (steps per millisecond=645 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 446 ms. (steps per millisecond=2242 ) properties (out of 1) seen :0
[2023-04-07 03:32:08] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2023-04-07 03:32:08] [INFO ] Computed 16 invariants in 7 ms
[2023-04-07 03:32:08] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 03:32:08] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 16 ms returned sat
[2023-04-07 03:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:08] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2023-04-07 03:32:08] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:32:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 30 ms returned sat
[2023-04-07 03:32:08] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:32:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:08] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2023-04-07 03:32:08] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:32:08] [INFO ] [Nat]Added 116 Read/Feed constraints in 16 ms returned sat
[2023-04-07 03:32:09] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 0 ms to minimize.
[2023-04-07 03:32:09] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2023-04-07 03:32:09] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2023-04-07 03:32:09] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 305 ms
[2023-04-07 03:32:09] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 18 ms.
[2023-04-07 03:32:09] [INFO ] Added : 39 causal constraints over 8 iterations in 342 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 70 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 52 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2023-04-07 03:32:09] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:32:09] [INFO ] Invariant cache hit.
[2023-04-07 03:32:11] [INFO ] Implicit Places using invariants in 2073 ms returned []
[2023-04-07 03:32:11] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:32:11] [INFO ] Invariant cache hit.
[2023-04-07 03:32:12] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:32:12] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 2719 ms to find 0 implicit places.
[2023-04-07 03:32:12] [INFO ] Redundant transitions in 33 ms returned []
[2023-04-07 03:32:12] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:32:12] [INFO ] Invariant cache hit.
[2023-04-07 03:32:13] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3368 ms. Remains : 171/171 places, 596/596 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-04 in 9361 ms.
Starting property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-08
Normalized transition count is 262 out of 597 initially.
// Phase 1: matrix 262 rows 172 cols
[2023-04-07 03:32:13] [INFO ] Computed 16 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
[2023-04-07 03:32:13] [INFO ] Flow matrix only has 262 transitions (discarded 335 similar events)
// Phase 1: matrix 262 rows 172 cols
[2023-04-07 03:32:13] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 03:32:13] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-04-07 03:32:13] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:13] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-04-07 03:32:13] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:32:13] [INFO ] [Nat]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-04-07 03:32:13] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:32:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:13] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2023-04-07 03:32:13] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:32:13] [INFO ] [Nat]Added 116 Read/Feed constraints in 17 ms returned sat
[2023-04-07 03:32:13] [INFO ] Computed and/alt/rep : 263/887/203 causal constraints (skipped 54 transitions) in 43 ms.
[2023-04-07 03:32:13] [INFO ] Added : 43 causal constraints over 9 iterations in 231 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 597/597 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 172 transition count 596
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 171 transition count 596
Applied a total of 2 rules in 64 ms. Remains 171 /172 variables (removed 1) and now considering 596/597 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 171/172 places, 596/597 transitions.
Normalized transition count is 261 out of 596 initially.
// Phase 1: matrix 261 rows 171 cols
[2023-04-07 03:32:14] [INFO ] Computed 16 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1535 ms. (steps per millisecond=651 ) properties (out of 1) 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 1) seen :0
[2023-04-07 03:32:15] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
// Phase 1: matrix 261 rows 171 cols
[2023-04-07 03:32:16] [INFO ] Computed 16 invariants in 1 ms
[2023-04-07 03:32:16] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 03:32:16] [INFO ] [Real]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:32:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:16] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2023-04-07 03:32:16] [INFO ] Solution in real domain found non-integer solution.
[2023-04-07 03:32:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-04-07 03:32:16] [INFO ] [Nat]Absence check using 11 positive and 5 generalized place invariants in 2 ms returned sat
[2023-04-07 03:32:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-07 03:32:16] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2023-04-07 03:32:16] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:32:16] [INFO ] [Nat]Added 116 Read/Feed constraints in 18 ms returned sat
[2023-04-07 03:32:16] [INFO ] Computed and/alt/rep : 262/886/202 causal constraints (skipped 54 transitions) in 25 ms.
[2023-04-07 03:32:16] [INFO ] Added : 40 causal constraints over 8 iterations in 204 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 44 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 171/171 places, 596/596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 596/596 transitions.
Applied a total of 0 rules in 31 ms. Remains 171 /171 variables (removed 0) and now considering 596/596 (removed 0) transitions.
[2023-04-07 03:32:16] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:32:16] [INFO ] Invariant cache hit.
[2023-04-07 03:32:23] [INFO ] Implicit Places using invariants in 6630 ms returned []
[2023-04-07 03:32:23] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:32:23] [INFO ] Invariant cache hit.
[2023-04-07 03:32:23] [INFO ] State equation strengthened by 116 read => feed constraints.
[2023-04-07 03:32:24] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 7459 ms to find 0 implicit places.
[2023-04-07 03:32:24] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 03:32:24] [INFO ] Flow matrix only has 261 transitions (discarded 335 similar events)
[2023-04-07 03:32:24] [INFO ] Invariant cache hit.
[2023-04-07 03:32:24] [INFO ] Dead Transitions using invariants and state equation in 476 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7993 ms. Remains : 171/171 places, 596/596 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-05-UpperBounds-08 in 11668 ms.
[2023-04-07 03:32:25] [INFO ] Flatten gal took : 207 ms
[2023-04-07 03:32:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 13 ms.
[2023-04-07 03:32:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 172 places, 597 transitions and 2994 arcs took 4 ms.
Total runtime 105940 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/963/ub_0_ --maxsum=/tmp/963/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 15279952 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16106448 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-05"
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-05, 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-167987246400237"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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