About the Execution of 2023-gold for DBSingleClientW-PT-d2m07
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1181.991 | 66237.00 | 85294.00 | 862.40 | 0 0 0 0 1 0 0 0 0 0 0 5 0 1 0 1 | normal |
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.r109-tall-171624208400356.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 gold2023
Input is DBSingleClientW-PT-d2m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r109-tall-171624208400356
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Apr 12 12:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 12:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 12:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 DBSingleClientW-PT-d2m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716328490868
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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-21 21:54:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:54:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:54:52] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-05-21 21:54:52] [INFO ] Transformed 4763 places.
[2024-05-21 21:54:52] [INFO ] Transformed 2478 transitions.
[2024-05-21 21:54:52] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 21:54:52] [INFO ] Computed 6 invariants in 142 ms
Incomplete random walk after 10000 steps, including 2287 resets, run finished after 247 ms. (steps per millisecond=40 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 953 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 990 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 904 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 938 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :1
[2024-05-21 21:54:53] [INFO ] Invariant cache hit.
[2024-05-21 21:54:53] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2024-05-21 21:54:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 21:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:54:54] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2024-05-21 21:54:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:54:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2024-05-21 21:54:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:54:55] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2024-05-21 21:54:55] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 21:54:56] [INFO ] [Nat]Added 1588 Read/Feed constraints in 991 ms returned sat
[2024-05-21 21:54:57] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 646 ms.
[2024-05-21 21:54:58] [INFO ] Added : 16 causal constraints over 4 iterations in 1381 ms. Result :sat
Minimization took 1123 ms.
[2024-05-21 21:54:59] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2024-05-21 21:54:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:54:59] [INFO ] [Real]Absence check using state equation in 523 ms returned sat
[2024-05-21 21:55:00] [INFO ] [Real]Added 1588 Read/Feed constraints in 748 ms returned sat
[2024-05-21 21:55:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:55:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 21:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:01] [INFO ] [Nat]Absence check using state equation in 584 ms returned sat
[2024-05-21 21:55:02] [INFO ] [Nat]Added 1588 Read/Feed constraints in 664 ms returned sat
[2024-05-21 21:55:02] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 406 ms.
[2024-05-21 21:55:02] [INFO ] Added : 1 causal constraints over 1 iterations in 667 ms. Result :sat
Minimization took 498 ms.
[2024-05-21 21:55:03] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:55:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2024-05-21 21:55:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:04] [INFO ] [Real]Absence check using state equation in 685 ms returned sat
[2024-05-21 21:55:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 21:55:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 21:55:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:05] [INFO ] [Nat]Absence check using state equation in 684 ms returned sat
[2024-05-21 21:55:06] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1078 ms returned sat
[2024-05-21 21:55:06] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 347 ms.
[2024-05-21 21:55:07] [INFO ] Deduced a trap composed of 404 places in 538 ms of which 4 ms to minimize.
[2024-05-21 21:55:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 924 ms
[2024-05-21 21:55:08] [INFO ] Added : 15 causal constraints over 4 iterations in 1996 ms. Result :sat
Minimization took 761 ms.
[2024-05-21 21:55:09] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:55:09] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 21:55:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:09] [INFO ] [Real]Absence check using state equation in 641 ms returned sat
[2024-05-21 21:55:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 21:55:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 18 ms returned sat
[2024-05-21 21:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:10] [INFO ] [Nat]Absence check using state equation in 607 ms returned sat
[2024-05-21 21:55:11] [INFO ] [Nat]Added 1588 Read/Feed constraints in 764 ms returned sat
[2024-05-21 21:55:12] [INFO ] Deduced a trap composed of 226 places in 614 ms of which 2 ms to minimize.
[2024-05-21 21:55:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 754 ms
[2024-05-21 21:55:12] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 373 ms.
[2024-05-21 21:55:14] [INFO ] Deduced a trap composed of 141 places in 650 ms of which 2 ms to minimize.
[2024-05-21 21:55:14] [INFO ] Deduced a trap composed of 102 places in 636 ms of which 2 ms to minimize.
[2024-05-21 21:55:15] [INFO ] Deduced a trap composed of 252 places in 613 ms of which 2 ms to minimize.
[2024-05-21 21:55:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1258)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1180)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:926)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2623)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:754)
at fr.lip6.move.gal.application.Application.start(Application.java:182)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7] Max seen :[0, 3, 0, 0]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 607 place count 747 transition count 1202
Iterating global reduction 1 with 389 rules applied. Total rules applied 996 place count 747 transition count 1202
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1005 place count 747 transition count 1193
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1319 place count 433 transition count 879
Iterating global reduction 2 with 314 rules applied. Total rules applied 1633 place count 433 transition count 879
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1645 place count 433 transition count 867
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1884 place count 194 transition count 531
Iterating global reduction 3 with 239 rules applied. Total rules applied 2123 place count 194 transition count 531
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2334 place count 194 transition count 320
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2358 place count 170 transition count 281
Iterating global reduction 4 with 24 rules applied. Total rules applied 2382 place count 170 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2388 place count 170 transition count 275
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2404 place count 154 transition count 259
Iterating global reduction 5 with 16 rules applied. Total rules applied 2420 place count 154 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2424 place count 154 transition count 255
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2437 place count 141 transition count 242
Iterating global reduction 6 with 13 rules applied. Total rules applied 2450 place count 141 transition count 242
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2460 place count 141 transition count 232
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2463 place count 138 transition count 223
Iterating global reduction 7 with 3 rules applied. Total rules applied 2466 place count 138 transition count 223
Applied a total of 2466 rules in 242 ms. Remains 138 /1183 variables (removed 1045) and now considering 223/2478 (removed 2255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 138/1183 places, 223/2478 transitions.
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:55:16] [INFO ] Computed 2 invariants in 8 ms
Incomplete random walk after 1000000 steps, including 229890 resets, run finished after 1512 ms. (steps per millisecond=661 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95448 resets, run finished after 701 ms. (steps per millisecond=1426 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 96560 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 95827 resets, run finished after 669 ms. (steps per millisecond=1494 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95546 resets, run finished after 665 ms. (steps per millisecond=1503 ) properties (out of 4) seen :2
[2024-05-21 21:55:20] [INFO ] Invariant cache hit.
[2024-05-21 21:55:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:20] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 21:55:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:20] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:55:20] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:55:20] [INFO ] [Nat]Added 91 Read/Feed constraints in 28 ms returned sat
[2024-05-21 21:55:20] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 14 ms.
[2024-05-21 21:55:20] [INFO ] Added : 13 causal constraints over 4 iterations in 111 ms. Result :sat
Minimization took 39 ms.
[2024-05-21 21:55:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:20] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:55:20] [INFO ] [Real]Added 91 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:55:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:21] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-21 21:55:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:55:21] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 21:55:21] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 26 ms.
[2024-05-21 21:55:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:21] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:55:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:21] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:55:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:55:21] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 14 ms.
[2024-05-21 21:55:21] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-05-21 21:55:21] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-21 21:55:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 151 ms
[2024-05-21 21:55:21] [INFO ] Added : 19 causal constraints over 4 iterations in 243 ms. Result :sat
Minimization took 40 ms.
[2024-05-21 21:55:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:21] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:55:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:21] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-21 21:55:21] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:55:21] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 17 ms.
[2024-05-21 21:55:21] [INFO ] Added : 14 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7] Max seen :[0, 3, 0, 0]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 16 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 138/138 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Applied a total of 0 rules in 10 ms. Remains 138 /138 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-21 21:55:22] [INFO ] Invariant cache hit.
[2024-05-21 21:55:22] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 21:55:22] [INFO ] Invariant cache hit.
[2024-05-21 21:55:22] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:55:22] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-21 21:55:22] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-21 21:55:22] [INFO ] Invariant cache hit.
[2024-05-21 21:55:22] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 510 ms. Remains : 138/138 places, 223/223 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04
[2024-05-21 21:55:22] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 954 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-21 21:55:22] [INFO ] Invariant cache hit.
[2024-05-21 21:55:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:22] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:55:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:22] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:55:22] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:55:22] [INFO ] [Nat]Added 91 Read/Feed constraints in 24 ms returned sat
[2024-05-21 21:55:22] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 15 ms.
[2024-05-21 21:55:22] [INFO ] Added : 13 causal constraints over 4 iterations in 115 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 216
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 216
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 132 transition count 213
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 132 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 132 transition count 212
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 130 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 130 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 129 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 129 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 129 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 126 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 126 transition count 180
Applied a total of 28 rules in 23 ms. Remains 126 /138 variables (removed 12) and now considering 180/223 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 126/138 places, 180/223 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-21 21:55:22] [INFO ] Computed 2 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229873 resets, run finished after 1133 ms. (steps per millisecond=882 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95621 resets, run finished after 530 ms. (steps per millisecond=1886 ) properties (out of 1) seen :0
[2024-05-21 21:55:24] [INFO ] Invariant cache hit.
[2024-05-21 21:55:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:24] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 21:55:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:24] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:55:24] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:55:24] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 21:55:24] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2024-05-21 21:55:24] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-21 21:55:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2024-05-21 21:55:24] [INFO ] Added : 19 causal constraints over 4 iterations in 177 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 21:55:25] [INFO ] Invariant cache hit.
[2024-05-21 21:55:25] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 21:55:25] [INFO ] Invariant cache hit.
[2024-05-21 21:55:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:55:25] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2024-05-21 21:55:25] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-21 21:55:25] [INFO ] Invariant cache hit.
[2024-05-21 21:55:25] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 362 ms. Remains : 126/126 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-04 in 2887 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:55:25] [INFO ] Computed 2 invariants in 2 ms
Incomplete random walk after 10000 steps, including 2338 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10000 steps, including 960 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2024-05-21 21:55:25] [INFO ] Invariant cache hit.
[2024-05-21 21:55:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:25] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2024-05-21 21:55:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:25] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-05-21 21:55:25] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:55:25] [INFO ] [Nat]Added 91 Read/Feed constraints in 19 ms returned sat
[2024-05-21 21:55:25] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 12 ms.
[2024-05-21 21:55:25] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 135 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 135 transition count 220
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 132 transition count 213
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 132 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 132 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 129 transition count 201
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 129 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 129 transition count 200
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 127 transition count 192
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 127 transition count 192
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 126 transition count 191
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 126 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 32 place count 123 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 123 transition count 168
Applied a total of 35 rules in 23 ms. Remains 123 /138 variables (removed 15) and now considering 168/223 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 123/138 places, 168/223 transitions.
// Phase 1: matrix 168 rows 123 cols
[2024-05-21 21:55:25] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229586 resets, run finished after 1067 ms. (steps per millisecond=937 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96088 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 1) seen :4
[2024-05-21 21:55:27] [INFO ] Invariant cache hit.
[2024-05-21 21:55:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:27] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:55:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:27] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:55:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:55:27] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2024-05-21 21:55:27] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2024-05-21 21:55:27] [INFO ] Added : 1 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 11 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 21:55:27] [INFO ] Invariant cache hit.
[2024-05-21 21:55:27] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-21 21:55:27] [INFO ] Invariant cache hit.
[2024-05-21 21:55:27] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:55:27] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2024-05-21 21:55:27] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 21:55:27] [INFO ] Invariant cache hit.
[2024-05-21 21:55:27] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 123/123 places, 168/168 transitions.
[2024-05-21 21:55:27] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 230374 resets, run finished after 1051 ms. (steps per millisecond=951 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96730 resets, run finished after 496 ms. (steps per millisecond=2016 ) properties (out of 1) seen :4
[2024-05-21 21:55:29] [INFO ] Invariant cache hit.
[2024-05-21 21:55:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:29] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2024-05-21 21:55:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:29] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:55:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:55:29] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2024-05-21 21:55:29] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 9 ms.
[2024-05-21 21:55:29] [INFO ] Added : 1 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-21 21:55:29] [INFO ] Invariant cache hit.
[2024-05-21 21:55:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-21 21:55:29] [INFO ] Invariant cache hit.
[2024-05-21 21:55:29] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-21 21:55:29] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2024-05-21 21:55:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:55:29] [INFO ] Invariant cache hit.
[2024-05-21 21:55:30] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 406 ms. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11 in 4641 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-13
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:55:30] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2024-05-21 21:55:30] [INFO ] Invariant cache hit.
[2024-05-21 21:55:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:30] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 21:55:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:30] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 21:55:30] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:55:30] [INFO ] [Nat]Added 91 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:55:30] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 13 ms.
[2024-05-21 21:55:30] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-21 21:55:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:55:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2024-05-21 21:55:30] [INFO ] Added : 19 causal constraints over 4 iterations in 244 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 218
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 134 transition count 217
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 132 transition count 207
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 132 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 132 transition count 206
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 131 transition count 199
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 131 transition count 199
Applied a total of 16 rules in 25 ms. Remains 131 /138 variables (removed 7) and now considering 199/223 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 131/138 places, 199/223 transitions.
// Phase 1: matrix 199 rows 131 cols
[2024-05-21 21:55:30] [INFO ] Computed 2 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229703 resets, run finished after 1249 ms. (steps per millisecond=800 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 94943 resets, run finished after 571 ms. (steps per millisecond=1751 ) properties (out of 1) seen :0
[2024-05-21 21:55:32] [INFO ] Invariant cache hit.
[2024-05-21 21:55:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:32] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-21 21:55:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:32] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-21 21:55:32] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:55:32] [INFO ] [Nat]Added 73 Read/Feed constraints in 18 ms returned sat
[2024-05-21 21:55:32] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 15 ms.
[2024-05-21 21:55:32] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 21:55:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-05-21 21:55:32] [INFO ] Added : 11 causal constraints over 3 iterations in 147 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 8 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2024-05-21 21:55:32] [INFO ] Invariant cache hit.
[2024-05-21 21:55:32] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-21 21:55:32] [INFO ] Invariant cache hit.
[2024-05-21 21:55:33] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-05-21 21:55:33] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2024-05-21 21:55:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:55:33] [INFO ] Invariant cache hit.
[2024-05-21 21:55:33] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-13 in 3277 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15
// Phase 1: matrix 223 rows 138 cols
[2024-05-21 21:55:33] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2024-05-21 21:55:33] [INFO ] Invariant cache hit.
[2024-05-21 21:55:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:33] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 21:55:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 21:55:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:33] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 21:55:33] [INFO ] State equation strengthened by 91 read => feed constraints.
[2024-05-21 21:55:33] [INFO ] [Nat]Added 91 Read/Feed constraints in 17 ms returned sat
[2024-05-21 21:55:33] [INFO ] Computed and/alt/rep : 53/130/53 causal constraints (skipped 169 transitions) in 12 ms.
[2024-05-21 21:55:33] [INFO ] Added : 14 causal constraints over 3 iterations in 65 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 223/223 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 136 transition count 221
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 136 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 134 transition count 215
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 134 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 134 transition count 214
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 132 transition count 205
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 132 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 131 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 131 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 130 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 130 transition count 203
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 130 transition count 200
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 23 place count 127 transition count 180
Iterating global reduction 2 with 3 rules applied. Total rules applied 26 place count 127 transition count 180
Applied a total of 26 rules in 14 ms. Remains 127 /138 variables (removed 11) and now considering 180/223 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 127/138 places, 180/223 transitions.
// Phase 1: matrix 180 rows 127 cols
[2024-05-21 21:55:33] [INFO ] Computed 2 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229861 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95586 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :0
[2024-05-21 21:55:35] [INFO ] Invariant cache hit.
[2024-05-21 21:55:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:35] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 21:55:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 21:55:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 21:55:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-21 21:55:35] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 21:55:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:55:35] [INFO ] [Nat]Added 58 Read/Feed constraints in 11 ms returned sat
[2024-05-21 21:55:35] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 11 ms.
[2024-05-21 21:55:35] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-21 21:55:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-21 21:55:35] [INFO ] Added : 15 causal constraints over 4 iterations in 137 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 21:55:35] [INFO ] Invariant cache hit.
[2024-05-21 21:55:35] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-21 21:55:35] [INFO ] Invariant cache hit.
[2024-05-21 21:55:35] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 21:55:36] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2024-05-21 21:55:36] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-21 21:55:36] [INFO ] Invariant cache hit.
[2024-05-21 21:55:36] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-15 in 2787 ms.
[2024-05-21 21:55:36] [INFO ] Flatten gal took : 44 ms
[2024-05-21 21:55:36] [INFO ] Applying decomposition
[2024-05-21 21:55:36] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8847739538410128063.txt' '-o' '/tmp/graph8847739538410128063.bin' '-w' '/tmp/graph8847739538410128063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8847739538410128063.bin' '-l' '-1' '-v' '-w' '/tmp/graph8847739538410128063.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:55:36] [INFO ] Decomposing Gal with order
[2024-05-21 21:55:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:55:36] [INFO ] Removed a total of 276 redundant transitions.
[2024-05-21 21:55:36] [INFO ] Flatten gal took : 51 ms
[2024-05-21 21:55:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 109 labels/synchronizations in 10 ms.
[2024-05-21 21:55:36] [INFO ] Time to serialize gal into /tmp/UpperBounds13688239641231221858.gal : 5 ms
[2024-05-21 21:55:36] [INFO ] Time to serialize properties into /tmp/UpperBounds7516377733340821243.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds13688239641231221858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7516377733340821243.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds7516377733340821243.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.32013e+07,17.1999,485740,4357,2694,542169,125999,615,2.81709e+06,183,819781,0
Total reachable state count : 13201298
Verifying 4 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-04 :0 <= i2.u20.p68 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-04 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m07-UpperBounds-04,0,17.7121,486000,1,0,542169,125999,768,2.81709e+06,218,819781,2984
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-11 :0 <= i5.u22.l3686 <= 5
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-11 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m07-UpperBounds-11,0,17.9174,486000,1,0,542169,125999,801,2.81709e+06,229,819781,4599
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-13 :0 <= i2.u12.p301 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m07-UpperBounds-13,0,17.9177,486000,1,0,542169,125999,819,2.81709e+06,240,819781,4628
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m07-UpperBounds-15 :0 <= i3.u13.l2872 <= 1
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m07-UpperBounds-15,0,17.9192,486000,1,0,542169,125999,844,2.81709e+06,240,819781,5228
Total runtime 62258 ms.
BK_STOP 1716328557105
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DBSingleClientW-PT-d2m07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is DBSingleClientW-PT-d2m07, 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 r109-tall-171624208400356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m07.tgz
mv DBSingleClientW-PT-d2m07 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 '
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 ;