Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r107-tall-167814484000301.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is DBSingleClientW-PT-d2m05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-tall-167814484000301
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 15:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 15:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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-d2m05-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678358395917

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m05
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 10:39:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 10:39:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 10:39:57] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-09 10:39:57] [INFO ] Transformed 4763 places.
[2023-03-09 10:39:57] [INFO ] Transformed 2478 transitions.
[2023-03-09 10:39:57] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 250 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-d2m05-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-09 10:39:57] [INFO ] Computed 6 place invariants in 137 ms
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 263 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 941 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 858 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :0
[2023-03-09 10:39:58] [INFO ] Invariant cache hit.
[2023-03-09 10:39:58] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-09 10:39:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 10:39:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:39:59] [INFO ] [Real]Absence check using state equation in 686 ms returned sat
[2023-03-09 10:39:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:39:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-09 10:39:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 10:39:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:00] [INFO ] [Nat]Absence check using state equation in 692 ms returned sat
[2023-03-09 10:40:00] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-09 10:40:01] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1025 ms returned sat
[2023-03-09 10:40:02] [INFO ] Deduced a trap composed of 75 places in 730 ms of which 6 ms to minimize.
[2023-03-09 10:40:03] [INFO ] Deduced a trap composed of 56 places in 687 ms of which 3 ms to minimize.
[2023-03-09 10:40:03] [INFO ] Deduced a trap composed of 194 places in 607 ms of which 7 ms to minimize.
[2023-03-09 10:40:04] [INFO ] Deduced a trap composed of 239 places in 582 ms of which 1 ms to minimize.
[2023-03-09 10:40:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 10:40:04] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 10:40:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 10:40:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:05] [INFO ] [Real]Absence check using state equation in 738 ms returned sat
[2023-03-09 10:40:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-09 10:40:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-09 10:40:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:06] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2023-03-09 10:40:07] [INFO ] [Nat]Added 1588 Read/Feed constraints in 963 ms returned sat
[2023-03-09 10:40:08] [INFO ] Deduced a trap composed of 76 places in 693 ms of which 2 ms to minimize.
[2023-03-09 10:40:08] [INFO ] Deduced a trap composed of 56 places in 673 ms of which 2 ms to minimize.
[2023-03-09 10:40:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1690 ms
[2023-03-09 10:40:09] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 592 ms.
[2023-03-09 10:40:10] [INFO ] Added : 13 causal constraints over 3 iterations in 1507 ms. Result :unknown
[2023-03-09 10:40:10] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 10:40:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 10:40:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:11] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2023-03-09 10:40:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2023-03-09 10:40:11] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 10:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:12] [INFO ] [Nat]Absence check using state equation in 580 ms returned sat
[2023-03-09 10:40:13] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1050 ms returned sat
[2023-03-09 10:40:13] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 630 ms.
[2023-03-09 10:40:14] [INFO ] Added : 10 causal constraints over 3 iterations in 1324 ms. Result :sat
Minimization took 856 ms.
Current structural bounds on expressions (after SMT) : [1944, 1944, 7] Max seen :[0, 0, 0]
Support contains 3 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 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 609 place count 745 transition count 1200
Iterating global reduction 1 with 391 rules applied. Total rules applied 1000 place count 745 transition count 1200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1009 place count 745 transition count 1191
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1324 place count 430 transition count 876
Iterating global reduction 2 with 315 rules applied. Total rules applied 1639 place count 430 transition count 876
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1651 place count 430 transition count 864
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1890 place count 191 transition count 524
Iterating global reduction 3 with 239 rules applied. Total rules applied 2129 place count 191 transition count 524
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2339 place count 191 transition count 314
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2364 place count 166 transition count 274
Iterating global reduction 4 with 25 rules applied. Total rules applied 2389 place count 166 transition count 274
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2395 place count 166 transition count 268
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2412 place count 149 transition count 251
Iterating global reduction 5 with 17 rules applied. Total rules applied 2429 place count 149 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2433 place count 149 transition count 247
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2447 place count 135 transition count 233
Iterating global reduction 6 with 14 rules applied. Total rules applied 2461 place count 135 transition count 233
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2474 place count 135 transition count 220
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2480 place count 129 transition count 191
Iterating global reduction 7 with 6 rules applied. Total rules applied 2486 place count 129 transition count 191
Applied a total of 2486 rules in 234 ms. Remains 129 /1183 variables (removed 1054) and now considering 191/2478 (removed 2287) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 129/1183 places, 191/2478 transitions.
// Phase 1: matrix 191 rows 129 cols
[2023-03-09 10:40:15] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 230100 resets, run finished after 1202 ms. (steps per millisecond=831 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95190 resets, run finished after 550 ms. (steps per millisecond=1818 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95882 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95325 resets, run finished after 536 ms. (steps per millisecond=1865 ) properties (out of 3) seen :0
[2023-03-09 10:40:18] [INFO ] Invariant cache hit.
[2023-03-09 10:40:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:18] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 10:40:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:19] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2023-03-09 10:40:19] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-09 10:40:19] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2023-03-09 10:40:19] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 18 ms.
[2023-03-09 10:40:19] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 0 ms to minimize.
[2023-03-09 10:40:19] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2023-03-09 10:40:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2023-03-09 10:40:19] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-09 10:40:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 315 ms
[2023-03-09 10:40:19] [INFO ] Added : 20 causal constraints over 5 iterations in 425 ms. Result :sat
Minimization took 39 ms.
[2023-03-09 10:40:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:19] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2023-03-09 10:40:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:19] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-09 10:40:19] [INFO ] [Nat]Added 67 Read/Feed constraints in 24 ms returned sat
[2023-03-09 10:40:19] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 15 ms.
[2023-03-09 10:40:19] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2023-03-09 10:40:19] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-09 10:40:19] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2023-03-09 10:40:20] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2023-03-09 10:40:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 306 ms
[2023-03-09 10:40:20] [INFO ] Added : 19 causal constraints over 5 iterations in 408 ms. Result :sat
Minimization took 41 ms.
[2023-03-09 10:40:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:20] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-09 10:40:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:20] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-09 10:40:20] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2023-03-09 10:40:20] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 12 ms.
[2023-03-09 10:40:20] [INFO ] Added : 11 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [1944, 1944, 7] Max seen :[0, 0, 0]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 191/191 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 191/191 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 129/129 places, 191/191 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 191/191 transitions.
Applied a total of 0 rules in 8 ms. Remains 129 /129 variables (removed 0) and now considering 191/191 (removed 0) transitions.
[2023-03-09 10:40:20] [INFO ] Invariant cache hit.
[2023-03-09 10:40:20] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-09 10:40:20] [INFO ] Invariant cache hit.
[2023-03-09 10:40:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-09 10:40:20] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-09 10:40:20] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 10:40:20] [INFO ] Invariant cache hit.
[2023-03-09 10:40:20] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 129/129 places, 191/191 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-00
[2023-03-09 10:40:20] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2291 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 10:40:20] [INFO ] Invariant cache hit.
[2023-03-09 10:40:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:21] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-09 10:40:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:21] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-09 10:40:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-09 10:40:21] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2023-03-09 10:40:21] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 11 ms.
[2023-03-09 10:40:21] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 0 ms to minimize.
[2023-03-09 10:40:21] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-09 10:40:21] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2023-03-09 10:40:21] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2023-03-09 10:40:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 307 ms
[2023-03-09 10:40:21] [INFO ] Added : 20 causal constraints over 5 iterations in 407 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 191/191 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 127 transition count 187
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 126 transition count 186
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 126 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 126 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 125 transition count 178
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 125 transition count 178
Applied a total of 10 rules in 16 ms. Remains 125 /129 variables (removed 4) and now considering 178/191 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 125/129 places, 178/191 transitions.
// Phase 1: matrix 178 rows 125 cols
[2023-03-09 10:40:21] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230037 resets, run finished after 1039 ms. (steps per millisecond=962 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95676 resets, run finished after 483 ms. (steps per millisecond=2070 ) properties (out of 1) seen :0
[2023-03-09 10:40:23] [INFO ] Invariant cache hit.
[2023-03-09 10:40:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:23] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-09 10:40:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:23] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-09 10:40:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 10:40:23] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2023-03-09 10:40:23] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2023-03-09 10:40:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-09 10:40:23] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 16 ms.
[2023-03-09 10:40:23] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2023-03-09 10:40:23] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2023-03-09 10:40:23] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2023-03-09 10:40:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2023-03-09 10:40:23] [INFO ] Added : 16 causal constraints over 4 iterations in 288 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-09 10:40:23] [INFO ] Invariant cache hit.
[2023-03-09 10:40:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 10:40:23] [INFO ] Invariant cache hit.
[2023-03-09 10:40:23] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 10:40:24] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-09 10:40:24] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-09 10:40:24] [INFO ] Invariant cache hit.
[2023-03-09 10:40:24] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 445 ms. Remains : 125/125 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-00 in 3266 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05
// Phase 1: matrix 191 rows 129 cols
[2023-03-09 10:40:24] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 974 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 10:40:24] [INFO ] Invariant cache hit.
[2023-03-09 10:40:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:24] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 10:40:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:24] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-09 10:40:24] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-09 10:40:24] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2023-03-09 10:40:24] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 12 ms.
[2023-03-09 10:40:24] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2023-03-09 10:40:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2023-03-09 10:40:24] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2023-03-09 10:40:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2023-03-09 10:40:24] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 316 ms
[2023-03-09 10:40:24] [INFO ] Added : 19 causal constraints over 5 iterations in 406 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 191/191 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 189
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 189
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 127 transition count 188
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 126 transition count 187
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 126 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 126 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 125 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 125 transition count 179
Applied a total of 10 rules in 13 ms. Remains 125 /129 variables (removed 4) and now considering 179/191 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 125/129 places, 179/191 transitions.
// Phase 1: matrix 179 rows 125 cols
[2023-03-09 10:40:24] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 230243 resets, run finished after 1059 ms. (steps per millisecond=944 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95716 resets, run finished after 506 ms. (steps per millisecond=1976 ) properties (out of 1) seen :0
[2023-03-09 10:40:26] [INFO ] Invariant cache hit.
[2023-03-09 10:40:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:26] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 10:40:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:26] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-09 10:40:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 10:40:26] [INFO ] [Nat]Added 58 Read/Feed constraints in 13 ms returned sat
[2023-03-09 10:40:26] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 129 transitions) in 11 ms.
[2023-03-09 10:40:26] [INFO ] Added : 23 causal constraints over 5 iterations in 87 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 125/125 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-09 10:40:26] [INFO ] Invariant cache hit.
[2023-03-09 10:40:26] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-09 10:40:26] [INFO ] Invariant cache hit.
[2023-03-09 10:40:26] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 10:40:27] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2023-03-09 10:40:27] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 10:40:27] [INFO ] Invariant cache hit.
[2023-03-09 10:40:27] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 474 ms. Remains : 125/125 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-05 in 3096 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-11
// Phase 1: matrix 191 rows 129 cols
[2023-03-09 10:40:27] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2277 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 10:40:27] [INFO ] Invariant cache hit.
[2023-03-09 10:40:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:27] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-09 10:40:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:40:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:27] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-09 10:40:27] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-09 10:40:27] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2023-03-09 10:40:27] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 140 transitions) in 12 ms.
[2023-03-09 10:40:27] [INFO ] Added : 11 causal constraints over 3 iterations in 60 ms. Result :sat
Minimization took 33 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 191/191 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 188
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 188
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 127 transition count 186
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 126 transition count 178
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 126 transition count 178
Applied a total of 8 rules in 19 ms. Remains 126 /129 variables (removed 3) and now considering 178/191 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/129 places, 178/191 transitions.
// Phase 1: matrix 178 rows 126 cols
[2023-03-09 10:40:27] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229975 resets, run finished after 1041 ms. (steps per millisecond=960 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 96353 resets, run finished after 484 ms. (steps per millisecond=2066 ) properties (out of 1) seen :0
[2023-03-09 10:40:29] [INFO ] Invariant cache hit.
[2023-03-09 10:40:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:29] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-09 10:40:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:40:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:40:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:40:29] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 10:40:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-09 10:40:29] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2023-03-09 10:40:29] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 127 transitions) in 13 ms.
[2023-03-09 10:40:29] [INFO ] Added : 11 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 33 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, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 126/126 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-09 10:40:29] [INFO ] Invariant cache hit.
[2023-03-09 10:40:29] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-09 10:40:29] [INFO ] Invariant cache hit.
[2023-03-09 10:40:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-09 10:40:29] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-09 10:40:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 10:40:29] [INFO ] Invariant cache hit.
[2023-03-09 10:40:29] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 400 ms. Remains : 126/126 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m05-UpperBounds-11 in 2571 ms.
[2023-03-09 10:40:30] [INFO ] Flatten gal took : 43 ms
[2023-03-09 10:40:30] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 10:40:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 191 transitions and 754 arcs took 2 ms.
Total runtime 32723 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DBSingleClientW (PT), instance d2m05
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 129 places, 191 transitions, 754 arcs.
Final Score: 2635.019
Took : 12 seconds
Bounds file is: UpperBounds.xml
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-05 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DBSingleClientW-PT-d2m05-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678358444541

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DBSingleClientW-PT-d2m05"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is DBSingleClientW-PT-d2m05, 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 r107-tall-167814484000301"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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