fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r106-tall-167814482500277
Last Updated
May 14, 2023

About the Execution of Marcie+red for DBSingleClientW-PT-d1m09

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5617.315 55285.00 69534.00 475.30 1 0 0 1 0 0 1 3 0 1 1 0 6 0 0 0 normal

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.r106-tall-167814482500277.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 marciexred
Input is DBSingleClientW-PT-d1m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482500277
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 6.0K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 15:37 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 432K 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-d1m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678355995976

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 09:59:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 09:59:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 09:59:57] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-09 09:59:57] [INFO ] Transformed 1440 places.
[2023-03-09 09:59:57] [INFO ] Transformed 672 transitions.
[2023-03-09 09:59:57] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1093 places in 4 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-09 09:59:57] [INFO ] Computed 6 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2281 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 1004 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 990 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1022 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 957 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 1005 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 937 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
[2023-03-09 09:59:57] [INFO ] Invariant cache hit.
[2023-03-09 09:59:58] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2023-03-09 09:59:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-09 09:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:59:58] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-09 09:59:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:59:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:59:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 09:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:59:58] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2023-03-09 09:59:58] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-09 09:59:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 86 ms returned sat
[2023-03-09 09:59:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 139 ms.
[2023-03-09 09:59:59] [INFO ] Added : 12 causal constraints over 3 iterations in 331 ms. Result :sat
Minimization took 85 ms.
[2023-03-09 09:59:59] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:59:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 09:59:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 09:59:59] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-09 09:59:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 09:59:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 09:59:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 09:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 09:59:59] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2023-03-09 09:59:59] [INFO ] [Nat]Added 418 Read/Feed constraints in 73 ms returned sat
[2023-03-09 09:59:59] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 5 ms to minimize.
[2023-03-09 09:59:59] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 0 ms to minimize.
[2023-03-09 10:00:00] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 1 ms to minimize.
[2023-03-09 10:00:00] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 1 ms to minimize.
[2023-03-09 10:00:00] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2023-03-09 10:00:00] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 0 ms to minimize.
[2023-03-09 10:00:00] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 1 ms to minimize.
[2023-03-09 10:00:01] [INFO ] Deduced a trap composed of 26 places in 126 ms of which 1 ms to minimize.
[2023-03-09 10:00:01] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 8 ms to minimize.
[2023-03-09 10:00:01] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 0 ms to minimize.
[2023-03-09 10:00:01] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 1 ms to minimize.
[2023-03-09 10:00:01] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 0 ms to minimize.
[2023-03-09 10:00:01] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 1 ms to minimize.
[2023-03-09 10:00:02] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 0 ms to minimize.
[2023-03-09 10:00:02] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 0 ms to minimize.
[2023-03-09 10:00:02] [INFO ] Deduced a trap composed of 102 places in 95 ms of which 1 ms to minimize.
[2023-03-09 10:00:02] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 0 ms to minimize.
[2023-03-09 10:00:04] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 0 ms to minimize.
[2023-03-09 10:00:04] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 0 ms to minimize.
[2023-03-09 10:00: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 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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:00:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 10:00:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 10:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:04] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-09 10:00:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 10:00:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 10:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:04] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2023-03-09 10:00:05] [INFO ] [Nat]Added 418 Read/Feed constraints in 91 ms returned sat
[2023-03-09 10:00:05] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 69 ms.
[2023-03-09 10:00:05] [INFO ] Added : 12 causal constraints over 3 iterations in 296 ms. Result :sat
Minimization took 78 ms.
[2023-03-09 10:00:05] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 10:00:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 10:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:05] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2023-03-09 10:00:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 10:00:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 10:00:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:05] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2023-03-09 10:00:05] [INFO ] [Nat]Added 418 Read/Feed constraints in 61 ms returned sat
[2023-03-09 10:00:05] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 55 ms.
[2023-03-09 10:00:06] [INFO ] Added : 5 causal constraints over 2 iterations in 178 ms. Result :sat
Minimization took 164 ms.
[2023-03-09 10:00:06] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 10:00:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-09 10:00:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:06] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-09 10:00:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 10:00:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 10:00:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:06] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2023-03-09 10:00:06] [INFO ] [Nat]Added 418 Read/Feed constraints in 82 ms returned sat
[2023-03-09 10:00:06] [INFO ] Deduced a trap composed of 118 places in 123 ms of which 0 ms to minimize.
[2023-03-09 10:00:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2023-03-09 10:00:06] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 72 ms.
[2023-03-09 10:00:07] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 1 ms to minimize.
[2023-03-09 10:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 192 ms
[2023-03-09 10:00:07] [INFO ] Added : 14 causal constraints over 5 iterations in 533 ms. Result :sat
Minimization took 138 ms.
[2023-03-09 10:00:07] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 10:00:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 10:00:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:07] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-09 10:00:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 10:00:07] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 10:00:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:07] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-09 10:00:08] [INFO ] [Nat]Added 418 Read/Feed constraints in 70 ms returned sat
[2023-03-09 10:00:08] [INFO ] Deduced a trap composed of 99 places in 115 ms of which 1 ms to minimize.
[2023-03-09 10:00:08] [INFO ] Deduced a trap composed of 103 places in 124 ms of which 0 ms to minimize.
[2023-03-09 10:00:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 300 ms
[2023-03-09 10:00:08] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 49 ms.
[2023-03-09 10:00:08] [INFO ] Added : 12 causal constraints over 3 iterations in 220 ms. Result :sat
Minimization took 79 ms.
[2023-03-09 10:00:08] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 10:00:08] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 10:00:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:08] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-09 10:00:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 10:00:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-09 10:00:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:09] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2023-03-09 10:00:09] [INFO ] [Nat]Added 418 Read/Feed constraints in 67 ms returned sat
[2023-03-09 10:00:09] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 50 ms.
[2023-03-09 10:00:09] [INFO ] Added : 7 causal constraints over 2 iterations in 162 ms. Result :sat
Minimization took 291 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 11, 9, 1622, 9] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 182 place count 232 transition count 330
Iterating global reduction 1 with 93 rules applied. Total rules applied 275 place count 232 transition count 330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 279 place count 232 transition count 326
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 351 place count 160 transition count 254
Iterating global reduction 2 with 72 rules applied. Total rules applied 423 place count 160 transition count 254
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 428 place count 160 transition count 249
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 466 place count 122 transition count 188
Iterating global reduction 3 with 38 rules applied. Total rules applied 504 place count 122 transition count 188
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 524 place count 122 transition count 168
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 535 place count 111 transition count 150
Iterating global reduction 4 with 11 rules applied. Total rules applied 546 place count 111 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 547 place count 111 transition count 149
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 555 place count 103 transition count 141
Iterating global reduction 5 with 8 rules applied. Total rules applied 563 place count 103 transition count 141
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 566 place count 103 transition count 138
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 572 place count 97 transition count 132
Iterating global reduction 6 with 6 rules applied. Total rules applied 578 place count 97 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 579 place count 97 transition count 131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 580 place count 96 transition count 129
Iterating global reduction 7 with 1 rules applied. Total rules applied 581 place count 96 transition count 129
Applied a total of 581 rules in 82 ms. Remains 96 /347 variables (removed 251) and now considering 129/672 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 96/347 places, 129/672 transitions.
// Phase 1: matrix 129 rows 96 cols
[2023-03-09 10:00:09] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229559 resets, run finished after 979 ms. (steps per millisecond=1021 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98141 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98080 resets, run finished after 465 ms. (steps per millisecond=2150 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98315 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98222 resets, run finished after 458 ms. (steps per millisecond=2183 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000000 steps, including 97973 resets, run finished after 472 ms. (steps per millisecond=2118 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 97931 resets, run finished after 451 ms. (steps per millisecond=2217 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98424 resets, run finished after 453 ms. (steps per millisecond=2207 ) properties (out of 7) seen :0
[2023-03-09 10:00:14] [INFO ] Invariant cache hit.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-09 10:00:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 10:00:14] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 18 ms returned sat
[2023-03-09 10:00:14] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 6 ms.
[2023-03-09 10:00:14] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 17 ms.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2023-03-09 10:00:14] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 7 ms.
[2023-03-09 10:00:14] [INFO ] Added : 7 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 15 ms.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 10:00:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2023-03-09 10:00:14] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 7 ms.
[2023-03-09 10:00:14] [INFO ] Added : 9 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 19 ms.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:14] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 10:00:14] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2023-03-09 10:00:14] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 8 ms.
[2023-03-09 10:00:14] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2023-03-09 10:00:14] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-09 10:00:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-09 10:00:14] [INFO ] Added : 12 causal constraints over 3 iterations in 176 ms. Result :sat
Minimization took 49 ms.
[2023-03-09 10:00:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:15] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2023-03-09 10:00:15] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 7 ms.
[2023-03-09 10:00:15] [INFO ] Added : 7 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 16 ms.
[2023-03-09 10:00:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:15] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-09 10:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:15] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 7 ms returned sat
[2023-03-09 10:00:15] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 6 ms.
[2023-03-09 10:00:15] [INFO ] Added : 8 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 24 ms.
[2023-03-09 10:00:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:15] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:15] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-09 10:00:15] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2023-03-09 10:00:15] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 6 ms.
[2023-03-09 10:00:15] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2023-03-09 10:00:15] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2023-03-09 10:00:15] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-09 10:00:15] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2023-03-09 10:00:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 217 ms
[2023-03-09 10:00:15] [INFO ] Added : 15 causal constraints over 3 iterations in 265 ms. Result :sat
Minimization took 52 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 11, 9, 1622, 9] Max seen :[0, 0, 0, 0, 0, 0, 0]
Support contains 7 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 96/96 places, 129/129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Applied a total of 0 rules in 6 ms. Remains 96 /96 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2023-03-09 10:00:15] [INFO ] Invariant cache hit.
[2023-03-09 10:00:15] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 10:00:15] [INFO ] Invariant cache hit.
[2023-03-09 10:00:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:16] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-09 10:00:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 10:00:16] [INFO ] Invariant cache hit.
[2023-03-09 10:00:16] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 285 ms. Remains : 96/96 places, 129/129 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-00
[2023-03-09 10:00:16] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2265 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1012 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 10:00:16] [INFO ] Invariant cache hit.
[2023-03-09 10:00:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 9 ms returned sat
[2023-03-09 10:00:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:16] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:16] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 10:00:16] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:16] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2023-03-09 10:00:16] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 8 ms.
[2023-03-09 10:00:16] [INFO ] Added : 9 causal constraints over 2 iterations in 32 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 89 transition count 119
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 89 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 89 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 87 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 87 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 86 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 85 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 85 transition count 109
Applied a total of 29 rules in 17 ms. Remains 85 /96 variables (removed 11) and now considering 109/129 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 85/96 places, 109/129 transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-09 10:00:16] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229581 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98892 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 1) seen :0
[2023-03-09 10:00:17] [INFO ] Invariant cache hit.
[2023-03-09 10:00:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:17] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 10:00:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:17] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-09 10:00:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 10:00:17] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-09 10:00:17] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 6 ms.
[2023-03-09 10:00:17] [INFO ] Added : 9 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 6 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 85/85 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 5 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-09 10:00:17] [INFO ] Invariant cache hit.
[2023-03-09 10:00:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 10:00:17] [INFO ] Invariant cache hit.
[2023-03-09 10:00:17] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 10:00:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-09 10:00:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 10:00:17] [INFO ] Invariant cache hit.
[2023-03-09 10:00:17] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 232 ms. Remains : 85/85 places, 109/109 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-00 in 1817 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-03
// Phase 1: matrix 129 rows 96 cols
[2023-03-09 10:00:18] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-09 10:00:18] [INFO ] Invariant cache hit.
[2023-03-09 10:00:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:18] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-09 10:00:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:18] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-09 10:00:18] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:18] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2023-03-09 10:00:18] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 10 ms.
[2023-03-09 10:00:18] [INFO ] Added : 7 causal constraints over 2 iterations in 41 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 125
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 92 transition count 124
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 89 transition count 119
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 89 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 89 transition count 117
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 87 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 87 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 87 transition count 108
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 23 place count 86 transition count 107
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 86 transition count 107
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 85 transition count 106
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 85 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 85 transition count 104
Applied a total of 28 rules in 15 ms. Remains 85 /96 variables (removed 11) and now considering 104/129 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 85/96 places, 104/129 transitions.
// Phase 1: matrix 104 rows 85 cols
[2023-03-09 10:00:18] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229614 resets, run finished after 746 ms. (steps per millisecond=1340 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98742 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 1) seen :0
[2023-03-09 10:00:19] [INFO ] Invariant cache hit.
[2023-03-09 10:00:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:19] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-09 10:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:19] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 10:00:19] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 10:00:19] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2023-03-09 10:00:19] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 73 transitions) in 5 ms.
[2023-03-09 10:00:19] [INFO ] Added : 8 causal constraints over 3 iterations in 30 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 104/104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 104/104 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2023-03-09 10:00:19] [INFO ] Invariant cache hit.
[2023-03-09 10:00:19] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 10:00:19] [INFO ] Invariant cache hit.
[2023-03-09 10:00:19] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-09 10:00:19] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-03-09 10:00:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 10:00:19] [INFO ] Invariant cache hit.
[2023-03-09 10:00:19] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 205 ms. Remains : 85/85 places, 104/104 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-03 in 1734 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-06
// Phase 1: matrix 129 rows 96 cols
[2023-03-09 10:00:19] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 922 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 10:00:19] [INFO ] Invariant cache hit.
[2023-03-09 10:00:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:19] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-09 10:00:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:19] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:19] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:19] [INFO ] [Nat]Added 43 Read/Feed constraints in 6 ms returned sat
[2023-03-09 10:00:19] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 7 ms.
[2023-03-09 10:00:19] [INFO ] Added : 9 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 89 transition count 119
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 89 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 17 place count 89 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 19 place count 87 transition count 115
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 87 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 24 place count 86 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 85 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 29 place count 85 transition count 109
Applied a total of 29 rules in 14 ms. Remains 85 /96 variables (removed 11) and now considering 109/129 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 85/96 places, 109/129 transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-09 10:00:19] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229694 resets, run finished after 781 ms. (steps per millisecond=1280 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98138 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 1) seen :0
[2023-03-09 10:00:21] [INFO ] Invariant cache hit.
[2023-03-09 10:00:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 10:00:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:21] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 10:00:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 10:00:21] [INFO ] [Nat]Added 36 Read/Feed constraints in 6 ms returned sat
[2023-03-09 10:00:21] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 8 ms.
[2023-03-09 10:00:21] [INFO ] Added : 19 causal constraints over 5 iterations in 51 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-09 10:00:21] [INFO ] Invariant cache hit.
[2023-03-09 10:00:21] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 10:00:21] [INFO ] Invariant cache hit.
[2023-03-09 10:00:21] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 10:00:21] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-09 10:00:21] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 10:00:21] [INFO ] Invariant cache hit.
[2023-03-09 10:00:21] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 85/85 places, 109/109 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-06 in 1850 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-07
// Phase 1: matrix 129 rows 96 cols
[2023-03-09 10:00:21] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-09 10:00:21] [INFO ] Invariant cache hit.
[2023-03-09 10:00:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:21] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2023-03-09 10:00:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:21] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:21] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2023-03-09 10:00:21] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 6 ms.
[2023-03-09 10:00:21] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2023-03-09 10:00:21] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-09 10:00:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2023-03-09 10:00:21] [INFO ] Added : 12 causal constraints over 3 iterations in 159 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 91 transition count 122
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 87 transition count 116
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 87 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 87 transition count 114
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 84 transition count 105
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 84 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 84 transition count 103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 31 place count 83 transition count 102
Iterating global reduction 3 with 1 rules applied. Total rules applied 32 place count 83 transition count 102
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 82 transition count 101
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 82 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 82 transition count 99
Applied a total of 36 rules in 13 ms. Remains 82 /96 variables (removed 14) and now considering 99/129 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 82/96 places, 99/129 transitions.
// Phase 1: matrix 99 rows 82 cols
[2023-03-09 10:00:21] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229767 resets, run finished after 718 ms. (steps per millisecond=1392 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98417 resets, run finished after 357 ms. (steps per millisecond=2801 ) properties (out of 1) seen :0
[2023-03-09 10:00:23] [INFO ] Invariant cache hit.
[2023-03-09 10:00:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 10:00:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:23] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 10:00:23] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 10:00:23] [INFO ] [Nat]Added 29 Read/Feed constraints in 4 ms returned sat
[2023-03-09 10:00:23] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 8 ms.
[2023-03-09 10:00:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2023-03-09 10:00:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2023-03-09 10:00:23] [INFO ] Added : 5 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-09 10:00:23] [INFO ] Invariant cache hit.
[2023-03-09 10:00:23] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-09 10:00:23] [INFO ] Invariant cache hit.
[2023-03-09 10:00:23] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 10:00:23] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-09 10:00:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 10:00:23] [INFO ] Invariant cache hit.
[2023-03-09 10:00:23] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-07 in 1916 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-09
// Phase 1: matrix 129 rows 96 cols
[2023-03-09 10:00:23] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-09 10:00:23] [INFO ] Invariant cache hit.
[2023-03-09 10:00:23] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:23] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 10:00:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:23] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:23] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 10:00:23] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:23] [INFO ] [Nat]Added 43 Read/Feed constraints in 5 ms returned sat
[2023-03-09 10:00:23] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 7 ms.
[2023-03-09 10:00:23] [INFO ] Added : 7 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 124
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 91 transition count 122
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 15 place count 88 transition count 117
Iterating global reduction 1 with 3 rules applied. Total rules applied 18 place count 88 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 20 place count 88 transition count 115
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 86 transition count 107
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 86 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 86 transition count 106
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 85 transition count 105
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 85 transition count 105
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 84 transition count 104
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 84 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 102
Applied a total of 31 rules in 11 ms. Remains 84 /96 variables (removed 12) and now considering 102/129 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 84/96 places, 102/129 transitions.
// Phase 1: matrix 102 rows 84 cols
[2023-03-09 10:00:23] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229893 resets, run finished after 784 ms. (steps per millisecond=1275 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 98516 resets, run finished after 361 ms. (steps per millisecond=2770 ) properties (out of 1) seen :0
[2023-03-09 10:00:24] [INFO ] Invariant cache hit.
[2023-03-09 10:00:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:24] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA DBSingleClientW-PT-d1m09-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-09 in 1420 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-10
// Phase 1: matrix 129 rows 96 cols
[2023-03-09 10:00:24] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 2297 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 943 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 10:00:24] [INFO ] Invariant cache hit.
[2023-03-09 10:00:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:24] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-09 10:00:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:25] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-09 10:00:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:25] [INFO ] [Nat]Added 43 Read/Feed constraints in 8 ms returned sat
[2023-03-09 10:00:25] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 8 ms.
[2023-03-09 10:00:25] [INFO ] Added : 8 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 125
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 92 transition count 124
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 13 place count 88 transition count 118
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 88 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 88 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 86 transition count 113
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 86 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 85 transition count 110
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 85 transition count 110
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 84 transition count 109
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 84 transition count 109
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 84 transition count 107
Applied a total of 31 rules in 14 ms. Remains 84 /96 variables (removed 12) and now considering 107/129 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 84/96 places, 107/129 transitions.
// Phase 1: matrix 107 rows 84 cols
[2023-03-09 10:00:25] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229459 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98705 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 1) seen :0
[2023-03-09 10:00:26] [INFO ] Invariant cache hit.
[2023-03-09 10:00:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:26] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-09 10:00:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:26] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-09 10:00:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 10:00:26] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-09 10:00:26] [INFO ] Computed and/alt/rep : 29/63/29 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-09 10:00:26] [INFO ] Added : 11 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 84/84 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 2 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-09 10:00:26] [INFO ] Invariant cache hit.
[2023-03-09 10:00:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-09 10:00:26] [INFO ] Invariant cache hit.
[2023-03-09 10:00:26] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 10:00:26] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-09 10:00:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 10:00:26] [INFO ] Invariant cache hit.
[2023-03-09 10:00:26] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 231 ms. Remains : 84/84 places, 107/107 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-10 in 1832 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12
// Phase 1: matrix 129 rows 96 cols
[2023-03-09 10:00:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2298 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 986 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-09 10:00:26] [INFO ] Invariant cache hit.
[2023-03-09 10:00:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:26] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:26] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-09 10:00:26] [INFO ] State equation strengthened by 43 read => feed constraints.
[2023-03-09 10:00:26] [INFO ] [Nat]Added 43 Read/Feed constraints in 4 ms returned sat
[2023-03-09 10:00:26] [INFO ] Computed and/alt/rep : 34/84/34 causal constraints (skipped 94 transitions) in 6 ms.
[2023-03-09 10:00:26] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2023-03-09 10:00:27] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2023-03-09 10:00:27] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2023-03-09 10:00:27] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2023-03-09 10:00:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 229 ms
[2023-03-09 10:00:27] [INFO ] Added : 15 causal constraints over 3 iterations in 279 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 92 transition count 123
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 89 transition count 118
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 89 transition count 118
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 89 transition count 116
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 20 place count 87 transition count 109
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 87 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 87 transition count 108
Applied a total of 23 rules in 7 ms. Remains 87 /96 variables (removed 9) and now considering 108/129 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 87/96 places, 108/129 transitions.
// Phase 1: matrix 108 rows 87 cols
[2023-03-09 10:00:27] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229561 resets, run finished after 768 ms. (steps per millisecond=1302 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98732 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :0
[2023-03-09 10:00:28] [INFO ] Invariant cache hit.
[2023-03-09 10:00:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 10:00:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:28] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-09 10:00:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 10:00:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 10:00:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 10:00:28] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 10:00:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-09 10:00:28] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2023-03-09 10:00:28] [INFO ] Computed and/alt/rep : 31/70/31 causal constraints (skipped 76 transitions) in 6 ms.
[2023-03-09 10:00:28] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-09 10:00:28] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2023-03-09 10:00:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2023-03-09 10:00:28] [INFO ] Added : 11 causal constraints over 5 iterations in 144 ms. Result :sat
Minimization took 37 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 108/108 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-09 10:00:28] [INFO ] Invariant cache hit.
[2023-03-09 10:00:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-09 10:00:28] [INFO ] Invariant cache hit.
[2023-03-09 10:00:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2023-03-09 10:00:28] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-09 10:00:28] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 10:00:28] [INFO ] Invariant cache hit.
[2023-03-09 10:00:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 87/87 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m09-UpperBounds-12 in 2242 ms.
[2023-03-09 10:00:29] [INFO ] Flatten gal took : 37 ms
[2023-03-09 10:00:29] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 10:00:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 96 places, 129 transitions and 509 arcs took 2 ms.
Total runtime 31849 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DBSingleClientW_PT_d1m09
(NrP: 96 NrTr: 129 NrArc: 509)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.694sec


RS generation: 0m16.362sec


-> reachability set: #nodes 49489 (4.9e+04) #states 141,931,742 (8)



starting MCC model checker
--------------------------

checking: place_bound(p7)
normalized: place_bound(p7)

-> the formula is 1

FORMULA DBSingleClientW-PT-d1m09-UpperBounds-00 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p31)
normalized: place_bound(p31)

