Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 8.2K Jun 7 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Jun 7 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 6 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 12K Jun 7 17:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Jun 7 17:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 7 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Jun 7 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 432K Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654776727583

Running Version 202205111006
[2022-06-09 12:12:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-09 12:12:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:12:09] [INFO ] Load time of PNML (sax parser for PT used): 401 ms
[2022-06-09 12:12:09] [INFO ] Transformed 1440 places.
[2022-06-09 12:12:09] [INFO ] Transformed 672 transitions.
[2022-06-09 12:12:09] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 538 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:12:09] [INFO ] Computed 6 place invariants in 32 ms
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 200 ms. (steps per millisecond=50 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 918 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 940 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 1009 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :2
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:12:09] [INFO ] Computed 6 place invariants in 17 ms
[2022-06-09 12:12:10] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2022-06-09 12:12:10] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 26 ms returned sat
[2022-06-09 12:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:10] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2022-06-09 12:12:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 14 ms returned sat
[2022-06-09 12:12:10] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2022-06-09 12:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:10] [INFO ] [Nat]Absence check using state equation in 171 ms returned sat
[2022-06-09 12:12:10] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 12:12:11] [INFO ] [Nat]Added 418 Read/Feed constraints in 102 ms returned sat
[2022-06-09 12:12:11] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 3 ms to minimize.
[2022-06-09 12:12:11] [INFO ] Deduced a trap composed of 87 places in 144 ms of which 2 ms to minimize.
[2022-06-09 12:12:11] [INFO ] Deduced a trap composed of 95 places in 270 ms of which 1 ms to minimize.
[2022-06-09 12:12:11] [INFO ] Deduced a trap composed of 95 places in 174 ms of which 2 ms to minimize.
[2022-06-09 12:12:12] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2022-06-09 12:12:12] [INFO ] Deduced a trap composed of 102 places in 167 ms of which 1 ms to minimize.
[2022-06-09 12:12:12] [INFO ] Deduced a trap composed of 38 places in 143 ms of which 1 ms to minimize.
[2022-06-09 12:12:12] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 1 ms to minimize.
[2022-06-09 12:12:13] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 1 ms to minimize.
[2022-06-09 12:12:13] [INFO ] Deduced a trap composed of 103 places in 104 ms of which 0 ms to minimize.
[2022-06-09 12:12:13] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 1 ms to minimize.
[2022-06-09 12:12:13] [INFO ] Deduced a trap composed of 98 places in 106 ms of which 1 ms to minimize.
[2022-06-09 12:12:13] [INFO ] Deduced a trap composed of 103 places in 109 ms of which 1 ms to minimize.
[2022-06-09 12:12:14] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 0 ms to minimize.
[2022-06-09 12:12:14] [INFO ] Deduced a trap composed of 98 places in 111 ms of which 1 ms to minimize.
[2022-06-09 12:12:14] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 1 ms to minimize.
[2022-06-09 12:12:14] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 0 ms to minimize.
[2022-06-09 12:12:14] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 0 ms to minimize.
[2022-06-09 12:12:15] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 0 ms to minimize.
[2022-06-09 12:12:15] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 0 ms to minimize.
[2022-06-09 12:12:15] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 1 ms to minimize.
[2022-06-09 12:12:15] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 1 ms to minimize.
[2022-06-09 12:12:15] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 0 ms to minimize.
[2022-06-09 12:12:15] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:918)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2622)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:189)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:639)
at fr.lip6.move.gal.application.Application.start(Application.java:174)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2022-06-09 12:12:15] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:12:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:12:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:15] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-09 12:12:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:12:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2022-06-09 12:12:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:16] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2022-06-09 12:12:16] [INFO ] [Nat]Added 418 Read/Feed constraints in 73 ms returned sat
[2022-06-09 12:12:16] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 142 ms.
[2022-06-09 12:12:16] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 1 ms to minimize.
[2022-06-09 12:12:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 196 ms
[2022-06-09 12:12:16] [INFO ] Added : 6 causal constraints over 3 iterations in 534 ms. Result :sat
Minimization took 90 ms.
[2022-06-09 12:12:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:12:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2022-06-09 12:12:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:17] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2022-06-09 12:12:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:12:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-09 12:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:17] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2022-06-09 12:12:17] [INFO ] [Nat]Added 418 Read/Feed constraints in 63 ms returned sat
[2022-06-09 12:12:17] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 66 ms.
[2022-06-09 12:12:17] [INFO ] Added : 1 causal constraints over 1 iterations in 171 ms. Result :sat
Minimization took 96 ms.
Current structural bounds on expressions (after SMT) : [7, 160, 6] Max seen :[0, 0, 2]
Support contains 3 out of 347 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.8 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 69 transitions.
Iterating post reduction 0 with 69 rules applied. Total rules applied 70 place count 326 transition count 603
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 165 place count 231 transition count 329
Iterating global reduction 1 with 95 rules applied. Total rules applied 260 place count 231 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 264 place count 231 transition count 325
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 338 place count 157 transition count 251
Iterating global reduction 2 with 74 rules applied. Total rules applied 412 place count 157 transition count 251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 417 place count 157 transition count 246
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 459 place count 115 transition count 179
Iterating global reduction 3 with 42 rules applied. Total rules applied 501 place count 115 transition count 179
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 525 place count 115 transition count 155
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 536 place count 104 transition count 137
Iterating global reduction 4 with 11 rules applied. Total rules applied 547 place count 104 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 548 place count 104 transition count 136
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 557 place count 95 transition count 127
Iterating global reduction 5 with 9 rules applied. Total rules applied 566 place count 95 transition count 127
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 569 place count 95 transition count 124
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 576 place count 88 transition count 117
Iterating global reduction 6 with 7 rules applied. Total rules applied 583 place count 88 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 586 place count 88 transition count 114
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 588 place count 86 transition count 106
Iterating global reduction 7 with 2 rules applied. Total rules applied 590 place count 86 transition count 106
Applied a total of 590 rules in 105 ms. Remains 86 /347 variables (removed 261) and now considering 106/672 (removed 566) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/347 places, 106/672 transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:17] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229990 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 98571 resets, run finished after 441 ms. (steps per millisecond=2267 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98166 resets, run finished after 464 ms. (steps per millisecond=2155 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000000 steps, including 99462 resets, run finished after 555 ms. (steps per millisecond=1801 ) properties (out of 3) seen :3
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:20] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:12:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:20] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:12:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:20] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:12:20] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:12:20] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:12:20] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 11 ms.
[2022-06-09 12:12:20] [INFO ] Added : 10 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 16 ms.
[2022-06-09 12:12:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:20] [INFO ] [Real]Absence check using state equation in 20 ms returned unsat
[2022-06-09 12:12:20] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:20] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2022-06-09 12:12:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:20] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:20] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:12:20] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2022-06-09 12:12:20] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 7 ms.
[2022-06-09 12:12:20] [INFO ] Added : 1 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [7, 1, 6] Max seen :[0, 1, 3]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 6 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:20] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229734 resets, run finished after 774 ms. (steps per millisecond=1291 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98564 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 99579 resets, run finished after 390 ms. (steps per millisecond=2564 ) properties (out of 2) seen :4
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:22] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:12:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:22] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:12:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:22] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 12:12:22] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:12:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 13 ms returned sat
[2022-06-09 12:12:22] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 7 ms.
[2022-06-09 12:12:22] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 15 ms.
[2022-06-09 12:12:22] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:22] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:12:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:22] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:22] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:12:22] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2022-06-09 12:12:22] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-06-09 12:12:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2022-06-09 12:12:22] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 5 ms.
[2022-06-09 12:12:22] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [7, 6] Max seen :[0, 4]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:22] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:22] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:12:22] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:12:22] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-06-09 12:12:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:22] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:12:22] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:22] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229852 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98650 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 99329 resets, run finished after 382 ms. (steps per millisecond=2617 ) properties (out of 2) seen :4
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:24] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:12:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:24] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2022-06-09 12:12:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:24] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:12:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:12:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2022-06-09 12:12:24] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 6 ms.
[2022-06-09 12:12:24] [INFO ] Added : 10 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 15 ms.
[2022-06-09 12:12:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:24] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-09 12:12:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:24] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2022-06-09 12:12:24] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2022-06-09 12:12:24] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2022-06-09 12:12:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-06-09 12:12:24] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 5 ms.
[2022-06-09 12:12:24] [INFO ] Added : 1 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [7, 6] Max seen :[0, 4]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:24] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:24] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:12:24] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2022-06-09 12:12:24] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:24] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:24] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 106/106 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-02
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:24] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:24] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:12:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:24] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 12:12:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:25] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:12:25] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:12:25] [INFO ] [Nat]Added 32 Read/Feed constraints in 5 ms returned sat
[2022-06-09 12:12:25] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 5 ms.
[2022-06-09 12:12:25] [INFO ] Added : 10 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 106/106 transitions.
Graph (complete) has 269 edges and 86 vertex of which 85 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 105
Applied a total of 2 rules in 5 ms. Remains 85 /86 variables (removed 1) and now considering 105/106 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/86 places, 105/106 transitions.
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:12:25] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 229545 resets, run finished after 814 ms. (steps per millisecond=1228 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98318 resets, run finished after 385 ms. (steps per millisecond=2597 ) properties (out of 1) seen :0
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:12:26] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 12:12:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:26] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-09 12:12:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2022-06-09 12:12:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 12:12:26] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2022-06-09 12:12:26] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 74 transitions) in 6 ms.
[2022-06-09 12:12:26] [INFO ] Added : 8 causal constraints over 3 iterations in 32 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 105/105 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 85/85 places, 105/105 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 105/105 (removed 0) transitions.
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:12:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:26] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:12:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:26] [INFO ] State equation strengthened by 31 read => feed constraints.
[2022-06-09 12:12:26] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2022-06-09 12:12:26] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 105 rows 85 cols
[2022-06-09 12:12:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:26] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/85 places, 105/105 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-02 in 1839 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-13
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:26] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10001 steps, including 1003 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :2
// Phase 1: matrix 106 rows 86 cols
[2022-06-09 12:12:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:26] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:26] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-06-09 12:12:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:26] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:26] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2022-06-09 12:12:26] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-06-09 12:12:26] [INFO ] [Nat]Added 32 Read/Feed constraints in 3 ms returned sat
[2022-06-09 12:12:26] [INFO ] Computed and/alt/rep : 30/67/30 causal constraints (skipped 75 transitions) in 6 ms.
[2022-06-09 12:12:26] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 86 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 86/86 places, 106/106 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 85 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 85 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 85 transition count 104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 84 transition count 102
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 84 transition count 102
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 83 transition count 101
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 83 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 83 transition count 100
Applied a total of 8 rules in 13 ms. Remains 83 /86 variables (removed 3) and now considering 100/106 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/86 places, 100/106 transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:26] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229991 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 99749 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 1) seen :4
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:28] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 12:12:28] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 12:12:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:28] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:12:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:28] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2022-06-09 12:12:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:12:28] [INFO ] [Nat]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-06-09 12:12:28] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2022-06-09 12:12:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2022-06-09 12:12:28] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 70 transitions) in 5 ms.
[2022-06-09 12:12:28] [INFO ] Added : 1 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:28] [INFO ] Computed 2 place invariants in 0 ms
[2022-06-09 12:12:28] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:28] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:12:28] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2022-06-09 12:12:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:28] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:28] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:28] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230052 resets, run finished after 772 ms. (steps per millisecond=1295 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 99861 resets, run finished after 373 ms. (steps per millisecond=2680 ) properties (out of 1) seen :4
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 12:12:29] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:29] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2022-06-09 12:12:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 12:12:29] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:12:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 12:12:29] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2022-06-09 12:12:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:12:29] [INFO ] [Nat]Added 30 Read/Feed constraints in 2 ms returned sat
[2022-06-09 12:12:29] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2022-06-09 12:12:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-06-09 12:12:29] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 70 transitions) in 6 ms.
[2022-06-09 12:12:29] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:29] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:29] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:29] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:12:30] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-06-09 12:12:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:12:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:12:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-13 in 3324 ms.
[2022-06-09 12:12:30] [INFO ] Flatten gal took : 39 ms
[2022-06-09 12:12:30] [INFO ] Applying decomposition
[2022-06-09 12:12:30] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18205195061978397966.txt' '-o' '/tmp/graph18205195061978397966.bin' '-w' '/tmp/graph18205195061978397966.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18205195061978397966.bin' '-l' '-1' '-v' '-w' '/tmp/graph18205195061978397966.weights' '-q' '0' '-e' '0.001'
[2022-06-09 12:12:30] [INFO ] Decomposing Gal with order
[2022-06-09 12:12:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 12:12:30] [INFO ] Removed a total of 103 redundant transitions.
[2022-06-09 12:12:30] [INFO ] Flatten gal took : 44 ms
[2022-06-09 12:12:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 7 ms.
[2022-06-09 12:12:30] [INFO ] Time to serialize gal into /tmp/UpperBounds14278329931593972022.gal : 5 ms
[2022-06-09 12:12:30] [INFO ] Time to serialize properties into /tmp/UpperBounds7128523322506182382.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds14278329931593972022.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds7128523322506182382.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds7128523322506182382.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,561110,0.603492,22640,1061,525,28279,3454,325,68758,126,21277,0
Total reachable state count : 561110

Verifying 2 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-02 :0 <= i0.u0.p110 <= 1
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m06-UpperBounds-02,0,0.636842,22640,1,0,28279,3454,418,68758,154,21277,688
Min sum of variable value : 0
Maximum sum along a path : 4
Bounds property DBSingleClientW-PT-d1m06-UpperBounds-13 :0 <= i6.u11.l1088 <= 4
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 4 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d1m06-UpperBounds-13,0,0.642296,22640,1,0,28279,3454,442,68758,162,21277,1105
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 22218 ms.

BK_STOP 1654776751415

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d1m06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r312-tall-165472281900205"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;