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.r105-tall-167814481000317.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 ltsminxred
Input is DBSingleClientW-PT-d2m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.3K Feb 26 15:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 15:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 15:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-d2m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m07-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678275264899

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 11:34:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 11:34:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:34:26] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2023-03-08 11:34:26] [INFO ] Transformed 4763 places.
[2023-03-08 11:34:26] [INFO ] Transformed 2478 transitions.
[2023-03-08 11:34:26] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2023-03-08 11:34:26] [INFO ] Computed 6 place invariants in 160 ms
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 946 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :2
[2023-03-08 11:34:27] [INFO ] Invariant cache hit.
[2023-03-08 11:34:27] [INFO ] [Real]Absence check using 2 positive place invariants in 21 ms returned sat
[2023-03-08 11:34:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-08 11:34:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:28] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2023-03-08 11:34:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 20 ms returned sat
[2023-03-08 11:34:28] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2023-03-08 11:34:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:29] [INFO ] [Nat]Absence check using state equation in 545 ms returned sat
[2023-03-08 11:34:29] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2023-03-08 11:34:29] [INFO ] [Nat]Added 1588 Read/Feed constraints in 652 ms returned sat
[2023-03-08 11:34:30] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 661 ms.
[2023-03-08 11:34:31] [INFO ] Added : 2 causal constraints over 1 iterations in 941 ms. Result :sat
Minimization took 795 ms.
[2023-03-08 11:34:32] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 11:34:32] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 11:34:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:32] [INFO ] [Real]Absence check using state equation in 574 ms returned sat
[2023-03-08 11:34:33] [INFO ] [Real]Added 1588 Read/Feed constraints in 936 ms returned sat
[2023-03-08 11:34:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 11:34:33] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2023-03-08 11:34:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:34] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2023-03-08 11:34:35] [INFO ] [Nat]Added 1588 Read/Feed constraints in 682 ms returned sat
[2023-03-08 11:34:35] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 439 ms.
[2023-03-08 11:34:35] [INFO ] Added : 1 causal constraints over 1 iterations in 701 ms. Result :sat
Minimization took 498 ms.
[2023-03-08 11:34:36] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 11:34:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 11:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:37] [INFO ] [Real]Absence check using state equation in 682 ms returned sat
[2023-03-08 11:34:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2023-03-08 11:34:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 11:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:38] [INFO ] [Nat]Absence check using state equation in 679 ms returned sat
[2023-03-08 11:34:39] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1443 ms returned sat
[2023-03-08 11:34:40] [INFO ] Deduced a trap composed of 119 places in 651 ms of which 5 ms to minimize.
[2023-03-08 11:34:41] [INFO ] Deduced a trap composed of 252 places in 755 ms of which 2 ms to minimize.
[2023-03-08 11:34:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1634 ms
[2023-03-08 11:34:41] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 376 ms.
[2023-03-08 11:34:42] [INFO ] Deduced a trap composed of 140 places in 627 ms of which 2 ms to minimize.
[2023-03-08 11:34:42] [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.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
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)
Current structural bounds on expressions (after SMT) : [3, 7, 7] Max seen :[1, 2, 0]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.7 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1322 place count 431 transition count 877
Iterating global reduction 2 with 315 rules applied. Total rules applied 1637 place count 431 transition count 877
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1649 place count 431 transition count 865
Discarding 241 places :
Symmetric choice reduction at 3 with 241 rule applications. Total rules 1890 place count 190 transition count 522
Iterating global reduction 3 with 241 rules applied. Total rules applied 2131 place count 190 transition count 522
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2343 place count 190 transition count 310
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2367 place count 166 transition count 271
Iterating global reduction 4 with 24 rules applied. Total rules applied 2391 place count 166 transition count 271
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2397 place count 166 transition count 265
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2413 place count 150 transition count 249
Iterating global reduction 5 with 16 rules applied. Total rules applied 2429 place count 150 transition count 249
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2431 place count 150 transition count 247
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2445 place count 136 transition count 233
Iterating global reduction 6 with 14 rules applied. Total rules applied 2459 place count 136 transition count 233
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2472 place count 136 transition count 220
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 2479 place count 129 transition count 184
Iterating global reduction 7 with 7 rules applied. Total rules applied 2486 place count 129 transition count 184
Applied a total of 2486 rules in 228 ms. Remains 129 /1183 variables (removed 1054) and now considering 184/2478 (removed 2294) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 228 ms. Remains : 129/1183 places, 184/2478 transitions.
// Phase 1: matrix 184 rows 129 cols
[2023-03-08 11:34:43] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229613 resets, run finished after 1269 ms. (steps per millisecond=788 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95488 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 96047 resets, run finished after 561 ms. (steps per millisecond=1782 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95361 resets, run finished after 544 ms. (steps per millisecond=1838 ) properties (out of 3) seen :3
[2023-03-08 11:34:46] [INFO ] Invariant cache hit.
[2023-03-08 11:34:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:46] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:46] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 11:34:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 11:34:46] [INFO ] [Nat]Added 60 Read/Feed constraints in 14 ms returned sat
[2023-03-08 11:34:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2023-03-08 11:34:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2023-03-08 11:34:46] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 11 ms.
[2023-03-08 11:34:46] [INFO ] Added : 2 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 23 ms.
[2023-03-08 11:34:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:46] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:46] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2023-03-08 11:34:46] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 12 ms.
[2023-03-08 11:34:46] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 20 ms.
[2023-03-08 11:34:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:46] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 11:34:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:46] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2023-03-08 11:34:46] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2023-03-08 11:34:46] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 12 ms.
[2023-03-08 11:34:46] [INFO ] Added : 17 causal constraints over 4 iterations in 74 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : [3, 7, 7] Max seen :[2, 4, 0]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 11 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 129/129 places, 184/184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 9 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-08 11:34:47] [INFO ] Invariant cache hit.
[2023-03-08 11:34:47] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-08 11:34:47] [INFO ] Invariant cache hit.
[2023-03-08 11:34:47] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 11:34:47] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-08 11:34:47] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 11:34:47] [INFO ] Invariant cache hit.
[2023-03-08 11:34:47] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 434 ms. Remains : 129/129 places, 184/184 transitions.
[2023-03-08 11:34:47] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229638 resets, run finished after 1210 ms. (steps per millisecond=826 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95483 resets, run finished after 556 ms. (steps per millisecond=1798 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 96615 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 94932 resets, run finished after 557 ms. (steps per millisecond=1795 ) properties (out of 3) seen :3
[2023-03-08 11:34:50] [INFO ] Invariant cache hit.
[2023-03-08 11:34:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:50] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-08 11:34:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:50] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-08 11:34:50] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 11:34:50] [INFO ] [Nat]Added 60 Read/Feed constraints in 6 ms returned sat
[2023-03-08 11:34:50] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2023-03-08 11:34:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-08 11:34:50] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 10 ms.
[2023-03-08 11:34:50] [INFO ] Added : 2 causal constraints over 1 iterations in 37 ms. Result :sat
Minimization took 24 ms.
[2023-03-08 11:34:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:50] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 11:34:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:50] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 11:34:50] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2023-03-08 11:34:50] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 13 ms.
[2023-03-08 11:34:50] [INFO ] Added : 1 causal constraints over 1 iterations in 33 ms. Result :sat
Minimization took 18 ms.
[2023-03-08 11:34:50] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:34:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:50] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2023-03-08 11:34:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:50] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:51] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:34:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2023-03-08 11:34:51] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 11 ms.
[2023-03-08 11:34:51] [INFO ] Added : 17 causal constraints over 4 iterations in 77 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [3, 7, 7] Max seen :[2, 4, 0]
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 6 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 129/129 places, 184/184 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 184/184 (removed 0) transitions.
[2023-03-08 11:34:51] [INFO ] Invariant cache hit.
[2023-03-08 11:34:51] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 11:34:51] [INFO ] Invariant cache hit.
[2023-03-08 11:34:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 11:34:51] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 11:34:51] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-08 11:34:51] [INFO ] Invariant cache hit.
[2023-03-08 11:34:51] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 432 ms. Remains : 129/129 places, 184/184 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-07
[2023-03-08 11:34:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 964 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :1
[2023-03-08 11:34:51] [INFO ] Invariant cache hit.
[2023-03-08 11:34:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:34:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:51] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:34:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:51] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:34:51] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 11:34:51] [INFO ] [Nat]Added 60 Read/Feed constraints in 13 ms returned sat
[2023-03-08 11:34:51] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 11 ms.
[2023-03-08 11:34:51] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 126 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 126 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 126 transition count 180
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 125 transition count 172
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 125 transition count 172
Applied a total of 9 rules in 20 ms. Remains 125 /129 variables (removed 4) and now considering 172/184 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 125/129 places, 172/184 transitions.
// Phase 1: matrix 172 rows 125 cols
[2023-03-08 11:34:51] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 230241 resets, run finished after 1156 ms. (steps per millisecond=865 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95172 resets, run finished after 515 ms. (steps per millisecond=1941 ) properties (out of 1) seen :1
[2023-03-08 11:34:53] [INFO ] Invariant cache hit.
[2023-03-08 11:34:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:53] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-08 11:34:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:34:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:53] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-08 11:34:53] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 11:34:53] [INFO ] [Nat]Added 50 Read/Feed constraints in 10 ms returned sat
[2023-03-08 11:34:53] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 121 transitions) in 10 ms.
[2023-03-08 11:34:53] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 9 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 125/125 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-08 11:34:53] [INFO ] Invariant cache hit.
[2023-03-08 11:34:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 11:34:53] [INFO ] Invariant cache hit.
[2023-03-08 11:34:53] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 11:34:54] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-08 11:34:54] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:34:54] [INFO ] Invariant cache hit.
[2023-03-08 11:34:54] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 125/125 places, 172/172 transitions.
[2023-03-08 11:34:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 230072 resets, run finished after 1182 ms. (steps per millisecond=846 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95531 resets, run finished after 551 ms. (steps per millisecond=1814 ) properties (out of 1) seen :1
[2023-03-08 11:34:55] [INFO ] Invariant cache hit.
[2023-03-08 11:34:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:56] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2023-03-08 11:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:56] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2023-03-08 11:34:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 11:34:56] [INFO ] [Nat]Added 50 Read/Feed constraints in 11 ms returned sat
[2023-03-08 11:34:56] [INFO ] Computed and/alt/rep : 50/123/50 causal constraints (skipped 121 transitions) in 13 ms.
[2023-03-08 11:34:56] [INFO ] Added : 2 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 125/125 places, 172/172 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 172/172 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 172/172 (removed 0) transitions.
[2023-03-08 11:34:56] [INFO ] Invariant cache hit.
[2023-03-08 11:34:56] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 11:34:56] [INFO ] Invariant cache hit.
[2023-03-08 11:34:56] [INFO ] State equation strengthened by 50 read => feed constraints.
[2023-03-08 11:34:56] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
[2023-03-08 11:34:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:34:56] [INFO ] Invariant cache hit.
[2023-03-08 11:34:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 125/125 places, 172/172 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-07 in 4962 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11
// Phase 1: matrix 184 rows 129 cols
[2023-03-08 11:34:56] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2373 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
[2023-03-08 11:34:56] [INFO ] Invariant cache hit.
[2023-03-08 11:34:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:56] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-08 11:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:56] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2023-03-08 11:34:56] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 11:34:56] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2023-03-08 11:34:56] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 13 ms.
[2023-03-08 11:34:56] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 127 transition count 182
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 127 transition count 182
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 125 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 125 transition count 180
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 125 transition count 178
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 124 transition count 177
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 124 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 124 transition count 176
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 123 transition count 168
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 123 transition count 168
Applied a total of 15 rules in 13 ms. Remains 123 /129 variables (removed 6) and now considering 168/184 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 123/129 places, 168/184 transitions.
// Phase 1: matrix 168 rows 123 cols
[2023-03-08 11:34:56] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 229924 resets, run finished after 1169 ms. (steps per millisecond=855 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 96666 resets, run finished after 532 ms. (steps per millisecond=1879 ) properties (out of 1) seen :4
[2023-03-08 11:34:58] [INFO ] Invariant cache hit.
[2023-03-08 11:34:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:58] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:34:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:34:58] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:34:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:34:58] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:34:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 11:34:58] [INFO ] [Nat]Added 49 Read/Feed constraints in 7 ms returned sat
[2023-03-08 11:34:58] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 11 ms.
[2023-03-08 11:34:58] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-08 11:34:58] [INFO ] Invariant cache hit.
[2023-03-08 11:34:58] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 11:34:58] [INFO ] Invariant cache hit.
[2023-03-08 11:34:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 11:34:59] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 11:34:59] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:34:59] [INFO ] Invariant cache hit.
[2023-03-08 11:34:59] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 401 ms. Remains : 123/123 places, 168/168 transitions.
[2023-03-08 11:34:59] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229571 resets, run finished after 1109 ms. (steps per millisecond=901 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96475 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 1) seen :3
[2023-03-08 11:35:00] [INFO ] Invariant cache hit.
[2023-03-08 11:35:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:35:00] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-08 11:35:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:35:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:35:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:35:00] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-08 11:35:00] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 11:35:00] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2023-03-08 11:35:00] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2023-03-08 11:35:01] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-08 11:35:01] [INFO ] Invariant cache hit.
[2023-03-08 11:35:01] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 11:35:01] [INFO ] Invariant cache hit.
[2023-03-08 11:35:01] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-08 11:35:01] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2023-03-08 11:35:01] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:35:01] [INFO ] Invariant cache hit.
[2023-03-08 11:35:01] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 413 ms. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-11 in 4861 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-12
// Phase 1: matrix 184 rows 129 cols
[2023-03-08 11:35:01] [INFO ] Computed 2 place invariants in 8 ms
Incomplete random walk after 10000 steps, including 2289 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 978 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 11:35:01] [INFO ] Invariant cache hit.
[2023-03-08 11:35:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:35:01] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:35:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:35:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:35:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:35:01] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-08 11:35:01] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-08 11:35:01] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2023-03-08 11:35:01] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 132 transitions) in 13 ms.
[2023-03-08 11:35:01] [INFO ] Added : 17 causal constraints over 4 iterations in 74 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 184/184 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 128 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 128 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 127 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 127 transition count 182
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 6 place count 127 transition count 180
Applied a total of 6 rules in 7 ms. Remains 127 /129 variables (removed 2) and now considering 180/184 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 127/129 places, 180/184 transitions.
// Phase 1: matrix 180 rows 127 cols
[2023-03-08 11:35:01] [INFO ] Computed 2 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 229882 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95356 resets, run finished after 543 ms. (steps per millisecond=1841 ) properties (out of 1) seen :0
[2023-03-08 11:35:03] [INFO ] Invariant cache hit.
[2023-03-08 11:35:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 11:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 11:35:03] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:35:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 11:35:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 11:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 11:35:03] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-08 11:35:03] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 11:35:03] [INFO ] [Nat]Added 59 Read/Feed constraints in 13 ms returned sat
[2023-03-08 11:35:03] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 129 transitions) in 13 ms.
[2023-03-08 11:35:03] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-08 11:35:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 11:35:03] [INFO ] Added : 18 causal constraints over 4 iterations in 163 ms. Result :sat
Minimization took 44 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 127/127 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 127/127 places, 180/180 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2023-03-08 11:35:03] [INFO ] Invariant cache hit.
[2023-03-08 11:35:04] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 11:35:04] [INFO ] Invariant cache hit.
[2023-03-08 11:35:04] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-08 11:35:04] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-08 11:35:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:35:04] [INFO ] Invariant cache hit.
[2023-03-08 11:35:04] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 127/127 places, 180/180 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m07-UpperBounds-12 in 2929 ms.
[2023-03-08 11:35:04] [INFO ] Flatten gal took : 41 ms
[2023-03-08 11:35:04] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-08 11:35:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 184 transitions and 727 arcs took 1 ms.
Total runtime 38242 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/693/ub_0_ --maxsum=/tmp/693/ub_1_ --maxsum=/tmp/693/ub_2_
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-07 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-11 5 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA DBSingleClientW-PT-d2m07-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678275365634