-> the formula is 1

FORMULA DBSingleClientW-PT-d1m09-UpperBounds-03 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p6)
normalized: place_bound(p6)

-> the formula is 1

FORMULA DBSingleClientW-PT-d1m09-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p62)
normalized: place_bound(p62)

-> the formula is 3

FORMULA DBSingleClientW-PT-d1m09-UpperBounds-07 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p46)
normalized: place_bound(p46)

-> the formula is 1

FORMULA DBSingleClientW-PT-d1m09-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p94)
normalized: place_bound(p94)

-> the formula is 6

FORMULA DBSingleClientW-PT-d1m09-UpperBounds-12 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 2248343 (2.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 44258806 61413087 105671893
used/not used/entry size/cache size: 40949693 26159171 16 1024MB
basic ops cache: hits/miss/sum: 58596 54171 112767
used/not used/entry size/cache size: 89980 16687236 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 30514 49497 80011
used/not used/entry size/cache size: 49370 8339238 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 65126564
1 1770552
2 176424
3 29261
4 4500
5 716
6 289
7 98
8 22
9 30
>= 10 408

Total processing time: 0m21.069sec


BK_STOP 1678356051261

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

31465 49747 48303
iterations count:396473 (3073), effective:10297 (79)

initing FirstDep: 0m 0.000sec

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-d1m09"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DBSingleClientW-PT-d1m09, 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 r106-tall-167814482500277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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