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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5549.380 87357.00 112976.00 487.40 1 0 0 0 3 0 0 0 0 1 0 1 0 1 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-167814482500309.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-d2m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814482500309
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678363942676

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-d2m06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 12:12:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 12:12:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 12:12:24] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2023-03-09 12:12:24] [INFO ] Transformed 4763 places.
[2023-03-09 12:12:24] [INFO ] Transformed 2478 transitions.
[2023-03-09 12:12:24] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-09 12:12:24] [INFO ] Computed 6 place invariants in 155 ms
Incomplete random walk after 10000 steps, including 2335 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 967 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 879 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
[2023-03-09 12:12:25] [INFO ] Invariant cache hit.
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2023-03-09 12:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:26] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2023-03-09 12:12:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 21 ms returned sat
[2023-03-09 12:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:27] [INFO ] [Nat]Absence check using state equation in 714 ms returned sat
[2023-03-09 12:12:27] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-09 12:12:29] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1592 ms returned sat
[2023-03-09 12:12:30] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 633 ms.
[2023-03-09 12:12:30] [INFO ] Added : 12 causal constraints over 3 iterations in 1297 ms. Result :sat
Minimization took 946 ms.
[2023-03-09 12:12:31] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 12:12:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:32] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2023-03-09 12:12:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2023-03-09 12:12:32] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2023-03-09 12:12:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:33] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2023-03-09 12:12:34] [INFO ] [Nat]Added 1588 Read/Feed constraints in 748 ms returned sat
[2023-03-09 12:12:34] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 622 ms.
[2023-03-09 12:12:35] [INFO ] Added : 6 causal constraints over 2 iterations in 976 ms. Result :sat
Minimization took 1780 ms.
[2023-03-09 12:12:37] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:37] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-09 12:12:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:37] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2023-03-09 12:12:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-09 12:12:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:38] [INFO ] [Nat]Absence check using state equation in 677 ms returned sat
[2023-03-09 12:12:40] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1535 ms returned sat
[2023-03-09 12:12:40] [INFO ] Deduced a trap composed of 121 places in 638 ms of which 5 ms to minimize.
[2023-03-09 12:12:41] [INFO ] Deduced a trap composed of 128 places in 608 ms of which 2 ms to minimize.
[2023-03-09 12:12:42] [INFO ] Deduced a trap composed of 119 places in 624 ms of which 2 ms to minimize.
[2023-03-09 12:12:43] [INFO ] Deduced a trap composed of 129 places in 613 ms of which 3 ms to minimize.
[2023-03-09 12:12:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java: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 12:12:43] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-09 12:12:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 12:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:43] [INFO ] [Real]Absence check using state equation in 569 ms returned sat
[2023-03-09 12:12:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-09 12:12:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-09 12:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:44] [INFO ] [Nat]Absence check using state equation in 665 ms returned sat
[2023-03-09 12:12:46] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1444 ms returned sat
[2023-03-09 12:12:46] [INFO ] Deduced a trap composed of 32 places in 792 ms of which 2 ms to minimize.
[2023-03-09 12:12:47] [INFO ] Deduced a trap composed of 48 places in 728 ms of which 1 ms to minimize.
[2023-03-09 12:12:48] [INFO ] Deduced a trap composed of 422 places in 589 ms of which 2 ms to minimize.
[2023-03-09 12:12:48] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 2749 ms
[2023-03-09 12:12:49] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:49] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-09 12:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:49] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2023-03-09 12:12:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:12:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 12:12:49] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-09 12:12:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:12:50] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2023-03-09 12:12:51] [INFO ] [Nat]Added 1588 Read/Feed constraints in 853 ms returned sat
[2023-03-09 12:12:51] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 363 ms.
[2023-03-09 12:12:53] [INFO ] Deduced a trap composed of 32 places in 658 ms of which 1 ms to minimize.
[2023-03-09 12:12:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 882 ms
[2023-03-09 12:12:53] [INFO ] Added : 15 causal constraints over 4 iterations in 2403 ms. Result :sat
Minimization took 855 ms.
Current structural bounds on expressions (after SMT) : [7, 6, 6, 6, 2343] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.8 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 1137 transition count 2264
Discarding 388 places :
Symmetric choice reduction at 1 with 388 rule applications. Total rules 603 place count 749 transition count 1205
Iterating global reduction 1 with 388 rules applied. Total rules applied 991 place count 749 transition count 1205
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1000 place count 749 transition count 1196
Discarding 312 places :
Symmetric choice reduction at 2 with 312 rule applications. Total rules 1312 place count 437 transition count 884
Iterating global reduction 2 with 312 rules applied. Total rules applied 1624 place count 437 transition count 884
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1636 place count 437 transition count 872
Discarding 238 places :
Symmetric choice reduction at 3 with 238 rule applications. Total rules 1874 place count 199 transition count 540
Iterating global reduction 3 with 238 rules applied. Total rules applied 2112 place count 199 transition count 540
Ensure Unique test removed 211 transitions
Reduce isomorphic transitions removed 211 transitions.
Iterating post reduction 3 with 211 rules applied. Total rules applied 2323 place count 199 transition count 329
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 2346 place count 176 transition count 291
Iterating global reduction 4 with 23 rules applied. Total rules applied 2369 place count 176 transition count 291
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2375 place count 176 transition count 285
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 2390 place count 161 transition count 270
Iterating global reduction 5 with 15 rules applied. Total rules applied 2405 place count 161 transition count 270
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 2408 place count 161 transition count 267
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2421 place count 148 transition count 254
Iterating global reduction 6 with 13 rules applied. Total rules applied 2434 place count 148 transition count 254
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2444 place count 148 transition count 244
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2448 place count 144 transition count 228
Iterating global reduction 7 with 4 rules applied. Total rules applied 2452 place count 144 transition count 228
Applied a total of 2452 rules in 251 ms. Remains 144 /1183 variables (removed 1039) and now considering 228/2478 (removed 2250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 251 ms. Remains : 144/1183 places, 228/2478 transitions.
// Phase 1: matrix 228 rows 144 cols
[2023-03-09 12:12:55] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229555 resets, run finished after 1486 ms. (steps per millisecond=672 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95633 resets, run finished after 702 ms. (steps per millisecond=1424 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95442 resets, run finished after 660 ms. (steps per millisecond=1515 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95493 resets, run finished after 663 ms. (steps per millisecond=1508 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95548 resets, run finished after 711 ms. (steps per millisecond=1406 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95411 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 5) seen :0
[2023-03-09 12:13:00] [INFO ] Invariant cache hit.
[2023-03-09 12:13:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 12:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:00] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-09 12:13:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:00] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-09 12:13:00] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-09 12:13:00] [INFO ] [Nat]Added 89 Read/Feed constraints in 52 ms returned sat
[2023-03-09 12:13:00] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 22 ms.
[2023-03-09 12:13:00] [INFO ] Deduced a trap composed of 16 places in 151 ms of which 1 ms to minimize.
[2023-03-09 12:13:00] [INFO ] Deduced a trap composed of 16 places in 330 ms of which 1 ms to minimize.
[2023-03-09 12:13:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 536 ms
[2023-03-09 12:13:01] [INFO ] Added : 21 causal constraints over 5 iterations in 691 ms. Result :sat
Minimization took 57 ms.
[2023-03-09 12:13:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:01] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-09 12:13:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:01] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2023-03-09 12:13:01] [INFO ] [Nat]Added 89 Read/Feed constraints in 13 ms returned sat
[2023-03-09 12:13:01] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 23 ms.
[2023-03-09 12:13:01] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2023-03-09 12:13:01] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2023-03-09 12:13:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 235 ms
[2023-03-09 12:13:01] [INFO ] Added : 11 causal constraints over 3 iterations in 338 ms. Result :sat
Minimization took 75 ms.
[2023-03-09 12:13:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:01] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2023-03-09 12:13:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:02] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2023-03-09 12:13:02] [INFO ] [Nat]Added 89 Read/Feed constraints in 45 ms returned sat
[2023-03-09 12:13:02] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 14 ms.
[2023-03-09 12:13:02] [INFO ] Added : 14 causal constraints over 4 iterations in 105 ms. Result :sat
Minimization took 46 ms.
[2023-03-09 12:13:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:02] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 12:13:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:02] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2023-03-09 12:13:02] [INFO ] [Nat]Added 89 Read/Feed constraints in 38 ms returned sat
[2023-03-09 12:13:02] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-09 12:13:02] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-09 12:13:02] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2023-03-09 12:13:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 157 ms
[2023-03-09 12:13:02] [INFO ] Added : 21 causal constraints over 6 iterations in 286 ms. Result :sat
Minimization took 48 ms.
[2023-03-09 12:13:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:02] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:13:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:02] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 12:13:02] [INFO ] [Nat]Added 89 Read/Feed constraints in 16 ms returned sat
[2023-03-09 12:13:02] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 13 ms.
[2023-03-09 12:13:03] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2023-03-09 12:13:03] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2023-03-09 12:13:03] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-09 12:13:03] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 0 ms to minimize.
[2023-03-09 12:13:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 365 ms
[2023-03-09 12:13:03] [INFO ] Added : 26 causal constraints over 6 iterations in 519 ms. Result :sat
Minimization took 49 ms.
Current structural bounds on expressions (after SMT) : [7, 6, 6, 6, 2343] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Applied a total of 0 rules in 22 ms. Remains 144 /144 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 144/144 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Applied a total of 0 rules in 8 ms. Remains 144 /144 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2023-03-09 12:13:03] [INFO ] Invariant cache hit.
[2023-03-09 12:13:04] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-09 12:13:04] [INFO ] Invariant cache hit.
[2023-03-09 12:13:04] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-09 12:13:04] [INFO ] Implicit Places using invariants and state equation in 830 ms returned []
Implicit Place search using SMT with State Equation took 1130 ms to find 0 implicit places.
[2023-03-09 12:13:04] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 12:13:04] [INFO ] Invariant cache hit.
[2023-03-09 12:13:05] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1253 ms. Remains : 144/144 places, 228/228 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00
[2023-03-09 12:13:05] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2254 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 948 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 12:13:05] [INFO ] Invariant cache hit.
[2023-03-09 12:13:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:05] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-09 12:13:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:05] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 12:13:05] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-09 12:13:05] [INFO ] [Nat]Added 89 Read/Feed constraints in 67 ms returned sat
[2023-03-09 12:13:05] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 19 ms.
[2023-03-09 12:13:05] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 0 ms to minimize.
[2023-03-09 12:13:05] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-09 12:13:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 242 ms
[2023-03-09 12:13:05] [INFO ] Added : 21 causal constraints over 5 iterations in 429 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 134 transition count 209
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 134 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 134 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 24 place count 132 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 132 transition count 206
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 28 place count 130 transition count 204
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 130 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 130 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 129 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 129 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 129 transition count 199
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 39 place count 126 transition count 179
Iterating global reduction 4 with 3 rules applied. Total rules applied 42 place count 126 transition count 179
Applied a total of 42 rules in 26 ms. Remains 126 /144 variables (removed 18) and now considering 179/228 (removed 49) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 126/144 places, 179/228 transitions.
// Phase 1: matrix 179 rows 126 cols
[2023-03-09 12:13:05] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229734 resets, run finished after 1254 ms. (steps per millisecond=797 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95414 resets, run finished after 535 ms. (steps per millisecond=1869 ) properties (out of 1) seen :0
[2023-03-09 12:13:07] [INFO ] Invariant cache hit.
[2023-03-09 12:13:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:07] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-09 12:13:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:07] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-09 12:13:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 12:13:07] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2023-03-09 12:13:07] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 128 transitions) in 11 ms.
[2023-03-09 12:13:08] [INFO ] Added : 17 causal constraints over 5 iterations in 90 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 179/179 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2023-03-09 12:13:08] [INFO ] Invariant cache hit.
[2023-03-09 12:13:08] [INFO ] Implicit Places using invariants in 197 ms returned []
[2023-03-09 12:13:08] [INFO ] Invariant cache hit.
[2023-03-09 12:13:08] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-09 12:13:08] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
[2023-03-09 12:13:08] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-09 12:13:08] [INFO ] Invariant cache hit.
[2023-03-09 12:13:08] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 565 ms. Remains : 126/126 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-00 in 3626 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04
// Phase 1: matrix 228 rows 144 cols
[2023-03-09 12:13:08] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 12:13:08] [INFO ] Invariant cache hit.
[2023-03-09 12:13:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:08] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-09 12:13:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-09 12:13:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:08] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:13:08] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-09 12:13:08] [INFO ] [Nat]Added 89 Read/Feed constraints in 13 ms returned sat
[2023-03-09 12:13:08] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 15 ms.
[2023-03-09 12:13:09] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 0 ms to minimize.
[2023-03-09 12:13:09] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-09 12:13:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 201 ms
[2023-03-09 12:13:09] [INFO ] Added : 11 causal constraints over 3 iterations in 291 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 213
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 135 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 133 transition count 203
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 133 transition count 203
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 132 transition count 202
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 132 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 131 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 131 transition count 201
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 131 transition count 198
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 35 place count 128 transition count 178
Iterating global reduction 4 with 3 rules applied. Total rules applied 38 place count 128 transition count 178
Applied a total of 38 rules in 49 ms. Remains 128 /144 variables (removed 16) and now considering 178/228 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 128/144 places, 178/228 transitions.
// Phase 1: matrix 178 rows 128 cols
[2023-03-09 12:13:09] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229853 resets, run finished after 1137 ms. (steps per millisecond=879 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95542 resets, run finished after 518 ms. (steps per millisecond=1930 ) properties (out of 1) seen :0
[2023-03-09 12:13:11] [INFO ] Invariant cache hit.
[2023-03-09 12:13:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:11] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-09 12:13:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:11] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-09 12:13:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-09 12:13:11] [INFO ] [Nat]Added 51 Read/Feed constraints in 8 ms returned sat
[2023-03-09 12:13:11] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 126 transitions) in 11 ms.
[2023-03-09 12:13:11] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-09 12:13:11] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2023-03-09 12:13:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-03-09 12:13:11] [INFO ] Added : 21 causal constraints over 5 iterations in 286 ms. Result :sat
Minimization took 64 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 8 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 128/128 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 178/178 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2023-03-09 12:13:11] [INFO ] Invariant cache hit.
[2023-03-09 12:13:11] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-09 12:13:11] [INFO ] Invariant cache hit.
[2023-03-09 12:13:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2023-03-09 12:13:11] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-09 12:13:11] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-09 12:13:11] [INFO ] Invariant cache hit.
[2023-03-09 12:13:12] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 448 ms. Remains : 128/128 places, 178/178 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-04 in 3367 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-09
// Phase 1: matrix 228 rows 144 cols
[2023-03-09 12:13:12] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2341 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 12:13:12] [INFO ] Invariant cache hit.
[2023-03-09 12:13:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:12] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-09 12:13:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:12] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:13:12] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-09 12:13:12] [INFO ] [Nat]Added 89 Read/Feed constraints in 27 ms returned sat
[2023-03-09 12:13:12] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 16 ms.
[2023-03-09 12:13:12] [INFO ] Added : 14 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 210
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 210
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 133 transition count 208
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 133 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 131 transition count 206
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 131 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 131 transition count 205
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 130 transition count 204
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 130 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 34 place count 130 transition count 201
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 37 place count 127 transition count 181
Iterating global reduction 4 with 3 rules applied. Total rules applied 40 place count 127 transition count 181
Applied a total of 40 rules in 34 ms. Remains 127 /144 variables (removed 17) and now considering 181/228 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 127/144 places, 181/228 transitions.
// Phase 1: matrix 181 rows 127 cols
[2023-03-09 12:13:12] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229616 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95993 resets, run finished after 525 ms. (steps per millisecond=1904 ) properties (out of 1) seen :0
[2023-03-09 12:13:14] [INFO ] Invariant cache hit.
[2023-03-09 12:13:14] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:14] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:13:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:14] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:14] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-09 12:13:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 12:13:14] [INFO ] [Nat]Added 59 Read/Feed constraints in 12 ms returned sat
[2023-03-09 12:13:14] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 130 transitions) in 11 ms.
[2023-03-09 12:13:14] [INFO ] Added : 15 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/127 places, 181/181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 181/181 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 181/181 (removed 0) transitions.
[2023-03-09 12:13:14] [INFO ] Invariant cache hit.
[2023-03-09 12:13:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-09 12:13:14] [INFO ] Invariant cache hit.
[2023-03-09 12:13:14] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-09 12:13:14] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-09 12:13:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:13:14] [INFO ] Invariant cache hit.
[2023-03-09 12:13:15] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 127/127 places, 181/181 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-09 in 2982 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-11
// Phase 1: matrix 228 rows 144 cols
[2023-03-09 12:13:15] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2340 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 945 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 12:13:15] [INFO ] Invariant cache hit.
[2023-03-09 12:13:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:15] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-09 12:13:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 20 ms returned sat
[2023-03-09 12:13:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:15] [INFO ] [Nat]Absence check using state equation in 92 ms returned sat
[2023-03-09 12:13:15] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-09 12:13:15] [INFO ] [Nat]Added 89 Read/Feed constraints in 43 ms returned sat
[2023-03-09 12:13:15] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 19 ms.
[2023-03-09 12:13:15] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2023-03-09 12:13:15] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2023-03-09 12:13:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 175 ms
[2023-03-09 12:13:15] [INFO ] Added : 21 causal constraints over 6 iterations in 313 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Graph (complete) has 500 edges and 144 vertex of which 143 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 143 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 140 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 140 transition count 223
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 137 transition count 220
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 137 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 137 transition count 219
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 135 transition count 212
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 135 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 135 transition count 211
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 23 place count 133 transition count 202
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 133 transition count 202
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 132 transition count 201
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 132 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 132 transition count 200
Applied a total of 28 rules in 14 ms. Remains 132 /144 variables (removed 12) and now considering 200/228 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 132/144 places, 200/228 transitions.
// Phase 1: matrix 200 rows 132 cols
[2023-03-09 12:13:15] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229975 resets, run finished after 1241 ms. (steps per millisecond=805 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95689 resets, run finished after 565 ms. (steps per millisecond=1769 ) properties (out of 1) seen :0
[2023-03-09 12:13:17] [INFO ] Invariant cache hit.
[2023-03-09 12:13:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:17] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-09 12:13:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:17] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-09 12:13:17] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-09 12:13:17] [INFO ] [Nat]Added 74 Read/Feed constraints in 20 ms returned sat
[2023-03-09 12:13:17] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 148 transitions) in 12 ms.
[2023-03-09 12:13:17] [INFO ] Added : 26 causal constraints over 6 iterations in 100 ms. Result :sat
Minimization took 47 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 132/132 places, 200/200 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 200/200 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 200/200 (removed 0) transitions.
[2023-03-09 12:13:18] [INFO ] Invariant cache hit.
[2023-03-09 12:13:18] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-09 12:13:18] [INFO ] Invariant cache hit.
[2023-03-09 12:13:18] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-09 12:13:18] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-09 12:13:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 12:13:18] [INFO ] Invariant cache hit.
[2023-03-09 12:13:18] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 567 ms. Remains : 132/132 places, 200/200 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-11 in 3575 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-13
// Phase 1: matrix 228 rows 144 cols
[2023-03-09 12:13:18] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2308 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 976 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 12:13:18] [INFO ] Invariant cache hit.
[2023-03-09 12:13:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:18] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-09 12:13:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 12:13:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:18] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-09 12:13:18] [INFO ] State equation strengthened by 89 read => feed constraints.
[2023-03-09 12:13:18] [INFO ] [Nat]Added 89 Read/Feed constraints in 17 ms returned sat
[2023-03-09 12:13:18] [INFO ] Computed and/alt/rep : 55/139/55 causal constraints (skipped 172 transitions) in 17 ms.
[2023-03-09 12:13:19] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2023-03-09 12:13:19] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2023-03-09 12:13:19] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2023-03-09 12:13:19] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 0 ms to minimize.
[2023-03-09 12:13:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 353 ms
[2023-03-09 12:13:19] [INFO ] Added : 26 causal constraints over 6 iterations in 511 ms. Result :sat
Minimization took 45 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 228/228 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 140 transition count 224
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 140 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 136 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 136 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 136 transition count 219
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 133 transition count 208
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 133 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 133 transition count 207
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 27 place count 130 transition count 197
Iterating global reduction 2 with 3 rules applied. Total rules applied 30 place count 130 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 32 place count 128 transition count 195
Iterating global reduction 2 with 2 rules applied. Total rules applied 34 place count 128 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 128 transition count 194
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 127 transition count 193
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 127 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 127 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 41 place count 126 transition count 185
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 126 transition count 185
Applied a total of 42 rules in 27 ms. Remains 126 /144 variables (removed 18) and now considering 185/228 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 126/144 places, 185/228 transitions.
// Phase 1: matrix 185 rows 126 cols
[2023-03-09 12:13:19] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229809 resets, run finished after 1163 ms. (steps per millisecond=859 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95783 resets, run finished after 546 ms. (steps per millisecond=1831 ) properties (out of 1) seen :0
[2023-03-09 12:13:21] [INFO ] Invariant cache hit.
[2023-03-09 12:13:21] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:21] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-09 12:13:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 12:13:21] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 12:13:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 12:13:21] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-09 12:13:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-09 12:13:21] [INFO ] [Nat]Added 66 Read/Feed constraints in 12 ms returned sat
[2023-03-09 12:13:21] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 135 transitions) in 10 ms.
[2023-03-09 12:13:21] [INFO ] Added : 16 causal constraints over 4 iterations in 60 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 126/126 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-09 12:13:21] [INFO ] Invariant cache hit.
[2023-03-09 12:13:21] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-09 12:13:21] [INFO ] Invariant cache hit.
[2023-03-09 12:13:21] [INFO ] State equation strengthened by 66 read => feed constraints.
[2023-03-09 12:13:21] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2023-03-09 12:13:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 12:13:22] [INFO ] Invariant cache hit.
[2023-03-09 12:13:22] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 584 ms. Remains : 126/126 places, 185/185 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m06-UpperBounds-13 in 3496 ms.
[2023-03-09 12:13:22] [INFO ] Flatten gal took : 104 ms
[2023-03-09 12:13:22] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/UpperBounds.sr.xml took 9 ms.
[2023-03-09 12:13:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 144 places, 228 transitions and 900 arcs took 4 ms.
Total runtime 58102 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_d2m06
(NrP: 144 NrTr: 228 NrArc: 900)

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

net check time: 0m 0.000sec

init dd package: 0m 2.691sec


RS generation: 0m22.006sec


-> reachability set: #nodes 27589 (2.8e+04) #states 3,804,854 (6)



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

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

-> the formula is 1

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

MC time: 0m 0.000sec

checking: place_bound(p138)
normalized: place_bound(p138)

-> the formula is 3

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-04 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p100)
normalized: place_bound(p100)

-> the formula is 1

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-09 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p93)
normalized: place_bound(p93)

-> the formula is 1

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p101)
normalized: place_bound(p101)

-> the formula is 1

FORMULA DBSingleClientW-PT-d2m06-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1788673 (1.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 47852110 97453452 145305562
used/not used/entry size/cache size: 51794067 15314797 16 1024MB
basic ops cache: hits/miss/sum: 8615 14209 22824
used/not used/entry size/cache size: 38929 16738287 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: 9911 27593 37504
used/not used/entry size/cache size: 27544 8361064 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 65536411
1 1391298
2 152528
3 24822
4 3334
5 361
6 36
7 1
8 5
9 10
>= 10 58

Total processing time: 0m26.528sec


BK_STOP 1678364030033

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

9054 14157 16549 25686 28564 27980 28005
iterations count:788781 (3459), effective:11411 (50)

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-d2m06"
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-d2m06, 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-167814482500309"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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