Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 8.2K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 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-d1m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654745137022

Running Version 0
[2022-06-09 03:25:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 03:25:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:25:38] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2022-06-09 03:25:38] [INFO ] Transformed 1440 places.
[2022-06-09 03:25:38] [INFO ] Transformed 672 transitions.
[2022-06-09 03:25:38] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 147 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:25:38] [INFO ] Computed 6 place invariants in 50 ms
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 923 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 1006 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :2
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 03:25:39] [INFO ] Computed 6 place invariants in 23 ms
[2022-06-09 03:25:39] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-06-09 03:25:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:25:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:39] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2022-06-09 03:25:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-09 03:25:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2022-06-09 03:25:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:39] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2022-06-09 03:25:39] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 03:25:40] [INFO ] [Nat]Added 418 Read/Feed constraints in 234 ms returned sat
[2022-06-09 03:25:40] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2022-06-09 03:25:40] [INFO ] Deduced a trap composed of 100 places in 171 ms of which 2 ms to minimize.
[2022-06-09 03:25:40] [INFO ] Deduced a trap composed of 28 places in 139 ms of which 2 ms to minimize.
[2022-06-09 03:25:40] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 2 ms to minimize.
[2022-06-09 03:25:41] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 1 ms to minimize.
[2022-06-09 03:25:41] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2022-06-09 03:25:41] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 0 ms to minimize.
[2022-06-09 03:25:41] [INFO ] Deduced a trap composed of 28 places in 130 ms of which 0 ms to minimize.
[2022-06-09 03:25:41] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2022-06-09 03:25:41] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 1 ms to minimize.
[2022-06-09 03:25:42] [INFO ] Deduced a trap composed of 132 places in 121 ms of which 0 ms to minimize.
[2022-06-09 03:25:42] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 1 ms to minimize.
[2022-06-09 03:25:42] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 1 ms to minimize.
[2022-06-09 03:25:42] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2022-06-09 03:25:42] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 0 ms to minimize.
[2022-06-09 03:25:42] [INFO ] Deduced a trap composed of 121 places in 117 ms of which 1 ms to minimize.
[2022-06-09 03:25:43] [INFO ] Deduced a trap composed of 121 places in 120 ms of which 1 ms to minimize.
[2022-06-09 03:25:43] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 0 ms to minimize.
[2022-06-09 03:25:43] [INFO ] Deduced a trap composed of 125 places in 119 ms of which 1 ms to minimize.
[2022-06-09 03:25:43] [INFO ] Deduced a trap composed of 185 places in 139 ms of which 0 ms to minimize.
[2022-06-09 03:25:43] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 1 ms to minimize.
[2022-06-09 03:25:44] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 4277 ms
[2022-06-09 03:25:44] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 115 ms.
[2022-06-09 03:25:44] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 1 ms to minimize.
[2022-06-09 03:25:44] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
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:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-09 03:25:44] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:25:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:25:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:44] [INFO ] [Real]Absence check using state equation in 123 ms returned sat
[2022-06-09 03:25:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:25:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 03:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:45] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-09 03:25:45] [INFO ] [Nat]Added 418 Read/Feed constraints in 302 ms returned sat
[2022-06-09 03:25:45] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 0 ms to minimize.
[2022-06-09 03:25:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2022-06-09 03:25:45] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 66 ms.
[2022-06-09 03:25:46] [INFO ] Added : 118 causal constraints over 24 iterations in 1183 ms. Result :sat
Minimization took 644 ms.
[2022-06-09 03:25:47] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:25:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:47] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2022-06-09 03:25:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 03:25:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 03:25:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:47] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-06-09 03:25:48] [INFO ] [Nat]Added 418 Read/Feed constraints in 324 ms returned sat
[2022-06-09 03:25:48] [INFO ] Deduced a trap composed of 21 places in 132 ms of which 1 ms to minimize.
[2022-06-09 03:25:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2022-06-09 03:25:48] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 56 ms.
[2022-06-09 03:25:49] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 0 ms to minimize.
[2022-06-09 03:25:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2022-06-09 03:25:49] [INFO ] Added : 117 causal constraints over 24 iterations in 1397 ms. Result :sat
Minimization took 813 ms.
Current structural bounds on expressions (after SMT) : [7, 160, 6] Max seen :[0, 0, 2]
Incomplete Parikh walk after 47700 steps, including 9674 resets, run finished after 264 ms. (steps per millisecond=180 ) properties (out of 3) seen :1 could not realise parikh vector
Incomplete Parikh walk after 45400 steps, including 8736 resets, run finished after 219 ms. (steps per millisecond=207 ) properties (out of 3) seen :2 could not realise parikh vector
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.5 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 326 transition count 603
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 165 place count 231 transition count 329
Iterating global reduction 1 with 95 rules applied. Total rules applied 260 place count 231 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 264 place count 231 transition count 325
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 338 place count 157 transition count 251
Iterating global reduction 2 with 74 rules applied. Total rules applied 412 place count 157 transition count 251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 417 place count 157 transition count 246
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 459 place count 115 transition count 179
Iterating global reduction 3 with 42 rules applied. Total rules applied 501 place count 115 transition count 179
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 525 place count 115 transition count 155
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 536 place count 104 transition count 137
Iterating global reduction 4 with 11 rules applied. Total rules applied 547 place count 104 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 548 place count 104 transition count 136
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 557 place count 95 transition count 127
Iterating global reduction 5 with 9 rules applied. Total rules applied 566 place count 95 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 569 place count 95 transition count 124
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 576 place count 88 transition count 117
Iterating global reduction 6 with 7 rules applied. Total rules applied 583 place count 88 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 586 place count 88 transition count 114
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 588 place count 86 transition count 106
Iterating global reduction 7 with 2 rules applied. Total rules applied 590 place count 86 transition count 106
Applied a total of 590 rules in 89 ms. Remains 86 /347 variables (removed 261) and now considering 106/672 (removed 566) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/347 places, 106/672 transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:51] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229731 resets, run finished after 921 ms. (steps per millisecond=1085 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 98433 resets, run finished after 444 ms. (steps per millisecond=2252 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 98234 resets, run finished after 434 ms. (steps per millisecond=2304 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 99546 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 3) seen :4
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:53] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:25:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:53] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 03:25:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:53] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:25:53] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 03:25:53] [INFO ] [Nat]Added 32 Read/Feed constraints in 14 ms returned sat
[2022-06-09 03:25:53] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2022-06-09 03:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2022-06-09 03:25:53] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 7 ms.
[2022-06-09 03:25:53] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2022-06-09 03:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2022-06-09 03:25:53] [INFO ] Added : 28 causal constraints over 6 iterations in 114 ms. Result :sat
Minimization took 22 ms.
[2022-06-09 03:25:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:53] [INFO ] [Real]Absence check using state equation in 19 ms returned unsat
[2022-06-09 03:25:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:53] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:25:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:25:53] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-06-09 03:25:54] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2022-06-09 03:25:54] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2022-06-09 03:25:54] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2022-06-09 03:25:54] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-06-09 03:25:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 180 ms
[2022-06-09 03:25:54] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 7 ms.
[2022-06-09 03:25:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-06-09 03:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-09 03:25:54] [INFO ] Added : 26 causal constraints over 6 iterations in 112 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [7, 1, 6] Max seen :[0, 1, 4]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 13200 steps, including 2867 resets, run finished after 32 ms. (steps per millisecond=412 ) properties (out of 2) seen :1 could not realise parikh vector
Incomplete Parikh walk after 21000 steps, including 3768 resets, run finished after 25 ms. (steps per millisecond=840 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:54] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229706 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 2) seen :3
Incomplete Best-First random walk after 1000001 steps, including 98122 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 99704 resets, run finished after 403 ms. (steps per millisecond=2481 ) properties (out of 2) seen :4
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:56] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:25:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-06-09 03:25:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:25:56] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 03:25:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:25:56] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2022-06-09 03:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2022-06-09 03:25:56] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 6 ms.
[2022-06-09 03:25:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2022-06-09 03:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-09 03:25:56] [INFO ] Added : 28 causal constraints over 6 iterations in 113 ms. Result :sat
Minimization took 23 ms.
[2022-06-09 03:25:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:56] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:25:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:56] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:25:56] [INFO ] [Nat]Added 32 Read/Feed constraints in 9 ms returned sat
[2022-06-09 03:25:56] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:25:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2022-06-09 03:25:56] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2022-06-09 03:25:56] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2022-06-09 03:25:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 146 ms
[2022-06-09 03:25:56] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 5 ms.
[2022-06-09 03:25:56] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2022-06-09 03:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2022-06-09 03:25:56] [INFO ] Added : 26 causal constraints over 6 iterations in 107 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [7, 6] Max seen :[0, 4]
Incomplete Parikh walk after 13200 steps, including 2882 resets, run finished after 25 ms. (steps per millisecond=528 ) properties (out of 2) seen :1 could not realise parikh vector
Incomplete Parikh walk after 21000 steps, including 3746 resets, run finished after 23 ms. (steps per millisecond=913 ) properties (out of 2) seen :1 could not realise parikh vector
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
Starting structural reductions, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:56] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:25:56] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:56] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 03:25:56] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2022-06-09 03:25:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:56] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:56] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-02
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:57] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2324 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 929 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:57] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:25:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:57] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2022-06-09 03:25:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-09 03:25:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:57] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-06-09 03:25:57] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 03:25:57] [INFO ] [Nat]Added 32 Read/Feed constraints in 7 ms returned sat
[2022-06-09 03:25:57] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2022-06-09 03:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-06-09 03:25:57] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 8 ms.
[2022-06-09 03:25:57] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2022-06-09 03:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2022-06-09 03:25:57] [INFO ] Added : 28 causal constraints over 6 iterations in 103 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 21000 steps, including 3745 resets, run finished after 30 ms. (steps per millisecond=700 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 106/106 transitions.
Graph (complete) has 269 edges and 86 vertex of which 85 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 105
Applied a total of 2 rules in 15 ms. Remains 85 /86 variables (removed 1) and now considering 105/106 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/86 places, 105/106 transitions.
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 03:25:57] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229590 resets, run finished after 919 ms. (steps per millisecond=1088 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98836 resets, run finished after 432 ms. (steps per millisecond=2314 ) properties (out of 1) seen :1
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 03:25:58] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 03:25:58] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:59] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
Current structural bounds on expressions (after SMT) : [1] Max seen :[1]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-02 in 2014 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-13
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:59] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :2
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 03:25:59] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:25:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:59] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 03:25:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:25:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:25:59] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 03:25:59] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 03:25:59] [INFO ] [Nat]Added 32 Read/Feed constraints in 6 ms returned sat
[2022-06-09 03:25:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2022-06-09 03:25:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2022-06-09 03:25:59] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-06-09 03:25:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 116 ms
[2022-06-09 03:25:59] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 8 ms.
[2022-06-09 03:25:59] [INFO ] Added : 28 causal constraints over 6 iterations in 64 ms. Result :sat
Minimization took 46 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 18900 steps, including 3875 resets, run finished after 21 ms. (steps per millisecond=900 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 86/86 places, 106/106 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 85 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 83 transition count 100
Applied a total of 8 rules in 10 ms. Remains 83 /86 variables (removed 3) and now considering 100/106 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/86 places, 100/106 transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:25:59] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229583 resets, run finished after 767 ms. (steps per millisecond=1303 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 99300 resets, run finished after 370 ms. (steps per millisecond=2702 ) properties (out of 1) seen :4
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:00] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:26:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:00] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 03:26:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:00] [INFO ] [Nat]Added 30 Read/Feed constraints in 13 ms returned sat
[2022-06-09 03:26:00] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2022-06-09 03:26:00] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2022-06-09 03:26:00] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2022-06-09 03:26:00] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2022-06-09 03:26:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 154 ms
[2022-06-09 03:26:00] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 70 transitions) in 5 ms.
[2022-06-09 03:26:00] [INFO ] Added : 25 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 13100 steps, including 2928 resets, run finished after 16 ms. (steps per millisecond=818 ) properties (out of 1) seen :2 could not realise parikh vector
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Starting structural reductions, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:00] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:00] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:26:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2022-06-09 03:26:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:01] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:01] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229913 resets, run finished after 761 ms. (steps per millisecond=1314 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 99492 resets, run finished after 376 ms. (steps per millisecond=2659 ) properties (out of 1) seen :4
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:02] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:26:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:26:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:02] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 03:26:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:26:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:26:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:26:02] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2022-06-09 03:26:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:02] [INFO ] [Nat]Added 30 Read/Feed constraints in 8 ms returned sat
[2022-06-09 03:26:02] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2022-06-09 03:26:02] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2022-06-09 03:26:02] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2022-06-09 03:26:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2022-06-09 03:26:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 140 ms
[2022-06-09 03:26:02] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 70 transitions) in 5 ms.
[2022-06-09 03:26:02] [INFO ] Added : 25 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 13100 steps, including 2904 resets, run finished after 15 ms. (steps per millisecond=873 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Starting structural reductions, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:02] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:26:02] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:26:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 03:26:02] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2022-06-09 03:26:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 03:26:02] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:26:02] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-13 in 3791 ms.
[2022-06-09 03:26:03] [INFO ] Flatten gal took : 40 ms
[2022-06-09 03:26:03] [INFO ] Applying decomposition
[2022-06-09 03:26:03] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16776291029366438798.txt, -o, /tmp/graph16776291029366438798.bin, -w, /tmp/graph16776291029366438798.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph16776291029366438798.bin, -l, -1, -v, -w, /tmp/graph16776291029366438798.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:26:03] [INFO ] Decomposing Gal with order
[2022-06-09 03:26:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:26:03] [INFO ] Removed a total of 95 redundant transitions.
[2022-06-09 03:26:03] [INFO ] Flatten gal took : 48 ms
[2022-06-09 03:26:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 8 ms.
[2022-06-09 03:26:03] [INFO ] Time to serialize gal into /tmp/UpperBounds12653461643294259673.gal : 5 ms
[2022-06-09 03:26:03] [INFO ] Time to serialize properties into /tmp/UpperBounds3365553412324571263.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds12653461643294259673.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds3365553412324571263.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds12653461643294259673.gal -t CGAL -reachable-file /tmp/UpperBounds3365553412324571263.prop --nowitness
Loading property file /tmp/UpperBounds3365553412324571263.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,561110,0.376268,16168,935,533,18570,3212,329,39247,143,22580,0
Total reachable state count : 561110

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-13 :0 <= i0.u11.l1088 <= 4
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m06-UpperBounds-13,0,0.410934,15760,1,0,18570,3212,425,39247,170,22580,548

BK_STOP 1654745164666

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is DBSingleClientW-PT-d1m06, 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 r323-tall-165472292600076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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