Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r201-smll-171649586900261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is HypercubeGrid-PT-C3K4P4B12, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586900261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 16:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 16:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rwxr-xr-x 1 mcc users 1.3M May 18 16:42 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 HypercubeGrid-PT-C3K4P4B12-UpperBounds-00
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-01
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-02
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-03
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-04
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-05
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-06
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-07
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-08
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-09
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-10
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-11
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-12
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-13
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-14
FORMULA_NAME HypercubeGrid-PT-C3K4P4B12-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716741776070

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HypercubeGrid-PT-C3K4P4B12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 16:42:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-26 16:42:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 16:42:58] [INFO ] Load time of PNML (sax parser for PT used): 509 ms
[2024-05-26 16:42:58] [INFO ] Transformed 1408 places.
[2024-05-26 16:42:59] [INFO ] Transformed 2400 transitions.
[2024-05-26 16:42:59] [INFO ] Parsed PT model containing 1408 places and 2400 transitions and 9600 arcs in 843 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Current structural bounds on expressions (Initially) : Max Seen:[4, 12, 4, 1, 0, 0, 0, 1, 0, 1, 1, 4, 0, 1, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[4, 12, 4, 1, 0, 0, 0, 1, 0, 1, 1, 4, 0, 1, 4, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 2400 rows 1408 cols
[2024-05-26 16:42:59] [INFO ] Computed 545 invariants in 232 ms
Current structural bounds on expressions (after invariants) : Max Seen:[4, 12, 4, 1, 0, 0, 0, 1, 0, 1, 1, 4, 0, 1, 4, 0] Max Struct:[36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 36, 1, 1, 36, 1]
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (2 resets) in 1584 ms. (6 steps per ms)
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50005 steps (10 resets) in 1425 ms. (35 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 23, 6, 7, 6] Max Struct:[36, 36, 36, 36, 36]
[2024-05-26 16:43:02] [INFO ] Invariant cache hit.
[2024-05-26 16:43:03] [INFO ] [Real]Absence check using 544 positive place invariants in 283 ms returned sat
[2024-05-26 16:43:03] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 60 ms returned sat
[2024-05-26 16:43:05] [INFO ] [Real]Absence check using state equation in 1499 ms returned sat
[2024-05-26 16:43:05] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 340 ms.
1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
[2024-05-26 16:43:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 16:43:08] [INFO ] [Nat]Absence check using 544 positive place invariants in 258 ms returned sat
[2024-05-26 16:43:08] [INFO ] [Nat]Absence check using 544 positive and 1 generalized place invariants in 53 ms returned sat
[2024-05-26 16:43:09] [INFO ] [Nat]Absence check using state equation in 1484 ms returned sat
[2024-05-26 16:43:10] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 319 ms.
Maximisation of solution failed !
Minimization took 1 ms.
[2024-05-26 16:43:13] [INFO ] [Real]Absence check using 544 positive place invariants in 258 ms returned sat
[2024-05-26 16:43:13] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 57 ms returned sat
[2024-05-26 16:43:14] [INFO ] [Real]Absence check using state equation in 1352 ms returned sat
[2024-05-26 16:43:15] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 294 ms.
[2024-05-26 16:43: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: 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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 16:43:18] [INFO ] [Real]Absence check using 544 positive place invariants in 267 ms returned sat
[2024-05-26 16:43:18] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 74 ms returned sat
[2024-05-26 16:43:19] [INFO ] [Real]Absence check using state equation in 1358 ms returned sat
[2024-05-26 16:43:20] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 232 ms.
[2024-05-26 16:43:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 16:43:23] [INFO ] [Nat]Absence check using 544 positive place invariants in 217 ms returned sat
[2024-05-26 16:43:23] [INFO ] [Nat]Absence check using 544 positive and 1 generalized place invariants in 33 ms returned sat
[2024-05-26 16:43:24] [INFO ] [Nat]Absence check using state equation in 1319 ms returned sat
[2024-05-26 16:43:25] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 318 ms.
[2024-05-26 16:43:27] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-26 16:43:28] [INFO ] [Real]Absence check using 544 positive place invariants in 241 ms returned sat
[2024-05-26 16:43:28] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 56 ms returned sat
[2024-05-26 16:43:29] [INFO ] [Real]Absence check using state equation in 1288 ms returned sat
[2024-05-26 16:43:30] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 169 ms.
[2024-05-26 16:43:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-26 16:43:33] [INFO ] [Nat]Absence check using 544 positive place invariants in 225 ms returned sat
[2024-05-26 16:43:33] [INFO ] [Nat]Absence check using 544 positive and 1 generalized place invariants in 58 ms returned sat
[2024-05-26 16:43:34] [INFO ] [Nat]Absence check using state equation in 1122 ms returned sat
[2024-05-26 16:43:35] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 163 ms.
Maximisation of solution failed !
Minimization took 0 ms.
[2024-05-26 16:43:38] [INFO ] [Real]Absence check using 544 positive place invariants in 189 ms returned sat
[2024-05-26 16:43:38] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 53 ms returned sat
[2024-05-26 16:43:39] [INFO ] [Real]Absence check using state equation in 1177 ms returned sat
[2024-05-26 16:43:40] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 226 ms.
[2024-05-26 16:43:43] [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:299)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1137)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2249)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[4, 23, 6, 7, 6] Max Struct:[36, 36, 36, 36, 36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4, 23, 6, 7, 6] Max Struct:[36, 36, 36, 36, 36]
Support contains 5 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 565 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 1408/1408 places, 2400/2400 transitions.
[2024-05-26 16:43:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4, 23, 6, 7, 6] Max Struct:[36, 36, 36, 36, 36]
RANDOM walk for 322422 steps (4 resets) in 30001 ms. (10 steps per ms)
BEST_FIRST walk for 1242946 steps (0 resets) in 25052 ms. (49 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 31, 10, 11, 17] Max Struct:[36, 36, 36, 36, 36]
[2024-05-26 16:44:38] [INFO ] Invariant cache hit.
[2024-05-26 16:44:39] [INFO ] [Real]Absence check using 544 positive place invariants in 238 ms returned sat
[2024-05-26 16:44:39] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 41 ms returned sat
[2024-05-26 16:44:40] [INFO ] [Real]Absence check using state equation in 1374 ms returned sat
[2024-05-26 16:44:41] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 238 ms.
[2024-05-26 16:45:01] [INFO ] Added : 427 causal constraints over 86 iterations in 20130 ms. Result :sat
Minimization took 4507 ms.
[2024-05-26 16:45:06] [INFO ] [Real]Absence check using 544 positive place invariants in 206 ms returned sat
[2024-05-26 16:45:06] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 56 ms returned sat
[2024-05-26 16:45:07] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2024-05-26 16:45:08] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 220 ms.
[2024-05-26 16:45:22] [INFO ] Added : 443 causal constraints over 89 iterations in 15059 ms. Result :sat
Minimization took 4749 ms.
[2024-05-26 16:45:28] [INFO ] [Real]Absence check using 544 positive place invariants in 222 ms returned sat
[2024-05-26 16:45:28] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 54 ms returned sat
[2024-05-26 16:45:29] [INFO ] [Real]Absence check using state equation in 1314 ms returned sat
[2024-05-26 16:45:30] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 241 ms.
[2024-05-26 16:45:49] [INFO ] Added : 395 causal constraints over 79 iterations in 20011 ms.(timeout) Result :sat
Minimization took 4522 ms.
[2024-05-26 16:45:55] [INFO ] [Real]Absence check using 544 positive place invariants in 174 ms returned sat
[2024-05-26 16:45:55] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 35 ms returned sat
[2024-05-26 16:45:56] [INFO ] [Real]Absence check using state equation in 1127 ms returned sat
[2024-05-26 16:45:56] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 240 ms.
[2024-05-26 16:46:16] [INFO ] Added : 405 causal constraints over 81 iterations in 20100 ms.(timeout) Result :sat
Minimization took 4744 ms.
[2024-05-26 16:46:22] [INFO ] [Real]Absence check using 544 positive place invariants in 250 ms returned sat
[2024-05-26 16:46:22] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 61 ms returned sat
[2024-05-26 16:46:23] [INFO ] [Real]Absence check using state equation in 1359 ms returned sat
[2024-05-26 16:46:23] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 265 ms.
[2024-05-26 16:46:43] [INFO ] Added : 445 causal constraints over 89 iterations in 20198 ms.(timeout) Result :sat
Minimization took 4733 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[9, 31, 10, 11, 17] Max Struct:[36, 36, 36, 36, 36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 31, 10, 11, 17] Max Struct:[36, 36, 36, 36, 36]
Support contains 5 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 324 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 324 ms. Remains : 1408/1408 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 127 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-26 16:46:49] [INFO ] Invariant cache hit.
[2024-05-26 16:46:51] [INFO ] Implicit Places using invariants in 2649 ms returned []
[2024-05-26 16:46:51] [INFO ] Invariant cache hit.
[2024-05-26 16:46:56] [INFO ] Implicit Places using invariants and state equation in 4616 ms returned []
Implicit Place search using SMT with State Equation took 7270 ms to find 0 implicit places.
[2024-05-26 16:46:56] [INFO ] Redundant transitions in 277 ms returned []
Running 2016 sub problems to find dead transitions.
[2024-05-26 16:46:57] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 0.0)
(s689 0.0)
(s690 0.0)
(s691 0.0)
(s692 0.0)
(s693 0.0)
(s694 0.0)
(s695 0.0)
(s696 0.0)
(s697 0.0)
(s698 0.0)
(s699 0.0)
(s700 0.0)
(s701 0.0)
(s702 0.0)
(s703 0.0)
(s768 0.0)
(s769 0.0)
(s770 0.0)
(s771 0.0)
(s788 0.0)
(s789 0.0)
(s790 0.0)
(s791 0.0)
(s808 0.0)
(s809 0.0)
(s810 0.0)
(s811 0.0)
(s828 0.0)
(s829 0.0)
(s830 0.0)
(s831 0.0)
(s848 0.0)
(s853 0.0)
(s858 0.0)
(s863 0.0)
(s868 0.0)
(s873 0.0)
(s878 0.0)
(s883 0.0)
(s888 0.0)
(s893 0.0)
(s898 0.0)
(s903 0.0)
(s908 0.0)
(s913 0.0)
(s918 0.0)
(s923 0.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 0.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 0.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 0.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 0.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 0.0)
(s1113 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/3808 variables, and 96 constraints, problems are : Problem set: 0 solved, 2016 unsolved in 30150 ms.
Refiners :[Positive P Invariants (semi-flows): 96/544 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1408 constraints, PredecessorRefiner: 2016/2016 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2016 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/3808 variables, and 96 constraints, problems are : Problem set: 0 solved, 2016 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 96/544 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1408 constraints, PredecessorRefiner: 0/2016 constraints, Known Traps: 0/0 constraints]
After SMT, in 62787ms problems are : Problem set: 0 solved, 2016 unsolved
Search for dead transitions found 0 dead transitions in 62873ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70607 ms. Remains : 1408/1408 places, 2400/2400 transitions.
[2024-05-26 16:47:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[9, 31, 10, 11, 17] Max Struct:[36, 36, 36, 36, 36]
RANDOM walk for 327801 steps (4 resets) in 30001 ms. (10 steps per ms)
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-01 36 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1033146 steps (0 resets) in 20025 ms. (51 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 11, 11, 17] Max Struct:[36, 36, 36, 36]
[2024-05-26 16:48:49] [INFO ] Invariant cache hit.
[2024-05-26 16:48:50] [INFO ] [Real]Absence check using 544 positive place invariants in 161 ms returned sat
[2024-05-26 16:48:50] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 59 ms returned sat
[2024-05-26 16:48:51] [INFO ] [Real]Absence check using state equation in 1548 ms returned sat
[2024-05-26 16:48:52] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 217 ms.
[2024-05-26 16:49:12] [INFO ] Added : 405 causal constraints over 81 iterations in 20100 ms.(timeout) Result :sat
Minimization took 4645 ms.
[2024-05-26 16:49:17] [INFO ] [Real]Absence check using 544 positive place invariants in 216 ms returned sat
[2024-05-26 16:49:17] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 59 ms returned sat
[2024-05-26 16:49:18] [INFO ] [Real]Absence check using state equation in 1238 ms returned sat
[2024-05-26 16:49:19] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 142 ms.
[2024-05-26 16:49:37] [INFO ] Added : 443 causal constraints over 89 iterations in 18971 ms. Result :sat
Minimization took 4595 ms.
[2024-05-26 16:49:43] [INFO ] [Real]Absence check using 544 positive place invariants in 149 ms returned sat
[2024-05-26 16:49:43] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 36 ms returned sat
[2024-05-26 16:49:44] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2024-05-26 16:49:44] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 374 ms.
[2024-05-26 16:50:04] [INFO ] Added : 440 causal constraints over 88 iterations in 20017 ms.(timeout) Result :sat
Minimization took 4513 ms.
[2024-05-26 16:50:09] [INFO ] [Real]Absence check using 544 positive place invariants in 259 ms returned sat
[2024-05-26 16:50:09] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 54 ms returned sat
[2024-05-26 16:50:10] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2024-05-26 16:50:11] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 163 ms.
[2024-05-26 16:50:31] [INFO ] Added : 440 causal constraints over 88 iterations in 20180 ms.(timeout) Result :sat
Minimization took 4513 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 11, 11, 17] Max Struct:[36, 36, 36, 36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 11, 11, 17] Max Struct:[36, 36, 36, 36]
Support contains 4 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 100 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 1408/1408 places, 2400/2400 transitions.
[2024-05-26 16:50:36] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[17, 11, 11, 17] Max Struct:[36, 36, 36, 36]
RANDOM walk for 351203 steps (5 resets) in 30001 ms. (11 steps per ms)
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-11 36 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 778753 steps (0 resets) in 15023 ms. (51 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 11, 17] Max Struct:[36, 36, 36]
[2024-05-26 16:51:21] [INFO ] Invariant cache hit.
[2024-05-26 16:51:21] [INFO ] [Real]Absence check using 544 positive place invariants in 230 ms returned sat
[2024-05-26 16:51:21] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 55 ms returned sat
[2024-05-26 16:51:22] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2024-05-26 16:51:23] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 165 ms.
[2024-05-26 16:51:43] [INFO ] Added : 410 causal constraints over 82 iterations in 20182 ms.(timeout) Result :sat
Minimization took 4661 ms.
[2024-05-26 16:51:48] [INFO ] [Real]Absence check using 544 positive place invariants in 156 ms returned sat
[2024-05-26 16:51:48] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 34 ms returned sat
[2024-05-26 16:51:49] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2024-05-26 16:51:50] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 234 ms.
[2024-05-26 16:52:07] [INFO ] Added : 443 causal constraints over 89 iterations in 17737 ms. Result :sat
Minimization took 4666 ms.
[2024-05-26 16:52:12] [INFO ] [Real]Absence check using 544 positive place invariants in 193 ms returned sat
[2024-05-26 16:52:12] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 60 ms returned sat
[2024-05-26 16:52:14] [INFO ] [Real]Absence check using state equation in 1190 ms returned sat
[2024-05-26 16:52:14] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 255 ms.
[2024-05-26 16:52:33] [INFO ] Added : 452 causal constraints over 91 iterations in 18801 ms. Result :sat
Minimization took 4624 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 11, 17] Max Struct:[36, 36, 36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 11, 17] Max Struct:[36, 36, 36]
Support contains 3 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 77 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 1408/1408 places, 2400/2400 transitions.
[2024-05-26 16:52:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[17, 11, 17] Max Struct:[36, 36, 36]
RANDOM walk for 341852 steps (5 resets) in 30001 ms. (11 steps per ms)
BEST_FIRST walk for 801844 steps (0 resets) in 15017 ms. (53 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[17, 11, 17] Max Struct:[36, 36, 36]
[2024-05-26 16:53:22] [INFO ] Invariant cache hit.
[2024-05-26 16:53:23] [INFO ] [Real]Absence check using 544 positive place invariants in 235 ms returned sat
[2024-05-26 16:53:23] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 62 ms returned sat
[2024-05-26 16:53:24] [INFO ] [Real]Absence check using state equation in 1400 ms returned sat
[2024-05-26 16:53:25] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 188 ms.
[2024-05-26 16:53:43] [INFO ] Added : 421 causal constraints over 85 iterations in 18791 ms. Result :sat
Minimization took 4503 ms.
[2024-05-26 16:53:48] [INFO ] [Real]Absence check using 544 positive place invariants in 151 ms returned sat
[2024-05-26 16:53:48] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 35 ms returned sat
[2024-05-26 16:53:50] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2024-05-26 16:53:50] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 258 ms.
[2024-05-26 16:54:09] [INFO ] Added : 443 causal constraints over 89 iterations in 19120 ms. Result :sat
Minimization took 4602 ms.
[2024-05-26 16:54:14] [INFO ] [Real]Absence check using 544 positive place invariants in 232 ms returned sat
[2024-05-26 16:54:14] [INFO ] [Real]Absence check using 544 positive and 1 generalized place invariants in 37 ms returned sat
[2024-05-26 16:54:15] [INFO ] [Real]Absence check using state equation in 1103 ms returned sat
[2024-05-26 16:54:16] [INFO ] Computed and/alt/rep : 2016/2016/2016 causal constraints (skipped 0 transitions) in 235 ms.
[2024-05-26 16:54:36] [INFO ] Added : 410 causal constraints over 82 iterations in 20237 ms.(timeout) Result :sat
Minimization took 4511 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[17, 11, 17] Max Struct:[36, 36, 36]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[17, 11, 17] Max Struct:[36, 36, 36]
Support contains 3 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 72 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1408/1408 places, 2400/2400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 64 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
[2024-05-26 16:54:41] [INFO ] Invariant cache hit.
[2024-05-26 16:54:44] [INFO ] Implicit Places using invariants in 2879 ms returned []
[2024-05-26 16:54:44] [INFO ] Invariant cache hit.
[2024-05-26 16:54:47] [INFO ] Implicit Places using invariants and state equation in 3703 ms returned []
Implicit Place search using SMT with State Equation took 6585 ms to find 0 implicit places.
[2024-05-26 16:54:47] [INFO ] Redundant transitions in 79 ms returned []
Running 2016 sub problems to find dead transitions.
[2024-05-26 16:54:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 640/3808 variables, and 96 constraints, problems are : Problem set: 0 solved, 2016 unsolved in 30064 ms.
Refiners :[Positive P Invariants (semi-flows): 96/544 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1408 constraints, PredecessorRefiner: 2016/2016 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2016 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/640 variables, 96/96 constraints. Problems are: Problem set: 0 solved, 2016 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 640/3808 variables, and 96 constraints, problems are : Problem set: 0 solved, 2016 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 96/544 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/1408 constraints, PredecessorRefiner: 0/2016 constraints, Known Traps: 0/0 constraints]
After SMT, in 61856ms problems are : Problem set: 0 solved, 2016 unsolved
Search for dead transitions found 0 dead transitions in 61880ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68635 ms. Remains : 1408/1408 places, 2400/2400 transitions.
RANDOM walk for 40000 steps (8 resets) in 7081 ms. (5 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 947 ms. (42 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1148 ms. (34 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1184 ms. (33 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1343 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1077 ms. (37 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1117 ms. (35 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 189021 steps, run timeout after 9028 ms. (steps per millisecond=20 ) properties seen :0 out of 6
Probabilistic random walk after 189021 steps, saw 188642 distinct states, run finished after 9038 ms. (steps per millisecond=20 ) properties seen :0
[2024-05-26 16:56:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 541/562 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 840/1402 variables, 540/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/1408 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1408 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2400/3808 variables, 1408/1953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3808 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/3808 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3808/3808 variables, and 1953 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4184 ms.
Refiners :[Positive P Invariants (semi-flows): 544/544 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1408/1408 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 18/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 541/562 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 840/1402 variables, 540/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 6/1408 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1408 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2400/3808 variables, 1408/1953 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3808 variables, 6/1959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3808 variables, 0/1959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 0/3808 variables, 0/1959 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3808/3808 variables, and 1959 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4159 ms.
Refiners :[Positive P Invariants (semi-flows): 544/544 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1408/1408 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 8370ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 4 properties in 42284 ms.
Support contains 2 out of 1408 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1408/1408 places, 2400/2400 transitions.
Applied a total of 0 rules in 65 ms. Remains 1408 /1408 variables (removed 0) and now considering 2400/2400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1408/1408 places, 2400/2400 transitions.
RANDOM walk for 40000 steps (8 resets) in 6104 ms. (6 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 974 ms. (41 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1044 ms. (38 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 160195 steps, run timeout after 6015 ms. (steps per millisecond=26 ) properties seen :0 out of 2
Probabilistic random walk after 160195 steps, saw 159874 distinct states, run finished after 6018 ms. (steps per millisecond=26 ) properties seen :0
[2024-05-26 16:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 542/556 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 846/1402 variables, 541/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/1408 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1408 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2400/3808 variables, 1408/1953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3808 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/3808 variables, 0/1953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3808/3808 variables, and 1953 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2226 ms.
Refiners :[Positive P Invariants (semi-flows): 544/544 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1408/1408 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/14 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 542/556 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 846/1402 variables, 541/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1402 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 6/1408 variables, 1/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1408 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2400/3808 variables, 1408/1953 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3808 variables, 2/1955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3808 variables, 0/1955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/3808 variables, 0/1955 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3808/3808 variables, and 1955 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2595 ms.
Refiners :[Positive P Invariants (semi-flows): 544/544 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 1408/1408 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 4844ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 14926 steps, including 3 resets, run visited all 2 properties in 1194 ms. (steps per millisecond=12 )
Parikh walk visited 2 properties in 1213 ms.
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-14 36 TECHNIQUES REACHABILITY_MAX
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-02 36 TECHNIQUES REACHABILITY_MAX
FORMULA HypercubeGrid-PT-C3K4P4B12-UpperBounds-00 36 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 849614 ms.
ITS solved all properties within timeout

BK_STOP 1716742627828

--------------------
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.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="HypercubeGrid-PT-C3K4P4B12"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is HypercubeGrid-PT-C3K4P4B12, 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 r201-smll-171649586900261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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