Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 12:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 12 12:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 12:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 12:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.6M May 18 16:42 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-d2m04-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d2m04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716297931042

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:25:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 13:25:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:25:32] [INFO ] Load time of PNML (sax parser for PT used): 189 ms
[2024-05-21 13:25:32] [INFO ] Transformed 4763 places.
[2024-05-21 13:25:32] [INFO ] Transformed 2478 transitions.
[2024-05-21 13:25:32] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 3580 places in 28 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 2478 rows 1183 cols
[2024-05-21 13:25:32] [INFO ] Computed 6 invariants in 160 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
RANDOM walk for 10000 steps (2279 resets) in 358 ms. (27 steps per ms)
BEST_FIRST walk for 40001 steps (3760 resets) in 224 ms. (177 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
[2024-05-21 13:25:33] [INFO ] Invariant cache hit.
[2024-05-21 13:25:33] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-21 13:25:33] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 16 ms returned sat
[2024-05-21 13:25:34] [INFO ] [Real]Absence check using state equation in 672 ms returned sat
[2024-05-21 13:25:34] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2024-05-21 13:25:35] [INFO ] [Real]Added 1588 Read/Feed constraints in 788 ms returned sat
[2024-05-21 13:25:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:25:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 29 ms returned sat
[2024-05-21 13:25:36] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 20 ms returned sat
[2024-05-21 13:25:36] [INFO ] [Nat]Absence check using state equation in 769 ms returned sat
[2024-05-21 13:25:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 13:25:38] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1619 ms returned unknown
[2024-05-21 13:25:38] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 13:25:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:25:39] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2024-05-21 13:25:40] [INFO ] [Real]Added 1588 Read/Feed constraints in 788 ms returned sat
[2024-05-21 13:25:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:25:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 15 ms returned sat
[2024-05-21 13:25:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 10 ms returned sat
[2024-05-21 13:25:40] [INFO ] [Nat]Absence check using state equation in 635 ms returned sat
[2024-05-21 13:25:42] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 13:25:42] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1462 ms returned sat
[2024-05-21 13:25:43] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 731 ms.
[2024-05-21 13:25:43] [INFO ] Added : 9 causal constraints over 2 iterations in 1394 ms. Result :sat
Minimization took 646 ms.
[2024-05-21 13:25:44] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-21 13:25:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:25:45] [INFO ] [Real]Absence check using state equation in 652 ms returned sat
[2024-05-21 13:25:46] [INFO ] [Real]Added 1588 Read/Feed constraints in 736 ms returned sat
[2024-05-21 13:25:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:25:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:25:46] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-21 13:25:46] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2024-05-21 13:25:48] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-21 13:25:48] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1635 ms returned unknown
[2024-05-21 13:25:48] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2024-05-21 13:25:48] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:25:49] [INFO ] [Real]Absence check using state equation in 714 ms returned sat
[2024-05-21 13:25:50] [INFO ] [Real]Added 1588 Read/Feed constraints in 739 ms returned sat
[2024-05-21 13:25:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:25:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-21 13:25:50] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2024-05-21 13:25:51] [INFO ] [Nat]Absence check using state equation in 672 ms returned sat
[2024-05-21 13:25:52] [INFO ] [Nat]Added 1588 Read/Feed constraints in 1012 ms returned sat
[2024-05-21 13:25:52] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 604 ms.
[2024-05-21 13:25:54] [INFO ] Deduced a trap composed of 33 places in 720 ms of which 66 ms to minimize.
[2024-05-21 13:25:55] [INFO ] Deduced a trap composed of 38 places in 672 ms of which 11 ms to minimize.
[2024-05-21 13:25:55] [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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
Support contains 4 out of 1183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Graph (complete) has 4476 edges and 1183 vertex of which 1136 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.8 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 390 places :
Symmetric choice reduction at 1 with 390 rule applications. Total rules 608 place count 746 transition count 1201
Iterating global reduction 1 with 390 rules applied. Total rules applied 998 place count 746 transition count 1201
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1007 place count 746 transition count 1192
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1322 place count 431 transition count 877
Iterating global reduction 2 with 315 rules applied. Total rules applied 1637 place count 431 transition count 877
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1649 place count 431 transition count 865
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1888 place count 192 transition count 525
Iterating global reduction 3 with 239 rules applied. Total rules applied 2127 place count 192 transition count 525
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2337 place count 192 transition count 315
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2362 place count 167 transition count 275
Iterating global reduction 4 with 25 rules applied. Total rules applied 2387 place count 167 transition count 275
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2393 place count 167 transition count 269
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2409 place count 151 transition count 253
Iterating global reduction 5 with 16 rules applied. Total rules applied 2425 place count 151 transition count 253
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2429 place count 151 transition count 249
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2442 place count 138 transition count 236
Iterating global reduction 6 with 13 rules applied. Total rules applied 2455 place count 138 transition count 236
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 2465 place count 138 transition count 226
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 2468 place count 135 transition count 217
Iterating global reduction 7 with 3 rules applied. Total rules applied 2471 place count 135 transition count 217
Applied a total of 2471 rules in 241 ms. Remains 135 /1183 variables (removed 1048) and now considering 217/2478 (removed 2261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 135/1183 places, 217/2478 transitions.
// Phase 1: matrix 217 rows 135 cols
[2024-05-21 13:25:55] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
RANDOM walk for 1000000 steps (230207 resets) in 1369 ms. (729 steps per ms)
BEST_FIRST walk for 4000003 steps (383368 resets) in 2444 ms. (1635 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
[2024-05-21 13:25:59] [INFO ] Invariant cache hit.
[2024-05-21 13:25:59] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:25:59] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-21 13:25:59] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 13:25:59] [INFO ] [Real]Added 90 Read/Feed constraints in 18 ms returned sat
[2024-05-21 13:25:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:25:59] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:25:59] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 13:25:59] [INFO ] [Nat]Added 90 Read/Feed constraints in 26 ms returned sat
[2024-05-21 13:25:59] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-21 13:25:59] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 13:25:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2024-05-21 13:25:59] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 18 ms.
[2024-05-21 13:26:00] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 13:26:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2024-05-21 13:26:00] [INFO ] Added : 15 causal constraints over 3 iterations in 211 ms. Result :sat
Minimization took 127 ms.
[2024-05-21 13:26:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:26:00] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 13:26:00] [INFO ] [Real]Added 90 Read/Feed constraints in 23 ms returned sat
[2024-05-21 13:26:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:26:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:26:00] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 13:26:00] [INFO ] [Nat]Added 90 Read/Feed constraints in 22 ms returned sat
[2024-05-21 13:26:00] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 33 ms.
[2024-05-21 13:26:00] [INFO ] Added : 10 causal constraints over 2 iterations in 94 ms. Result :sat
Minimization took 129 ms.
[2024-05-21 13:26:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:26:00] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-05-21 13:26:00] [INFO ] [Real]Added 90 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:26:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:26:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:26:00] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 13:26:01] [INFO ] [Nat]Added 90 Read/Feed constraints in 39 ms returned sat
[2024-05-21 13:26:01] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 19 ms.
[2024-05-21 13:26:01] [INFO ] Added : 13 causal constraints over 3 iterations in 80 ms. Result :sat
Minimization took 116 ms.
[2024-05-21 13:26:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:26:01] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 13:26:01] [INFO ] [Real]Added 90 Read/Feed constraints in 13 ms returned sat
[2024-05-21 13:26:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:26:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:26:01] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 13:26:01] [INFO ] [Nat]Added 90 Read/Feed constraints in 19 ms returned sat
[2024-05-21 13:26:01] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 21 ms.
[2024-05-21 13:26:01] [INFO ] Added : 16 causal constraints over 4 iterations in 123 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 217/217 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 135/135 places, 217/217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 217/217 transitions.
Applied a total of 0 rules in 14 ms. Remains 135 /135 variables (removed 0) and now considering 217/217 (removed 0) transitions.
[2024-05-21 13:26:01] [INFO ] Invariant cache hit.
[2024-05-21 13:26:01] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 13:26:01] [INFO ] Invariant cache hit.
[2024-05-21 13:26:02] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 13:26:02] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-21 13:26:02] [INFO ] Redundant transitions in 7 ms returned []
Running 216 sub problems to find dead transitions.
[2024-05-21 13:26:02] [INFO ] Invariant cache hit.
[2024-05-21 13:26:02] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/352 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 90/227 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (OVERLAPS) 0/352 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 352/352 variables, and 227 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6630 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (OVERLAPS) 217/352 variables, 135/137 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 90/227 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 216/443 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 8 (OVERLAPS) 0/352 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 352/352 variables, and 443 constraints, problems are : Problem set: 0 solved, 216 unsolved in 13833 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 135/135 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints]
After SMT, in 20876ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 20887ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21349 ms. Remains : 135/135 places, 217/217 transitions.
RANDOM walk for 40000 steps (9276 resets) in 1107 ms. (36 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (3901 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3711 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3867 resets) in 153 ms. (259 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3810 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3829 resets) in 84 ms. (470 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3862 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (3798 resets) in 93 ms. (425 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (3894 resets) in 122 ms. (325 steps per ms) remains 8/8 properties
Probably explored full state space saw : 26880 states, properties seen :4
Probabilistic random walk after 65853 steps, saw 26880 distinct states, run finished after 225 ms. (steps per millisecond=292 ) properties seen :4
Explored full state space saw : 26979 states, properties seen :0
Exhaustive walk after 65957 steps, saw 26979 distinct states, run finished after 245 ms. (steps per millisecond=269 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0, 0] Max Struct:[1597, 7, 7, 6]
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1597]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1597]
[2024-05-21 13:26:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1597]
RANDOM walk for 10000 steps (2264 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10001 steps (992 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1597]
[2024-05-21 13:26:24] [INFO ] Invariant cache hit.
[2024-05-21 13:26:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:26:24] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 13:26:24] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 13:26:24] [INFO ] [Real]Added 90 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:26:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:26:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:26:24] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-21 13:26:24] [INFO ] [Nat]Added 90 Read/Feed constraints in 27 ms returned sat
[2024-05-21 13:26:24] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 2 ms to minimize.
[2024-05-21 13:26:24] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 13:26:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 159 ms
[2024-05-21 13:26:24] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 15 ms.
[2024-05-21 13:26:25] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-21 13:26:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2024-05-21 13:26:25] [INFO ] Added : 15 causal constraints over 3 iterations in 191 ms. Result :sat
Minimization took 123 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1597]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1597]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 217/217 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 214
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 129 transition count 210
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 129 transition count 210
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 17 place count 129 transition count 205
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 21 place count 125 transition count 178
Iterating global reduction 1 with 4 rules applied. Total rules applied 25 place count 125 transition count 178
Applied a total of 25 rules in 21 ms. Remains 125 /135 variables (removed 10) and now considering 178/217 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 125/135 places, 178/217 transitions.
// Phase 1: matrix 178 rows 125 cols
[2024-05-21 13:26:25] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1597]
RANDOM walk for 1000000 steps (229833 resets) in 1146 ms. (871 steps per ms)
BEST_FIRST walk for 1000001 steps (96334 resets) in 522 ms. (1912 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1597]
[2024-05-21 13:26:26] [INFO ] Invariant cache hit.
[2024-05-21 13:26:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:26:27] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-21 13:26:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:26:27] [INFO ] [Real]Added 58 Read/Feed constraints in 12 ms returned sat
[2024-05-21 13:26:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:26:27] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:26:27] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 13:26:27] [INFO ] [Nat]Added 58 Read/Feed constraints in 18 ms returned sat
[2024-05-21 13:26:27] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-21 13:26:27] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-05-21 13:26:27] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-21 13:26:27] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 225 ms
[2024-05-21 13:26:27] [INFO ] Computed and/alt/rep : 49/117/49 causal constraints (skipped 128 transitions) in 19 ms.
[2024-05-21 13:26:27] [INFO ] Added : 13 causal constraints over 4 iterations in 82 ms. Result :sat
Minimization took 85 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1597]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1597]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 125/125 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 125 /125 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 13:26:27] [INFO ] Invariant cache hit.
[2024-05-21 13:26:27] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 13:26:27] [INFO ] Invariant cache hit.
[2024-05-21 13:26:27] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:26:27] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-21 13:26:27] [INFO ] Redundant transitions in 5 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 13:26:27] [INFO ] Invariant cache hit.
[2024-05-21 13:26:27] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/303 variables, 125/127 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 58/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 13:26:30] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 186 constraints, problems are : Problem set: 0 solved, 177 unsolved in 6035 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/125 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (OVERLAPS) 178/303 variables, 125/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 363 constraints, problems are : Problem set: 0 solved, 177 unsolved in 10556 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 125/125 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 1/1 constraints]
After SMT, in 16810ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 16813ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17170 ms. Remains : 125/125 places, 178/178 transitions.
RANDOM walk for 40000 steps (9187 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3812 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3822 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Probably explored full state space saw : 24388 states, properties seen :1
Probabilistic random walk after 57874 steps, saw 24388 distinct states, run finished after 119 ms. (steps per millisecond=486 ) properties seen :1
Explored full state space saw : 24423 states, properties seen :0
Exhaustive walk after 57909 steps, saw 24423 distinct states, run finished after 59 ms. (steps per millisecond=981 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[1597]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-00 in 20579 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 217 rows 135 cols
[2024-05-21 13:26:45] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2311 resets) in 17 ms. (555 steps per ms)
BEST_FIRST walk for 10000 steps (992 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:26:45] [INFO ] Invariant cache hit.
[2024-05-21 13:26:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:26:45] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-05-21 13:26:45] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 13:26:45] [INFO ] [Real]Added 90 Read/Feed constraints in 14 ms returned sat
[2024-05-21 13:26:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:26:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:26:45] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-05-21 13:26:45] [INFO ] [Nat]Added 90 Read/Feed constraints in 23 ms returned sat
[2024-05-21 13:26:45] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 15 ms.
[2024-05-21 13:26:45] [INFO ] Added : 10 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 217/217 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 214
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 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 130 transition count 206
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 126 transition count 178
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 126 transition count 178
Applied a total of 23 rules in 15 ms. Remains 126 /135 variables (removed 9) and now considering 178/217 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 126/135 places, 178/217 transitions.
// Phase 1: matrix 178 rows 126 cols
[2024-05-21 13:26:45] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230481 resets) in 1109 ms. (900 steps per ms)
BEST_FIRST walk for 1000000 steps (96006 resets) in 536 ms. (1862 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:26:47] [INFO ] Invariant cache hit.
[2024-05-21 13:26:47] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:26:47] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 13:26:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:26:47] [INFO ] [Real]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-05-21 13:26:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:26:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:26:47] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-21 13:26:47] [INFO ] [Nat]Added 57 Read/Feed constraints in 11 ms returned sat
[2024-05-21 13:26:47] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 127 transitions) in 11 ms.
[2024-05-21 13:26:47] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-21 13:26:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-21 13:26:47] [INFO ] Added : 17 causal constraints over 4 iterations in 165 ms. Result :sat
Minimization took 79 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 126/126 places, 178/178 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 178/178 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-21 13:26:47] [INFO ] Invariant cache hit.
[2024-05-21 13:26:47] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 13:26:47] [INFO ] Invariant cache hit.
[2024-05-21 13:26:47] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-21 13:26:48] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2024-05-21 13:26:48] [INFO ] Redundant transitions in 2 ms returned []
Running 177 sub problems to find dead transitions.
[2024-05-21 13:26:48] [INFO ] Invariant cache hit.
[2024-05-21 13:26:48] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/304 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 0/304 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 304/304 variables, and 185 constraints, problems are : Problem set: 0 solved, 177 unsolved in 4878 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (OVERLAPS) 178/304 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/304 variables, 57/185 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 177/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (OVERLAPS) 0/304 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 304/304 variables, and 362 constraints, problems are : Problem set: 0 solved, 177 unsolved in 9854 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 0/0 constraints]
After SMT, in 14959ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 14962ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15314 ms. Remains : 126/126 places, 178/178 transitions.
RANDOM walk for 40000 steps (9172 resets) in 89 ms. (444 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3776 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3808 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Probably explored full state space saw : 24082 states, properties seen :1
Probabilistic random walk after 56514 steps, saw 24082 distinct states, run finished after 126 ms. (steps per millisecond=448 ) properties seen :1
Explored full state space saw : 24117 states, properties seen :0
Exhaustive walk after 56549 steps, saw 24117 distinct states, run finished after 54 ms. (steps per millisecond=1047 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-05 in 18166 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[7]
// Phase 1: matrix 217 rows 135 cols
[2024-05-21 13:27:03] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 10000 steps (2293 resets) in 14 ms. (666 steps per ms)
BEST_FIRST walk for 10000 steps (973 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:27:03] [INFO ] Invariant cache hit.
[2024-05-21 13:27:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:27:03] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-21 13:27:03] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 13:27:03] [INFO ] [Real]Added 90 Read/Feed constraints in 15 ms returned sat
[2024-05-21 13:27:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:27:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:27:03] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-05-21 13:27:03] [INFO ] [Nat]Added 90 Read/Feed constraints in 43 ms returned sat
[2024-05-21 13:27:03] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 14 ms.
[2024-05-21 13:27:03] [INFO ] Added : 13 causal constraints over 3 iterations in 71 ms. Result :sat
Minimization took 119 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 217/217 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 214
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 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 211
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 15 place count 130 transition count 207
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 126 transition count 180
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 126 transition count 180
Applied a total of 23 rules in 12 ms. Remains 126 /135 variables (removed 9) and now considering 180/217 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 126/135 places, 180/217 transitions.
// Phase 1: matrix 180 rows 126 cols
[2024-05-21 13:27:03] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[7]
RANDOM walk for 1000000 steps (230049 resets) in 1137 ms. (878 steps per ms)
BEST_FIRST walk for 1000000 steps (95959 resets) in 545 ms. (1831 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[7]
[2024-05-21 13:27:05] [INFO ] Invariant cache hit.
[2024-05-21 13:27:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:27:05] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-21 13:27:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:27:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:27:05] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 13:27:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:27:05] [INFO ] [Nat]Added 58 Read/Feed constraints in 21 ms returned sat
[2024-05-21 13:27:05] [INFO ] Computed and/alt/rep : 50/119/50 causal constraints (skipped 129 transitions) in 12 ms.
[2024-05-21 13:27:05] [INFO ] Added : 12 causal constraints over 3 iterations in 54 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[7]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[7]
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 5 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 126/126 places, 180/180 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2024-05-21 13:27:05] [INFO ] Invariant cache hit.
[2024-05-21 13:27:05] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-21 13:27:05] [INFO ] Invariant cache hit.
[2024-05-21 13:27:05] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-21 13:27:06] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-21 13:27:06] [INFO ] Redundant transitions in 2 ms returned []
Running 179 sub problems to find dead transitions.
[2024-05-21 13:27:06] [INFO ] Invariant cache hit.
[2024-05-21 13:27:06] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 179 unsolved in 4874 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (OVERLAPS) 180/306 variables, 126/128 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/306 variables, 58/186 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 8 (OVERLAPS) 0/306 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 365 constraints, problems are : Problem set: 0 solved, 179 unsolved in 10922 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 126/126 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 0/0 constraints]
After SMT, in 16043ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 16046ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16386 ms. Remains : 126/126 places, 180/180 transitions.
RANDOM walk for 40000 steps (9162 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3781 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3866 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
Probably explored full state space saw : 24496 states, properties seen :1
Probabilistic random walk after 58102 steps, saw 24496 distinct states, run finished after 105 ms. (steps per millisecond=553 ) properties seen :1
Explored full state space saw : 24531 states, properties seen :0
Exhaustive walk after 58137 steps, saw 24531 distinct states, run finished after 55 ms. (steps per millisecond=1057 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[7]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-09 in 19201 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 217 rows 135 cols
[2024-05-21 13:27:22] [INFO ] Computed 2 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2309 resets) in 16 ms. (588 steps per ms)
BEST_FIRST walk for 10001 steps (966 resets) in 8 ms. (1111 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 13:27:22] [INFO ] Invariant cache hit.
[2024-05-21 13:27:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:27:22] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-21 13:27:22] [INFO ] State equation strengthened by 90 read => feed constraints.
[2024-05-21 13:27:22] [INFO ] [Real]Added 90 Read/Feed constraints in 14 ms returned sat
[2024-05-21 13:27:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:27:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:27:22] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 13:27:22] [INFO ] [Nat]Added 90 Read/Feed constraints in 16 ms returned sat
[2024-05-21 13:27:22] [INFO ] Computed and/alt/rep : 52/125/52 causal constraints (skipped 164 transitions) in 14 ms.
[2024-05-21 13:27:22] [INFO ] Added : 16 causal constraints over 4 iterations in 102 ms. Result :sat
Minimization took 113 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 217/217 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 132 transition count 214
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 132 transition count 214
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 213
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 130 transition count 210
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 130 transition count 210
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 13 place count 130 transition count 208
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 128 transition count 193
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 128 transition count 193
Applied a total of 17 rules in 13 ms. Remains 128 /135 variables (removed 7) and now considering 193/217 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 128/135 places, 193/217 transitions.
// Phase 1: matrix 193 rows 128 cols
[2024-05-21 13:27:22] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (230232 resets) in 1205 ms. (829 steps per ms)
BEST_FIRST walk for 1000001 steps (96060 resets) in 557 ms. (1792 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 13:27:24] [INFO ] Invariant cache hit.
[2024-05-21 13:27:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 13:27:24] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2024-05-21 13:27:24] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 13:27:24] [INFO ] [Real]Added 72 Read/Feed constraints in 17 ms returned sat
[2024-05-21 13:27:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 13:27:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 13:27:24] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-21 13:27:24] [INFO ] [Nat]Added 72 Read/Feed constraints in 16 ms returned sat
[2024-05-21 13:27:24] [INFO ] Computed and/alt/rep : 50/117/50 causal constraints (skipped 142 transitions) in 16 ms.
[2024-05-21 13:27:24] [INFO ] Added : 13 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 128/128 places, 193/193 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 193/193 transitions.
Applied a total of 0 rules in 4 ms. Remains 128 /128 variables (removed 0) and now considering 193/193 (removed 0) transitions.
[2024-05-21 13:27:25] [INFO ] Invariant cache hit.
[2024-05-21 13:27:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 13:27:25] [INFO ] Invariant cache hit.
[2024-05-21 13:27:25] [INFO ] State equation strengthened by 72 read => feed constraints.
[2024-05-21 13:27:25] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-21 13:27:25] [INFO ] Redundant transitions in 1 ms returned []
Running 192 sub problems to find dead transitions.
[2024-05-21 13:27:25] [INFO ] Invariant cache hit.
[2024-05-21 13:27:25] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (OVERLAPS) 0/321 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 202 constraints, problems are : Problem set: 0 solved, 192 unsolved in 6448 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 192 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 2 (OVERLAPS) 1/128 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 4 (OVERLAPS) 193/321 variables, 128/130 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 72/202 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 192/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
At refinement iteration 8 (OVERLAPS) 0/321 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 192 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 394 constraints, problems are : Problem set: 0 solved, 192 unsolved in 12551 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 192/192 constraints, Known Traps: 0/0 constraints]
After SMT, in 19255ms problems are : Problem set: 0 solved, 192 unsolved
Search for dead transitions found 0 dead transitions in 19257ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19620 ms. Remains : 128/128 places, 193/193 transitions.
RANDOM walk for 40000 steps (9191 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3773 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3949 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
Probably explored full state space saw : 24871 states, properties seen :1
Probabilistic random walk after 59621 steps, saw 24871 distinct states, run finished after 93 ms. (steps per millisecond=641 ) properties seen :1
Explored full state space saw : 24972 states, properties seen :0
Exhaustive walk after 59773 steps, saw 24972 distinct states, run finished after 60 ms. (steps per millisecond=996 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d2m04-UpperBounds-12 in 22564 ms.
[2024-05-21 13:27:45] [INFO ] Flatten gal took : 70 ms
[2024-05-21 13:27:45] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-21 13:27:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 217 transitions and 855 arcs took 6 ms.
Total runtime 133102 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d2m04

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 135
TRANSITIONS: 217
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 785
MODEL NAME: /home/mcc/execution/411/model
135 places, 217 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d2m04-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716298066434

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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-d2m04"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d2m04, 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 r091-tall-171624187900549"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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