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-165472292700106.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-d2m09, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r323-tall-165472292700106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Jun 7 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 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 1.6M 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-d2m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1654746042911

Running Version 0
[2022-06-09 03:40:44] [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:40:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 03:40:44] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2022-06-09 03:40:44] [INFO ] Transformed 4763 places.
[2022-06-09 03:40:44] [INFO ] Transformed 2478 transitions.
[2022-06-09 03:40:44] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 267 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:40:45] [INFO ] Computed 6 place invariants in 179 ms
Incomplete random walk after 10000 steps, including 2266 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10000 steps, including 953 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10000 steps, including 981 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 1023 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 907 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 5) seen :2
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 03:40:45] [INFO ] Computed 6 place invariants in 120 ms
[2022-06-09 03:40:46] [INFO ] [Real]Absence check using 2 positive place invariants in 18 ms returned sat
[2022-06-09 03:40:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned unsat
[2022-06-09 03:40:46] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:40:46] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2022-06-09 03:40:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:40:47] [INFO ] [Real]Absence check using state equation in 671 ms returned sat
[2022-06-09 03:40:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:40:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned sat
[2022-06-09 03:40:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2022-06-09 03:40:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:40:48] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2022-06-09 03:40:48] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 03:40:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:40:52] [INFO ] [Nat]Added 1588 Read/Feed constraints in 3621 ms returned unknown
[2022-06-09 03:40:52] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:40:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:40:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:40:53] [INFO ] [Real]Absence check using state equation in 660 ms returned sat
[2022-06-09 03:40:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:40:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2022-06-09 03:40:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:40:53] [INFO ] [Nat]Absence check using state equation in 690 ms returned sat
[2022-06-09 03:40:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:40:58] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4188 ms returned unknown
[2022-06-09 03:40:58] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 03:40:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2022-06-09 03:40:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:40:58] [INFO ] [Real]Absence check using state equation in 579 ms returned sat
[2022-06-09 03:41:01] [INFO ] [Real]Added 1588 Read/Feed constraints in 2335 ms returned sat
[2022-06-09 03:41:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:41:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2022-06-09 03:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:02] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2022-06-09 03:41:06] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4117 ms returned sat
[2022-06-09 03:41:07] [INFO ] Deduced a trap composed of 50 places in 740 ms of which 6 ms to minimize.
[2022-06-09 03:41:07] [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 3
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.verifyPossible(DeadlockTester.java:588)
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:41:07] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2022-06-09 03:41:07] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 03:41:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:07] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2022-06-09 03:41:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2022-06-09 03:41:08] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2022-06-09 03:41:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:08] [INFO ] [Nat]Absence check using state equation in 651 ms returned sat
[2022-06-09 03:41:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-09 03:41:12] [INFO ] [Nat]Added 1588 Read/Feed constraints in 4227 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 3032, 3032, 9, 9] Max seen :[1, 0, 0, 2, 0]
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1137 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.13 ms
Discarding 46 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 196 transitions
Reduce isomorphic transitions removed 214 transitions.
Iterating post reduction 0 with 214 rules applied. Total rules applied 215 place count 1137 transition count 2264
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 605 place count 747 transition count 1220
Iterating global reduction 1 with 390 rules applied. Total rules applied 995 place count 747 transition count 1220
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 1013 place count 747 transition count 1202
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1328 place count 432 transition count 887
Iterating global reduction 2 with 315 rules applied. Total rules applied 1643 place count 432 transition count 887
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1655 place count 432 transition count 875
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1895 place count 192 transition count 534
Iterating global reduction 3 with 240 rules applied. Total rules applied 2135 place count 192 transition count 534
Ensure Unique test removed 209 transitions
Reduce isomorphic transitions removed 209 transitions.
Iterating post reduction 3 with 209 rules applied. Total rules applied 2344 place count 192 transition count 325
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2369 place count 167 transition count 285
Iterating global reduction 4 with 25 rules applied. Total rules applied 2394 place count 167 transition count 285
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 2406 place count 167 transition count 273
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2422 place count 151 transition count 257
Iterating global reduction 5 with 16 rules applied. Total rules applied 2438 place count 151 transition count 257
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2442 place count 151 transition count 253
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2455 place count 138 transition count 240
Iterating global reduction 6 with 13 rules applied. Total rules applied 2468 place count 138 transition count 240
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 2480 place count 138 transition count 228
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2483 place count 135 transition count 219
Iterating global reduction 7 with 3 rules applied. Total rules applied 2486 place count 135 transition count 219
Applied a total of 2486 rules in 265 ms. Remains 135 /1183 variables (removed 1048) and now considering 219/2478 (removed 2259) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/1183 places, 219/2478 transitions.
// Phase 1: matrix 219 rows 135 cols
[2022-06-09 03:41:13] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229839 resets, run finished after 1632 ms. (steps per millisecond=612 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95198 resets, run finished after 690 ms. (steps per millisecond=1449 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95295 resets, run finished after 678 ms. (steps per millisecond=1474 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96399 resets, run finished after 676 ms. (steps per millisecond=1479 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95365 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 4) seen :2
// Phase 1: matrix 219 rows 135 cols
[2022-06-09 03:41:17] [INFO ] Computed 2 place invariants in 6 ms
[2022-06-09 03:41:17] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:17] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-06-09 03:41:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:17] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:17] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:41:17] [INFO ] State equation strengthened by 94 read => feed constraints.
[2022-06-09 03:41:17] [INFO ] [Nat]Added 94 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:41:17] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 2 ms to minimize.
[2022-06-09 03:41:17] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:41:17] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 2 ms to minimize.
[2022-06-09 03:41:17] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2022-06-09 03:41:17] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 250 ms
[2022-06-09 03:41:18] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 167 transitions) in 24 ms.
[2022-06-09 03:41:18] [INFO ] Added : 42 causal constraints over 9 iterations in 230 ms. Result :sat
Minimization took 83 ms.
[2022-06-09 03:41:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:18] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2022-06-09 03:41:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:18] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 03:41:18] [INFO ] [Nat]Added 94 Read/Feed constraints in 25 ms returned sat
[2022-06-09 03:41:18] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:41:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-06-09 03:41:18] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 167 transitions) in 24 ms.
[2022-06-09 03:41:18] [INFO ] Added : 42 causal constraints over 9 iterations in 191 ms. Result :sat
Minimization took 77 ms.
[2022-06-09 03:41:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:18] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:41:18] [INFO ] [Real]Added 94 Read/Feed constraints in 21 ms returned sat
[2022-06-09 03:41:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:19] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:41:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:41:19] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:41:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:41:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2022-06-09 03:41:19] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 167 transitions) in 25 ms.
[2022-06-09 03:41:19] [INFO ] Added : 43 causal constraints over 9 iterations in 192 ms. Result :sat
Minimization took 103 ms.
[2022-06-09 03:41:19] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:19] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-06-09 03:41:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:19] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:19] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:41:19] [INFO ] [Nat]Added 94 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:41:19] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2022-06-09 03:41:19] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:41:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 148 ms
[2022-06-09 03:41:19] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 167 transitions) in 17 ms.
[2022-06-09 03:41:20] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2022-06-09 03:41:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2022-06-09 03:41:20] [INFO ] Added : 45 causal constraints over 9 iterations in 309 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [3032, 3032, 9, 9] Max seen :[0, 0, 4, 0]
Incomplete Parikh walk after 86000 steps, including 17925 resets, run finished after 189 ms. (steps per millisecond=455 ) properties (out of 4) seen :1 could not realise parikh vector
Incomplete Parikh walk after 78500 steps, including 15992 resets, run finished after 137 ms. (steps per millisecond=572 ) properties (out of 4) seen :1 could not realise parikh vector
Incomplete Parikh walk after 36500 steps, including 7165 resets, run finished after 66 ms. (steps per millisecond=553 ) properties (out of 4) seen :2 could not realise parikh vector
Incomplete Parikh walk after 66900 steps, including 13845 resets, run finished after 119 ms. (steps per millisecond=562 ) properties (out of 4) seen :1 could not realise parikh vector
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 219/219 transitions.
Applied a total of 0 rules in 16 ms. Remains 135 /135 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 219/219 transitions.
Starting structural reductions, iteration 0 : 135/135 places, 219/219 transitions.
Applied a total of 0 rules in 10 ms. Remains 135 /135 variables (removed 0) and now considering 219/219 (removed 0) transitions.
// Phase 1: matrix 219 rows 135 cols
[2022-06-09 03:41:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:20] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 219 rows 135 cols
[2022-06-09 03:41:20] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:20] [INFO ] State equation strengthened by 94 read => feed constraints.
[2022-06-09 03:41:21] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
[2022-06-09 03:41:21] [INFO ] Redundant transitions in 11 ms returned []
// Phase 1: matrix 219 rows 135 cols
[2022-06-09 03:41:21] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:41:21] [INFO ] Dead Transitions using invariants and state equation in 89 ms returned []
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 219/219 transitions.
// Phase 1: matrix 219 rows 135 cols
[2022-06-09 03:41:21] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229114 resets, run finished after 1492 ms. (steps per millisecond=670 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 95467 resets, run finished after 677 ms. (steps per millisecond=1477 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 94879 resets, run finished after 661 ms. (steps per millisecond=1512 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96280 resets, run finished after 681 ms. (steps per millisecond=1468 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95114 resets, run finished after 670 ms. (steps per millisecond=1492 ) properties (out of 4) seen :3
// Phase 1: matrix 219 rows 135 cols
[2022-06-09 03:41:25] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:41:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:25] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 03:41:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:25] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:41:25] [INFO ] State equation strengthened by 94 read => feed constraints.
[2022-06-09 03:41:25] [INFO ] [Nat]Added 94 Read/Feed constraints in 23 ms returned sat
[2022-06-09 03:41:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:41:25] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2022-06-09 03:41:25] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2022-06-09 03:41:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2022-06-09 03:41:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 231 ms
[2022-06-09 03:41:25] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 167 transitions) in 15 ms.
[2022-06-09 03:41:26] [INFO ] Added : 42 causal constraints over 9 iterations in 188 ms. Result :sat
Minimization took 76 ms.
[2022-06-09 03:41:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:26] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:41:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:26] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 03:41:26] [INFO ] [Nat]Added 94 Read/Feed constraints in 25 ms returned sat
[2022-06-09 03:41:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:41:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2022-06-09 03:41:26] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 167 transitions) in 16 ms.
[2022-06-09 03:41:26] [INFO ] Added : 42 causal constraints over 9 iterations in 171 ms. Result :sat
Minimization took 80 ms.
[2022-06-09 03:41:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:26] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:41:26] [INFO ] [Real]Added 94 Read/Feed constraints in 25 ms returned sat
[2022-06-09 03:41:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:26] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:41:26] [INFO ] [Nat]Added 94 Read/Feed constraints in 35 ms returned sat
[2022-06-09 03:41:26] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2022-06-09 03:41:27] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:41:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 120 ms
[2022-06-09 03:41:27] [INFO ] Computed and/alt/rep : 51/125/51 causal constraints (skipped 167 transitions) in 14 ms.
[2022-06-09 03:41:27] [INFO ] Added : 43 causal constraints over 9 iterations in 173 ms. Result :sat
Minimization took 108 ms.
[2022-06-09 03:41:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:27] [INFO ] [Real]Absence check using state equation in 35 ms returned unsat
Current structural bounds on expressions (after SMT) : [3032, 3032, 9, 1] Max seen :[0, 0, 4, 1]
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 78500 steps, including 16038 resets, run finished after 137 ms. (steps per millisecond=572 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 36500 steps, including 7256 resets, run finished after 64 ms. (steps per millisecond=570 ) properties (out of 3) seen :1 could not realise parikh vector
Incomplete Parikh walk after 66900 steps, including 13833 resets, run finished after 138 ms. (steps per millisecond=484 ) properties (out of 3) seen :1 could not realise parikh vector
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 135/135 places, 219/219 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 216
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 133 transition count 215
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 133 transition count 215
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 132 transition count 213
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 132 transition count 213
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 132 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 131 transition count 211
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 131 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 130 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 130 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 130 transition count 209
Applied a total of 12 rules in 29 ms. Remains 130 /135 variables (removed 5) and now considering 209/219 (removed 10) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/135 places, 209/219 transitions.
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:27] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229966 resets, run finished after 1394 ms. (steps per millisecond=717 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 95880 resets, run finished after 640 ms. (steps per millisecond=1562 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95884 resets, run finished after 641 ms. (steps per millisecond=1560 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96271 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties (out of 3) seen :4
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:31] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 03:41:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:31] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:41:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:31] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2022-06-09 03:41:31] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-09 03:41:31] [INFO ] [Nat]Added 89 Read/Feed constraints in 23 ms returned sat
[2022-06-09 03:41:31] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:41:31] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2022-06-09 03:41:31] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2022-06-09 03:41:31] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2022-06-09 03:41:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 219 ms
[2022-06-09 03:41:31] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 159 transitions) in 13 ms.
[2022-06-09 03:41:31] [INFO ] Added : 43 causal constraints over 9 iterations in 174 ms. Result :sat
Minimization took 79 ms.
[2022-06-09 03:41:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:31] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:41:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:31] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 03:41:31] [INFO ] [Nat]Added 89 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:41:32] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2022-06-09 03:41:32] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2022-06-09 03:41:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2022-06-09 03:41:32] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 159 transitions) in 13 ms.
[2022-06-09 03:41:32] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2022-06-09 03:41:32] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2022-06-09 03:41:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2022-06-09 03:41:32] [INFO ] Added : 43 causal constraints over 9 iterations in 289 ms. Result :sat
Minimization took 69 ms.
[2022-06-09 03:41:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:32] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-06-09 03:41:32] [INFO ] [Real]Added 89 Read/Feed constraints in 26 ms returned sat
[2022-06-09 03:41:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:32] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:41:32] [INFO ] [Nat]Added 89 Read/Feed constraints in 27 ms returned sat
[2022-06-09 03:41:32] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2022-06-09 03:41:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2022-06-09 03:41:32] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 159 transitions) in 12 ms.
[2022-06-09 03:41:32] [INFO ] Added : 43 causal constraints over 9 iterations in 159 ms. Result :sat
Minimization took 95 ms.
Current structural bounds on expressions (after SMT) : [3032, 3032, 9] Max seen :[0, 0, 4]
Incomplete Parikh walk after 71900 steps, including 13834 resets, run finished after 127 ms. (steps per millisecond=566 ) properties (out of 3) seen :2 could not realise parikh vector
Incomplete Parikh walk after 65700 steps, including 13543 resets, run finished after 108 ms. (steps per millisecond=608 ) properties (out of 3) seen :1 could not realise parikh vector
Incomplete Parikh walk after 65500 steps, including 12954 resets, run finished after 106 ms. (steps per millisecond=617 ) properties (out of 3) seen :1 could not realise parikh vector
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 209/209 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 209/209 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 209/209 transitions.
Starting structural reductions, iteration 0 : 130/130 places, 209/209 transitions.
Applied a total of 0 rules in 6 ms. Remains 130 /130 variables (removed 0) and now considering 209/209 (removed 0) transitions.
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:33] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:41:33] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:33] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:41:33] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-09 03:41:33] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2022-06-09 03:41:33] [INFO ] Redundant transitions in 22 ms returned []
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:33] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:41:33] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Finished structural reductions, in 1 iterations. Remains : 130/130 places, 209/209 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-06
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:34] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2270 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 925 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:34] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 03:41:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:34] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 03:41:34] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-09 03:41:34] [INFO ] [Nat]Added 89 Read/Feed constraints in 25 ms returned sat
[2022-06-09 03:41:34] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2022-06-09 03:41:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-06-09 03:41:34] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2022-06-09 03:41:34] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 0 ms to minimize.
[2022-06-09 03:41:34] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 246 ms
[2022-06-09 03:41:34] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 159 transitions) in 11 ms.
[2022-06-09 03:41:34] [INFO ] Added : 43 causal constraints over 9 iterations in 170 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 65500 steps, including 13008 resets, run finished after 119 ms. (steps per millisecond=550 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 209/209 transitions.
Graph (complete) has 455 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 127 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 127 transition count 192
Applied a total of 7 rules in 11 ms. Remains 127 /130 variables (removed 3) and now considering 192/209 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/130 places, 192/209 transitions.
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:41:34] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229829 resets, run finished after 1254 ms. (steps per millisecond=797 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95971 resets, run finished after 581 ms. (steps per millisecond=1721 ) properties (out of 1) seen :0
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:41:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:36] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:41:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:36] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:41:36] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-06-09 03:41:36] [INFO ] [Nat]Added 72 Read/Feed constraints in 20 ms returned sat
[2022-06-09 03:41:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2022-06-09 03:41:36] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2022-06-09 03:41:36] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2022-06-09 03:41:37] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 5 ms to minimize.
[2022-06-09 03:41:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 210 ms
[2022-06-09 03:41:37] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 142 transitions) in 12 ms.
[2022-06-09 03:41:37] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2022-06-09 03:41:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2022-06-09 03:41:37] [INFO ] Added : 43 causal constraints over 9 iterations in 232 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 59000 steps, including 11593 resets, run finished after 91 ms. (steps per millisecond=648 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 127/127 places, 192/192 transitions.
Applied a total of 0 rules in 5 ms. Remains 127 /127 variables (removed 0) and now considering 192/192 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 192/192 transitions.
Starting structural reductions, iteration 0 : 127/127 places, 192/192 transitions.
Applied a total of 0 rules in 4 ms. Remains 127 /127 variables (removed 0) and now considering 192/192 (removed 0) transitions.
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:41:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:37] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:41:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:37] [INFO ] State equation strengthened by 72 read => feed constraints.
[2022-06-09 03:41:37] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2022-06-09 03:41:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 192 rows 127 cols
[2022-06-09 03:41:37] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:41:37] [INFO ] Dead Transitions using invariants and state equation in 92 ms returned []
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 192/192 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-06 in 4031 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-08
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2288 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 946 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:38] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:41:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:38] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-06-09 03:41:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:38] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2022-06-09 03:41:38] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-09 03:41:38] [INFO ] [Nat]Added 89 Read/Feed constraints in 28 ms returned sat
[2022-06-09 03:41:38] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2022-06-09 03:41:38] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2022-06-09 03:41:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2022-06-09 03:41:38] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 159 transitions) in 11 ms.
[2022-06-09 03:41:38] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2022-06-09 03:41:38] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2022-06-09 03:41:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2022-06-09 03:41:38] [INFO ] Added : 43 causal constraints over 9 iterations in 292 ms. Result :sat
Minimization took 65 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 65700 steps, including 13496 resets, run finished after 109 ms. (steps per millisecond=602 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 209/209 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 129 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 129 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 129 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 126 transition count 185
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 126 transition count 185
Applied a total of 11 rules in 12 ms. Remains 126 /130 variables (removed 4) and now considering 185/209 (removed 24) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/130 places, 185/209 transitions.
// Phase 1: matrix 185 rows 126 cols
[2022-06-09 03:41:38] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230077 resets, run finished after 1213 ms. (steps per millisecond=824 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 95935 resets, run finished after 553 ms. (steps per millisecond=1808 ) properties (out of 1) seen :0
// Phase 1: matrix 185 rows 126 cols
[2022-06-09 03:41:40] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 03:41:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:40] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:41:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:40] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 03:41:40] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 03:41:40] [INFO ] [Nat]Added 66 Read/Feed constraints in 15 ms returned sat
[2022-06-09 03:41:40] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 135 transitions) in 11 ms.
[2022-06-09 03:41:40] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2022-06-09 03:41:41] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2022-06-09 03:41:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2022-06-09 03:41:41] [INFO ] Added : 43 causal constraints over 9 iterations in 266 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 46800 steps, including 9302 resets, run finished after 70 ms. (steps per millisecond=668 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 185/185 transitions.
Starting structural reductions, iteration 0 : 126/126 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 185/185 (removed 0) transitions.
// Phase 1: matrix 185 rows 126 cols
[2022-06-09 03:41:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:41] [INFO ] Implicit Places using invariants in 69 ms returned []
// Phase 1: matrix 185 rows 126 cols
[2022-06-09 03:41:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:41] [INFO ] State equation strengthened by 66 read => feed constraints.
[2022-06-09 03:41:41] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
[2022-06-09 03:41:41] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 185 rows 126 cols
[2022-06-09 03:41:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 03:41:41] [INFO ] Dead Transitions using invariants and state equation in 108 ms returned []
Finished structural reductions, in 1 iterations. Remains : 126/126 places, 185/185 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-08 in 3715 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-12
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:41] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2274 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 1000 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :2
// Phase 1: matrix 209 rows 130 cols
[2022-06-09 03:41:41] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:41] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 11 ms returned sat
[2022-06-09 03:41:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:41] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-06-09 03:41:41] [INFO ] State equation strengthened by 89 read => feed constraints.
[2022-06-09 03:41:41] [INFO ] [Real]Added 89 Read/Feed constraints in 24 ms returned sat
[2022-06-09 03:41:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:41] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:41] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2022-06-09 03:41:42] [INFO ] [Nat]Added 89 Read/Feed constraints in 29 ms returned sat
[2022-06-09 03:41:42] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-06-09 03:41:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-06-09 03:41:42] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 159 transitions) in 20 ms.
[2022-06-09 03:41:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2022-06-09 03:41:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2022-06-09 03:41:42] [INFO ] Added : 43 causal constraints over 9 iterations in 240 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Incomplete Parikh walk after 70600 steps, including 13974 resets, run finished after 120 ms. (steps per millisecond=588 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 130/130 places, 209/209 transitions.
Graph (complete) has 455 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 129 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 126 transition count 191
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 126 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 12 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 123 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 123 transition count 168
Applied a total of 18 rules in 10 ms. Remains 123 /130 variables (removed 7) and now considering 168/209 (removed 41) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/130 places, 168/209 transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:42] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230003 resets, run finished after 1104 ms. (steps per millisecond=905 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 96255 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 1) seen :4
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:44] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:41:44] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:41:44] [INFO ] [Real]Added 49 Read/Feed constraints in 13 ms returned sat
[2022-06-09 03:41:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:44] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2022-06-09 03:41:44] [INFO ] [Nat]Added 49 Read/Feed constraints in 18 ms returned sat
[2022-06-09 03:41:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2022-06-09 03:41:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2022-06-09 03:41:44] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 9 ms.
[2022-06-09 03:41:44] [INFO ] Added : 43 causal constraints over 9 iterations in 114 ms. Result :sat
Minimization took 73 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 41500 steps, including 8009 resets, run finished after 57 ms. (steps per millisecond=728 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, 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 1 iterations. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:44] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:44] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:44] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:41:45] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
[2022-06-09 03:41:45] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:45] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 03:41:45] [INFO ] Dead Transitions using invariants and state equation in 70 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:45] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230073 resets, run finished after 1106 ms. (steps per millisecond=904 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 96631 resets, run finished after 504 ms. (steps per millisecond=1984 ) properties (out of 1) seen :4
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:46] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:41:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 03:41:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:46] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 03:41:46] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:41:46] [INFO ] [Real]Added 49 Read/Feed constraints in 14 ms returned sat
[2022-06-09 03:41:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 03:41:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 03:41:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 03:41:46] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2022-06-09 03:41:46] [INFO ] [Nat]Added 49 Read/Feed constraints in 17 ms returned sat
[2022-06-09 03:41:46] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2022-06-09 03:41:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2022-06-09 03:41:46] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 10 ms.
[2022-06-09 03:41:47] [INFO ] Added : 43 causal constraints over 9 iterations in 124 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Incomplete Parikh walk after 41500 steps, including 7978 resets, run finished after 59 ms. (steps per millisecond=703 ) properties (out of 1) seen :1 could not realise parikh vector
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions, 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.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions, 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.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:41:47] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:47] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 03:41:47] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 03:41:47] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2022-06-09 03:41:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 03:41:47] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 03:41:47] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m09-UpperBounds-12 in 5904 ms.
[2022-06-09 03:41:47] [INFO ] Flatten gal took : 64 ms
[2022-06-09 03:41:47] [INFO ] Applying decomposition
[2022-06-09 03:41:47] [INFO ] Flatten gal took : 18 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/graph15503220069858872851.txt, -o, /tmp/graph15503220069858872851.bin, -w, /tmp/graph15503220069858872851.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/graph15503220069858872851.bin, -l, -1, -v, -w, /tmp/graph15503220069858872851.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-09 03:41:47] [INFO ] Decomposing Gal with order
[2022-06-09 03:41:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 03:41:48] [INFO ] Removed a total of 225 redundant transitions.
[2022-06-09 03:41:48] [INFO ] Flatten gal took : 71 ms
[2022-06-09 03:41:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 138 labels/synchronizations in 11 ms.
[2022-06-09 03:41:48] [INFO ] Time to serialize gal into /tmp/UpperBounds6438382314089738230.gal : 13 ms
[2022-06-09 03:41:48] [INFO ] Time to serialize properties into /tmp/UpperBounds8696947865197922357.prop : 1 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/UpperBounds6438382314089738230.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8696947865197922357.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/UpperBounds6438382314089738230.gal -t CGAL -reachable-file /tmp/UpperBounds8696947865197922357.prop --nowitness
Loading property file /tmp/UpperBounds8696947865197922357.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,2.52077e+08,16.9093,261084,4772,1655,258949,20383,524,1.39485e+06,222,365398,0
Total reachable state count : 252077494

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m09-UpperBounds-06 :0 <= u5.l1605 <= 1
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-06 1 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-d2m09-UpperBounds-06,0,18.3558,261084,1,0,258949,20383,647,1.39485e+06,274,365398,1952
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m09-UpperBounds-08 :0 <= i2.u13.l3025 <= 1
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-08 1 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-d2m09-UpperBounds-08,0,18.364,261084,1,0,258949,20383,671,1.39485e+06,279,365398,1978
Min sum of variable value : 0
Maximum sum along a path : 7
Bounds property DBSingleClientW-PT-d2m09-UpperBounds-12 :0 <= i1.u3.l3666 <= 7
FORMULA DBSingleClientW-PT-d2m09-UpperBounds-12 7 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-d2m09-UpperBounds-12,0,18.365,261084,1,0,258949,20383,691,1.39485e+06,296,365398,2033

BK_STOP 1654746127717

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

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