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.r523-tall-167987247800261.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 smartxred
Input is EisenbergMcGuire-PT-08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r523-tall-167987247800261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 23 15:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 23 15:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 23 15:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 23 15:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 31 16:48 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-00
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-01
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-02
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-03
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-04
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-05
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-06
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-07
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-08
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-09
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-10
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-11
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-12
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-13
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-14
FORMULA_NAME EisenbergMcGuire-PT-08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1680815057286

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-08
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:04:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-04-06 21:04:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:04:19] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-04-06 21:04:19] [INFO ] Transformed 712 places.
[2023-04-06 21:04:19] [INFO ] Transformed 2816 transitions.
[2023-04-06 21:04:19] [INFO ] Found NUPN structural information;
[2023-04-06 21:04:19] [INFO ] Parsed PT model containing 712 places and 2816 transitions and 13440 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Normalized transition count is 1368 out of 2816 initially.
// Phase 1: matrix 1368 rows 712 cols
[2023-04-06 21:04:19] [INFO ] Computed 25 invariants in 38 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :10
FORMULA EisenbergMcGuire-PT-08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-08-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 6) seen :0
[2023-04-06 21:04:19] [INFO ] Flow matrix only has 1368 transitions (discarded 1448 similar events)
// Phase 1: matrix 1368 rows 712 cols
[2023-04-06 21:04:19] [INFO ] Computed 25 invariants in 12 ms
[2023-04-06 21:04:20] [INFO ] [Real]Absence check using 17 positive place invariants in 18 ms returned sat
[2023-04-06 21:04:20] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:20] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-04-06 21:04:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:04:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-04-06 21:04:20] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:21] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2023-04-06 21:04:21] [INFO ] State equation strengthened by 676 read => feed constraints.
[2023-04-06 21:04:21] [INFO ] [Nat]Added 676 Read/Feed constraints in 82 ms returned sat
[2023-04-06 21:04:21] [INFO ] Deduced a trap composed of 3 places in 309 ms of which 5 ms to minimize.
[2023-04-06 21:04:22] [INFO ] Deduced a trap composed of 67 places in 333 ms of which 1 ms to minimize.
[2023-04-06 21:04:22] [INFO ] Deduced a trap composed of 49 places in 294 ms of which 2 ms to minimize.
[2023-04-06 21:04:22] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 2 ms to minimize.
[2023-04-06 21:04:23] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 2 ms to minimize.
[2023-04-06 21:04:23] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 0 ms to minimize.
[2023-04-06 21:04:23] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 1 ms to minimize.
[2023-04-06 21:04:24] [INFO ] Deduced a trap composed of 51 places in 305 ms of which 1 ms to minimize.
[2023-04-06 21:04:24] [INFO ] Deduced a trap composed of 81 places in 281 ms of which 0 ms to minimize.
[2023-04-06 21:04:24] [INFO ] Deduced a trap composed of 5 places in 353 ms of which 1 ms to minimize.
[2023-04-06 21:04:25] [INFO ] Deduced a trap composed of 104 places in 309 ms of which 1 ms to minimize.
[2023-04-06 21:04:25] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 0 ms to minimize.
[2023-04-06 21:04:25] [INFO ] Deduced a trap composed of 148 places in 295 ms of which 1 ms to minimize.
[2023-04-06 21:04:25] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 21:04:26] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-06 21:04:26] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:26] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2023-04-06 21:04:26] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:04:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-04-06 21:04:26] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:26] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2023-04-06 21:04:26] [INFO ] [Nat]Added 676 Read/Feed constraints in 95 ms returned sat
[2023-04-06 21:04:27] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 0 ms to minimize.
[2023-04-06 21:04:27] [INFO ] Deduced a trap composed of 3 places in 308 ms of which 0 ms to minimize.
[2023-04-06 21:04:27] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 1 ms to minimize.
[2023-04-06 21:04:28] [INFO ] Deduced a trap composed of 40 places in 265 ms of which 0 ms to minimize.
[2023-04-06 21:04:28] [INFO ] Deduced a trap composed of 3 places in 271 ms of which 1 ms to minimize.
[2023-04-06 21:04:28] [INFO ] Deduced a trap composed of 26 places in 276 ms of which 1 ms to minimize.
[2023-04-06 21:04:29] [INFO ] Deduced a trap composed of 48 places in 281 ms of which 0 ms to minimize.
[2023-04-06 21:04:29] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 1 ms to minimize.
[2023-04-06 21:04:29] [INFO ] Deduced a trap composed of 38 places in 265 ms of which 0 ms to minimize.
[2023-04-06 21:04:30] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 0 ms to minimize.
[2023-04-06 21:04:30] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 1 ms to minimize.
[2023-04-06 21:04:30] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 1 ms to minimize.
[2023-04-06 21:04:30] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 0 ms to minimize.
[2023-04-06 21:04:31] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2023-04-06 21:04:31] [INFO ] Deduced a trap composed of 41 places in 90 ms of which 1 ms to minimize.
[2023-04-06 21:04:31] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4313 ms
[2023-04-06 21:04:31] [INFO ] Computed and/alt/rep : 889/2057/721 causal constraints (skipped 639 transitions) in 129 ms.
[2023-04-06 21:04:31] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :unknown
[2023-04-06 21:04:31] [INFO ] [Real]Absence check using 17 positive place invariants in 21 ms returned sat
[2023-04-06 21:04:31] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-06 21:04:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:31] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-04-06 21:04:31] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:04:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-04-06 21:04:32] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:32] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2023-04-06 21:04:32] [INFO ] [Nat]Added 676 Read/Feed constraints in 83 ms returned sat
[2023-04-06 21:04:32] [INFO ] Deduced a trap composed of 64 places in 267 ms of which 1 ms to minimize.
[2023-04-06 21:04:33] [INFO ] Deduced a trap composed of 88 places in 267 ms of which 0 ms to minimize.
[2023-04-06 21:04:33] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 1 ms to minimize.
[2023-04-06 21:04:33] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 0 ms to minimize.
[2023-04-06 21:04:34] [INFO ] Deduced a trap composed of 47 places in 272 ms of which 1 ms to minimize.
[2023-04-06 21:04:34] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 2 ms to minimize.
[2023-04-06 21:04:34] [INFO ] Deduced a trap composed of 3 places in 270 ms of which 5 ms to minimize.
[2023-04-06 21:04:35] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2023-04-06 21:04:35] [INFO ] Deduced a trap composed of 3 places in 230 ms of which 0 ms to minimize.
[2023-04-06 21:04:35] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 0 ms to minimize.
[2023-04-06 21:04:35] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 0 ms to minimize.
[2023-04-06 21:04:36] [INFO ] Deduced a trap composed of 3 places in 227 ms of which 1 ms to minimize.
[2023-04-06 21:04:36] [INFO ] Deduced a trap composed of 104 places in 234 ms of which 1 ms to minimize.
[2023-04-06 21:04:36] [INFO ] Deduced a trap composed of 30 places in 155 ms of which 0 ms to minimize.
[2023-04-06 21:04:36] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 0 ms to minimize.
[2023-04-06 21:04:36] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 0 ms to minimize.
[2023-04-06 21:04:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 21:04:37] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-06 21:04:37] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 5 ms returned sat
[2023-04-06 21:04:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:37] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2023-04-06 21:04:37] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:04:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-04-06 21:04:37] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:37] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2023-04-06 21:04:37] [INFO ] [Nat]Added 676 Read/Feed constraints in 89 ms returned sat
[2023-04-06 21:04:38] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 1 ms to minimize.
[2023-04-06 21:04:38] [INFO ] Deduced a trap composed of 3 places in 254 ms of which 0 ms to minimize.
[2023-04-06 21:04:38] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 0 ms to minimize.
[2023-04-06 21:04:39] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 1 ms to minimize.
[2023-04-06 21:04:39] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 1 ms to minimize.
[2023-04-06 21:04:39] [INFO ] Deduced a trap composed of 41 places in 279 ms of which 0 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 46 places in 273 ms of which 2 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 3 places in 277 ms of which 1 ms to minimize.
[2023-04-06 21:04:40] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 1 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 1 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 3 places in 187 ms of which 1 ms to minimize.
[2023-04-06 21:04:41] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2023-04-06 21:04:42] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 1 ms to minimize.
[2023-04-06 21:04:42] [INFO ] Deduced a trap composed of 82 places in 264 ms of which 1 ms to minimize.
[2023-04-06 21:04:42] [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-06 21:04:42] [INFO ] [Real]Absence check using 17 positive place invariants in 14 ms returned sat
[2023-04-06 21:04:42] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:42] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-04-06 21:04:43] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:04:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-06 21:04:43] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:43] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2023-04-06 21:04:43] [INFO ] [Nat]Added 676 Read/Feed constraints in 86 ms returned sat
[2023-04-06 21:04:43] [INFO ] Deduced a trap composed of 3 places in 258 ms of which 0 ms to minimize.
[2023-04-06 21:04:44] [INFO ] Deduced a trap composed of 56 places in 262 ms of which 0 ms to minimize.
[2023-04-06 21:04:44] [INFO ] Deduced a trap composed of 40 places in 270 ms of which 0 ms to minimize.
[2023-04-06 21:04:44] [INFO ] Deduced a trap composed of 3 places in 263 ms of which 0 ms to minimize.
[2023-04-06 21:04:45] [INFO ] Deduced a trap composed of 3 places in 260 ms of which 1 ms to minimize.
[2023-04-06 21:04:45] [INFO ] Deduced a trap composed of 3 places in 267 ms of which 1 ms to minimize.
[2023-04-06 21:04:45] [INFO ] Deduced a trap composed of 6 places in 283 ms of which 2 ms to minimize.
[2023-04-06 21:04:46] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 0 ms to minimize.
[2023-04-06 21:04:46] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 2 ms to minimize.
[2023-04-06 21:04:46] [INFO ] Deduced a trap composed of 50 places in 247 ms of which 13 ms to minimize.
[2023-04-06 21:04:46] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 1 ms to minimize.
[2023-04-06 21:04:47] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 0 ms to minimize.
[2023-04-06 21:04:47] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 0 ms to minimize.
[2023-04-06 21:04:47] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 0 ms to minimize.
[2023-04-06 21:04:47] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 0 ms to minimize.
[2023-04-06 21:04:47] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 1 ms to minimize.
[2023-04-06 21:04:48] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 0 ms to minimize.
[2023-04-06 21:04:48] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:919)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-04-06 21:04:48] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2023-04-06 21:04:48] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 9 ms returned sat
[2023-04-06 21:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:48] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2023-04-06 21:04:48] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:04:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-04-06 21:04:48] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:04:49] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2023-04-06 21:04:49] [INFO ] [Nat]Added 676 Read/Feed constraints in 83 ms returned sat
[2023-04-06 21:04:49] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 0 ms to minimize.
[2023-04-06 21:04:49] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 1 ms to minimize.
[2023-04-06 21:04:50] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 1 ms to minimize.
[2023-04-06 21:04:50] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 0 ms to minimize.
[2023-04-06 21:04:50] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 4 ms to minimize.
[2023-04-06 21:04:50] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 0 ms to minimize.
[2023-04-06 21:04:51] [INFO ] Deduced a trap composed of 86 places in 273 ms of which 0 ms to minimize.
[2023-04-06 21:04:51] [INFO ] Deduced a trap composed of 3 places in 273 ms of which 0 ms to minimize.
[2023-04-06 21:04:51] [INFO ] Deduced a trap composed of 47 places in 181 ms of which 1 ms to minimize.
[2023-04-06 21:04:52] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 0 ms to minimize.
[2023-04-06 21:04:52] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 1 ms to minimize.
[2023-04-06 21:04:52] [INFO ] Deduced a trap composed of 36 places in 170 ms of which 0 ms to minimize.
[2023-04-06 21:04:52] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 0 ms to minimize.
[2023-04-06 21:04:53] [INFO ] Deduced a trap composed of 31 places in 226 ms of which 1 ms to minimize.
[2023-04-06 21:04:53] [INFO ] Deduced a trap composed of 82 places in 185 ms of which 0 ms to minimize.
[2023-04-06 21:04:53] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 0 ms to minimize.
[2023-04-06 21:04:53] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2023-04-06 21:04:53] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 4479 ms
[2023-04-06 21:04:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: 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:1002)
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-08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 712 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 712/712 places, 2816/2816 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 712 transition count 2808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 704 transition count 2808
Performed 196 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 196 Pre rules applied. Total rules applied 16 place count 704 transition count 2612
Deduced a syphon composed of 196 places in 5 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 2 with 392 rules applied. Total rules applied 408 place count 508 transition count 2612
Discarding 56 places :
Symmetric choice reduction at 2 with 56 rule applications. Total rules 464 place count 452 transition count 2164
Iterating global reduction 2 with 56 rules applied. Total rules applied 520 place count 452 transition count 2164
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 4 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 632 place count 396 transition count 2108
Applied a total of 632 rules in 290 ms. Remains 396 /712 variables (removed 316) and now considering 2108/2816 (removed 708) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 396/712 places, 2108/2816 transitions.
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:04:54] [INFO ] Computed 25 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3038 ms. (steps per millisecond=329 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 597 ms. (steps per millisecond=1675 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 591 ms. (steps per millisecond=1692 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 593 ms. (steps per millisecond=1686 ) properties (out of 5) seen :0
[2023-04-06 21:05:00] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:00] [INFO ] Computed 25 invariants in 9 ms
[2023-04-06 21:05:00] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:00] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:00] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-04-06 21:05:00] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:00] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:00] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:00] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-04-06 21:05:00] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:00] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-06 21:05:00] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2023-04-06 21:05:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-04-06 21:05:00] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 62 ms.
[2023-04-06 21:05:01] [INFO ] Added : 34 causal constraints over 7 iterations in 387 ms. Result :sat
Minimization took 77 ms.
[2023-04-06 21:05:01] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:01] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:01] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-04-06 21:05:01] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:01] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:01] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:01] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2023-04-06 21:05:01] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
[2023-04-06 21:05:01] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 57 ms.
[2023-04-06 21:05:02] [INFO ] Added : 67 causal constraints over 14 iterations in 569 ms. Result :sat
Minimization took 75 ms.
[2023-04-06 21:05:02] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:02] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 6 ms returned sat
[2023-04-06 21:05:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:02] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-04-06 21:05:02] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:02] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:02] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-04-06 21:05:02] [INFO ] [Nat]Added 284 Read/Feed constraints in 32 ms returned sat
[2023-04-06 21:05:03] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2023-04-06 21:05:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-04-06 21:05:03] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 58 ms.
[2023-04-06 21:05:03] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2023-04-06 21:05:03] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 0 ms to minimize.
[2023-04-06 21:05:03] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 0 ms to minimize.
[2023-04-06 21:05:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 375 ms
[2023-04-06 21:05:04] [INFO ] Added : 80 causal constraints over 17 iterations in 1096 ms. Result :sat
Minimization took 82 ms.
[2023-04-06 21:05:04] [INFO ] [Real]Absence check using 17 positive place invariants in 12 ms returned sat
[2023-04-06 21:05:04] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:04] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-04-06 21:05:04] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:04] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:04] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:04] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-04-06 21:05:04] [INFO ] [Nat]Added 284 Read/Feed constraints in 42 ms returned sat
[2023-04-06 21:05:04] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2023-04-06 21:05:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-04-06 21:05:04] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 55 ms.
[2023-04-06 21:05:05] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2023-04-06 21:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-04-06 21:05:05] [INFO ] Added : 40 causal constraints over 8 iterations in 514 ms. Result :sat
Minimization took 70 ms.
[2023-04-06 21:05:05] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:05] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:05] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2023-04-06 21:05:05] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:05] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:05] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:05] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-04-06 21:05:05] [INFO ] [Nat]Added 284 Read/Feed constraints in 42 ms returned sat
[2023-04-06 21:05:05] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2023-04-06 21:05:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2023-04-06 21:05:06] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 51 ms.
[2023-04-06 21:05:06] [INFO ] Added : 70 causal constraints over 14 iterations in 566 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 89 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 396/396 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Applied a total of 0 rules in 85 ms. Remains 396 /396 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2023-04-06 21:05:07] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-06 21:05:07] [INFO ] Invariant cache hit.
[2023-04-06 21:05:07] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-04-06 21:05:07] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-06 21:05:07] [INFO ] Invariant cache hit.
[2023-04-06 21:05:08] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:09] [INFO ] Implicit Places using invariants and state equation in 1499 ms returned []
Implicit Place search using SMT with State Equation took 1885 ms to find 0 implicit places.
[2023-04-06 21:05:09] [INFO ] Redundant transitions in 104 ms returned []
[2023-04-06 21:05:09] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
[2023-04-06 21:05:09] [INFO ] Invariant cache hit.
[2023-04-06 21:05:10] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2804 ms. Remains : 396/396 places, 2108/2108 transitions.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-02
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:10] [INFO ] Computed 25 invariants in 3 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-06 21:05:10] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:10] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 21:05:10] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:05:10] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:10] [INFO ] [Real]Absence check using state equation in 144 ms returned sat
[2023-04-06 21:05:10] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:10] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:10] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-04-06 21:05:10] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:10] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-06 21:05:10] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:05:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 21:05:10] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 53 ms.
[2023-04-06 21:05:11] [INFO ] Added : 34 causal constraints over 7 iterations in 326 ms. Result :sat
Minimization took 71 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 65 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:11] [INFO ] Computed 25 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2740 ms. (steps per millisecond=364 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 1) seen :0
[2023-04-06 21:05:14] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:14] [INFO ] Computed 25 invariants in 13 ms
[2023-04-06 21:05:14] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:14] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:14] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-04-06 21:05:14] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:15] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:15] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:15] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-04-06 21:05:15] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:15] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-06 21:05:15] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2023-04-06 21:05:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-04-06 21:05:15] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 67 ms.
[2023-04-06 21:05:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-04-06 21:05:16] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2023-04-06 21:05:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-04-06 21:05:16] [INFO ] Added : 96 causal constraints over 22 iterations in 1086 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 56 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 57 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-06 21:05:16] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:16] [INFO ] Invariant cache hit.
[2023-04-06 21:05:17] [INFO ] Implicit Places using invariants in 406 ms returned []
[2023-04-06 21:05:17] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:17] [INFO ] Invariant cache hit.
[2023-04-06 21:05:17] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:18] [INFO ] Implicit Places using invariants and state equation in 1658 ms returned []
Implicit Place search using SMT with State Equation took 2066 ms to find 0 implicit places.
[2023-04-06 21:05:18] [INFO ] Redundant transitions in 136 ms returned []
[2023-04-06 21:05:18] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:18] [INFO ] Invariant cache hit.
[2023-04-06 21:05:19] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3065 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-02 in 9604 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-04
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:19] [INFO ] Computed 25 invariants in 3 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-06 21:05:19] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:19] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 21:05:19] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:19] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:20] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-04-06 21:05:20] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:20] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:20] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:20] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-04-06 21:05:20] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:20] [INFO ] [Nat]Added 284 Read/Feed constraints in 34 ms returned sat
[2023-04-06 21:05:20] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 55 ms.
[2023-04-06 21:05:20] [INFO ] Added : 67 causal constraints over 14 iterations in 533 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 64 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:21] [INFO ] Computed 25 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2697 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 569 ms. (steps per millisecond=1757 ) properties (out of 1) seen :0
[2023-04-06 21:05:24] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:24] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 21:05:24] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:05:24] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:24] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-04-06 21:05:24] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:24] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2023-04-06 21:05:24] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:24] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-04-06 21:05:24] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:24] [INFO ] [Nat]Added 284 Read/Feed constraints in 40 ms returned sat
[2023-04-06 21:05:24] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 58 ms.
[2023-04-06 21:05:25] [INFO ] Added : 57 causal constraints over 12 iterations in 485 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 53 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 52 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-06 21:05:25] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:25] [INFO ] Invariant cache hit.
[2023-04-06 21:05:26] [INFO ] Implicit Places using invariants in 362 ms returned []
[2023-04-06 21:05:26] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:26] [INFO ] Invariant cache hit.
[2023-04-06 21:05:26] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:27] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2000 ms to find 0 implicit places.
[2023-04-06 21:05:27] [INFO ] Redundant transitions in 45 ms returned []
[2023-04-06 21:05:27] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:27] [INFO ] Invariant cache hit.
[2023-04-06 21:05:28] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2824 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-04 in 8700 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-08
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:28] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-06 21:05:28] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:28] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 21:05:28] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:28] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:28] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-04-06 21:05:28] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:28] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 2 ms returned sat
[2023-04-06 21:05:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:28] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-04-06 21:05:28] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:29] [INFO ] [Nat]Added 284 Read/Feed constraints in 36 ms returned sat
[2023-04-06 21:05:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2023-04-06 21:05:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 101 ms
[2023-04-06 21:05:29] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 55 ms.
[2023-04-06 21:05:29] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 0 ms to minimize.
[2023-04-06 21:05:29] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 0 ms to minimize.
[2023-04-06 21:05:30] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-04-06 21:05:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 374 ms
[2023-04-06 21:05:30] [INFO ] Added : 80 causal constraints over 17 iterations in 1043 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 396 transition count 2104
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 392 transition count 2104
Applied a total of 8 rules in 59 ms. Remains 392 /396 variables (removed 4) and now considering 2104/2108 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 392/396 places, 2104/2108 transitions.
Normalized transition count is 656 out of 2104 initially.
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:05:30] [INFO ] Computed 25 invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2768 ms. (steps per millisecond=361 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 588 ms. (steps per millisecond=1700 ) properties (out of 1) seen :0
[2023-04-06 21:05:33] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
// Phase 1: matrix 656 rows 392 cols
[2023-04-06 21:05:33] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 21:05:34] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:34] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-06 21:05:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:34] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-04-06 21:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:34] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:34] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:34] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-04-06 21:05:34] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:34] [INFO ] [Nat]Added 284 Read/Feed constraints in 38 ms returned sat
[2023-04-06 21:05:34] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2023-04-06 21:05:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-04-06 21:05:34] [INFO ] Computed and/alt/rep : 569/1392/401 causal constraints (skipped 247 transitions) in 54 ms.
[2023-04-06 21:05:34] [INFO ] Added : 47 causal constraints over 10 iterations in 412 ms. Result :sat
Minimization took 66 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 392 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 54 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 392/392 places, 2104/2104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 392/392 places, 2104/2104 transitions.
Applied a total of 0 rules in 53 ms. Remains 392 /392 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2023-04-06 21:05:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:05:35] [INFO ] Invariant cache hit.
[2023-04-06 21:05:35] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-04-06 21:05:35] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:05:35] [INFO ] Invariant cache hit.
[2023-04-06 21:05:35] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:37] [INFO ] Implicit Places using invariants and state equation in 1636 ms returned []
Implicit Place search using SMT with State Equation took 2006 ms to find 0 implicit places.
[2023-04-06 21:05:37] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-06 21:05:37] [INFO ] Flow matrix only has 656 transitions (discarded 1448 similar events)
[2023-04-06 21:05:37] [INFO ] Invariant cache hit.
[2023-04-06 21:05:38] [INFO ] Dead Transitions using invariants and state equation in 706 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2823 ms. Remains : 392/392 places, 2104/2104 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-08 in 9528 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-12
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:38] [INFO ] Computed 25 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 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-06 21:05:38] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:38] [INFO ] Computed 25 invariants in 3 ms
[2023-04-06 21:05:38] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:38] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:38] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-04-06 21:05:38] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:38] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-06 21:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:38] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-04-06 21:05:38] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:38] [INFO ] [Nat]Added 284 Read/Feed constraints in 34 ms returned sat
[2023-04-06 21:05:38] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2023-04-06 21:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-04-06 21:05:38] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 54 ms.
[2023-04-06 21:05:39] [INFO ] Deduced a trap composed of 39 places in 67 ms of which 0 ms to minimize.
[2023-04-06 21:05:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2023-04-06 21:05:39] [INFO ] Added : 40 causal constraints over 8 iterations in 512 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 59 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:39] [INFO ] Computed 25 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2693 ms. (steps per millisecond=371 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 584 ms. (steps per millisecond=1712 ) properties (out of 1) seen :0
[2023-04-06 21:05:42] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:42] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 21:05:42] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:42] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:42] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2023-04-06 21:05:42] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-06 21:05:43] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:43] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-04-06 21:05:43] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:43] [INFO ] [Nat]Added 284 Read/Feed constraints in 38 ms returned sat
[2023-04-06 21:05:43] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 56 ms.
[2023-04-06 21:05:43] [INFO ] Added : 44 causal constraints over 9 iterations in 385 ms. Result :sat
Minimization took 74 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 54 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 56 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-06 21:05:43] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:43] [INFO ] Invariant cache hit.
[2023-04-06 21:05:44] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-04-06 21:05:44] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:44] [INFO ] Invariant cache hit.
[2023-04-06 21:05:44] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:46] [INFO ] Implicit Places using invariants and state equation in 1752 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
[2023-04-06 21:05:46] [INFO ] Redundant transitions in 46 ms returned []
[2023-04-06 21:05:46] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:46] [INFO ] Invariant cache hit.
[2023-04-06 21:05:46] [INFO ] Dead Transitions using invariants and state equation in 743 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2970 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-12 in 8858 ms.
Starting property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-13
Normalized transition count is 660 out of 2108 initially.
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:46] [INFO ] Computed 25 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-04-06 21:05:46] [INFO ] Flow matrix only has 660 transitions (discarded 1448 similar events)
// Phase 1: matrix 660 rows 396 cols
[2023-04-06 21:05:46] [INFO ] Computed 25 invariants in 5 ms
[2023-04-06 21:05:46] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:46] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:47] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2023-04-06 21:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:47] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:47] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 8 ms returned sat
[2023-04-06 21:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:47] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2023-04-06 21:05:47] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:47] [INFO ] [Nat]Added 284 Read/Feed constraints in 35 ms returned sat
[2023-04-06 21:05:47] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2023-04-06 21:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-04-06 21:05:47] [INFO ] Computed and/alt/rep : 573/1396/405 causal constraints (skipped 247 transitions) in 55 ms.
[2023-04-06 21:05:48] [INFO ] Added : 70 causal constraints over 14 iterations in 561 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2108/2108 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 396 transition count 2105
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 393 transition count 2105
Applied a total of 6 rules in 62 ms. Remains 393 /396 variables (removed 3) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 393/396 places, 2105/2108 transitions.
Normalized transition count is 657 out of 2105 initially.
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:48] [INFO ] Computed 25 invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 2751 ms. (steps per millisecond=363 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 595 ms. (steps per millisecond=1680 ) properties (out of 1) seen :0
[2023-04-06 21:05:51] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
// Phase 1: matrix 657 rows 393 cols
[2023-04-06 21:05:51] [INFO ] Computed 25 invariants in 6 ms
[2023-04-06 21:05:51] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2023-04-06 21:05:51] [INFO ] [Real]Absence check using 17 positive and 8 generalized place invariants in 4 ms returned sat
[2023-04-06 21:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:51] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2023-04-06 21:05:51] [INFO ] Solution in real domain found non-integer solution.
[2023-04-06 21:05:51] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2023-04-06 21:05:52] [INFO ] [Nat]Absence check using 17 positive and 8 generalized place invariants in 3 ms returned sat
[2023-04-06 21:05:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-04-06 21:05:52] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-04-06 21:05:52] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:52] [INFO ] [Nat]Added 284 Read/Feed constraints in 38 ms returned sat
[2023-04-06 21:05:52] [INFO ] Computed and/alt/rep : 570/1393/402 causal constraints (skipped 247 transitions) in 53 ms.
[2023-04-06 21:05:52] [INFO ] Added : 62 causal constraints over 13 iterations in 519 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 53 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 393/393 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 2105/2105 transitions.
Applied a total of 0 rules in 53 ms. Remains 393 /393 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2023-04-06 21:05:53] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:53] [INFO ] Invariant cache hit.
[2023-04-06 21:05:53] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-04-06 21:05:53] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:53] [INFO ] Invariant cache hit.
[2023-04-06 21:05:53] [INFO ] State equation strengthened by 284 read => feed constraints.
[2023-04-06 21:05:55] [INFO ] Implicit Places using invariants and state equation in 1677 ms returned []
Implicit Place search using SMT with State Equation took 2056 ms to find 0 implicit places.
[2023-04-06 21:05:55] [INFO ] Redundant transitions in 49 ms returned []
[2023-04-06 21:05:55] [INFO ] Flow matrix only has 657 transitions (discarded 1448 similar events)
[2023-04-06 21:05:55] [INFO ] Invariant cache hit.
[2023-04-06 21:05:55] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2887 ms. Remains : 393/393 places, 2105/2105 transitions.
Ending property specific reduction for EisenbergMcGuire-PT-08-UpperBounds-13 in 9044 ms.
[2023-04-06 21:05:56] [INFO ] Flatten gal took : 168 ms
[2023-04-06 21:05:56] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-04-06 21:05:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 396 places, 2108 transitions and 11128 arcs took 12 ms.
Total runtime 96974 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running EisenbergMcGuire (PT), instance 08
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 396 places, 2108 transitions, 11128 arcs.
Final Score: 59499.303
Took : 28 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2834392 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107164 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is EisenbergMcGuire-PT-08, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r523-tall-167987247800261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-08.tgz
mv EisenbergMcGuire-PT-08 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;