--------------------
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
mcc2023
ub formula name DBSingleClientW-PT-d2m07-UpperBounds-07
ub formula formula --maxsum=/tmp/693/ub_0_
ub formula name DBSingleClientW-PT-d2m07-UpperBounds-11
ub formula formula --maxsum=/tmp/693/ub_1_
ub formula name DBSingleClientW-PT-d2m07-UpperBounds-12
ub formula formula --maxsum=/tmp/693/ub_2_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 129 places, 184 transitions and 727 arcs
pnml2lts-sym: Petri net DBSingleClientW_PT_d2m07 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 184->175 groups
pnml2lts-sym: Regrouping took 0.040 real 0.030 user 0.010 sys
pnml2lts-sym: state vector length is 129; there are 175 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: Exploration took 2794857 group checks and 0 next state calls
pnml2lts-sym: reachability took 43.430 real 172.870 user 0.620 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.020 real 0.090 user 0.000 sys
pnml2lts-sym: state space has 13756595 states, 69569 nodes
pnml2lts-sym: Maximum sum of /tmp/693/ub_0_ is: 3
pnml2lts-sym: Maximum sum of /tmp/693/ub_1_ is: 5
pnml2lts-sym: Maximum sum of /tmp/693/ub_2_ is: 1
pnml2lts-sym: group_next: 2611 nodes total
pnml2lts-sym: group_explored: 3384 nodes, 3676 short vectors total
pnml2lts-sym: max token count: 7

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d2m07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d2m07, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814481000317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d2m07.tgz
mv DBSingleClientW-PT-d2m07 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' 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 ;