fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r312-tall-165472282000277
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DBSingleClientW-PT-d2m08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
789.516 53499.00 75682.00 536.40 6 0 1 0 0 0 0 0 1 0 0 0 0 0 0 0 normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.1K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.6M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654787012629

Running Version 202205111006
[2022-06-09 15:03:33] [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 15:03:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 15:03:34] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2022-06-09 15:03:34] [INFO ] Transformed 4763 places.
[2022-06-09 15:03:34] [INFO ] Transformed 2478 transitions.
[2022-06-09 15:03:34] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 370 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 3580 places in 17 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 15:03:34] [INFO ] Computed 6 place invariants in 164 ms
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 939 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 902 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 941 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
// Phase 1: matrix 2478 rows 1183 cols
[2022-06-09 15:03:34] [INFO ] Computed 6 place invariants in 81 ms
[2022-06-09 15:03:35] [INFO ] [Real]Absence check using 2 positive place invariants in 16 ms returned sat
[2022-06-09 15:03:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2022-06-09 15:03:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:36] [INFO ] [Real]Absence check using state equation in 647 ms returned sat
[2022-06-09 15:03:36] [INFO ] State equation strengthened by 1588 read => feed constraints.
[2022-06-09 15:03:37] [INFO ] [Real]Added 1588 Read/Feed constraints in 861 ms returned sat
[2022-06-09 15:03:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:03:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 15:03:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-06-09 15:03:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:38] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2022-06-09 15:03:38] [INFO ] [Nat]Added 1588 Read/Feed constraints in 621 ms returned sat
[2022-06-09 15:03:39] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 700 ms.
[2022-06-09 15:03:39] [INFO ] Added : 1 causal constraints over 1 iterations in 970 ms. Result :sat
Minimization took 639 ms.
[2022-06-09 15:03:40] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2022-06-09 15:03:40] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 13 ms returned sat
[2022-06-09 15:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:41] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2022-06-09 15:03:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:03:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 15:03:41] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2022-06-09 15:03:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:42] [INFO ] [Nat]Absence check using state equation in 659 ms returned sat
[2022-06-09 15:03:43] [INFO ] [Nat]Added 1588 Read/Feed constraints in 933 ms returned sat
[2022-06-09 15:03:43] [INFO ] Deduced a trap composed of 201 places in 610 ms of which 5 ms to minimize.
[2022-06-09 15:03:44] [INFO ] Deduced a trap composed of 208 places in 601 ms of which 2 ms to minimize.
[2022-06-09 15:03:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1473 ms
[2022-06-09 15:03:44] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 430 ms.
[2022-06-09 15:03:46] [INFO ] Deduced a trap composed of 67 places in 605 ms of which 1 ms to minimize.
[2022-06-09 15:03:46] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 664 ms
[2022-06-09 15:03:46] [INFO ] Deduced a trap composed of 49 places in 628 ms of which 3 ms to minimize.
[2022-06-09 15:03:46] [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 1
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.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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 15:03:47] [INFO ] [Real]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 15:03:47] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2022-06-09 15:03:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:47] [INFO ] [Real]Absence check using state equation in 662 ms returned sat
[2022-06-09 15:03:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:03:47] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2022-06-09 15:03:47] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 22 ms returned sat
[2022-06-09 15:03:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:48] [INFO ] [Nat]Absence check using state equation in 675 ms returned sat
[2022-06-09 15:03:49] [INFO ] [Nat]Added 1588 Read/Feed constraints in 982 ms returned sat
[2022-06-09 15:03:50] [INFO ] Computed and/alt/rep : 372/636/372 causal constraints (skipped 2105 transitions) in 457 ms.
[2022-06-09 15:03:51] [INFO ] Deduced a trap composed of 34 places in 623 ms of which 2 ms to minimize.
[2022-06-09 15:03:52] [INFO ] Deduced a trap composed of 112 places in 578 ms of which 1 ms to minimize.
[2022-06-09 15:03:52] [INFO ] Deduced a trap composed of 115 places in 607 ms of which 1 ms to minimize.
[2022-06-09 15:03:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:242)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1257)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1179)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:925)
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)
Current structural bounds on expressions (after SMT) : [8, 2887, 7] Max seen :[2, 0, 0]
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.11 ms
Discarding 47 places :
Also discarding 0 output transitions
Drop transitions removed 18 transitions
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 217 transitions.
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1136 transition count 2261
Discarding 391 places :
Symmetric choice reduction at 1 with 391 rule applications. Total rules 609 place count 745 transition count 1200
Iterating global reduction 1 with 391 rules applied. Total rules applied 1000 place count 745 transition count 1200
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1009 place count 745 transition count 1191
Discarding 315 places :
Symmetric choice reduction at 2 with 315 rule applications. Total rules 1324 place count 430 transition count 876
Iterating global reduction 2 with 315 rules applied. Total rules applied 1639 place count 430 transition count 876
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1651 place count 430 transition count 864
Discarding 240 places :
Symmetric choice reduction at 3 with 240 rule applications. Total rules 1891 place count 190 transition count 526
Iterating global reduction 3 with 240 rules applied. Total rules applied 2131 place count 190 transition count 526
Ensure Unique test removed 212 transitions
Reduce isomorphic transitions removed 212 transitions.
Iterating post reduction 3 with 212 rules applied. Total rules applied 2343 place count 190 transition count 314
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 2367 place count 166 transition count 275
Iterating global reduction 4 with 24 rules applied. Total rules applied 2391 place count 166 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 2397 place count 166 transition count 269
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2413 place count 150 transition count 253
Iterating global reduction 5 with 16 rules applied. Total rules applied 2429 place count 150 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 2433 place count 150 transition count 249
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2446 place count 137 transition count 236
Iterating global reduction 6 with 13 rules applied. Total rules applied 2459 place count 137 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 2469 place count 137 transition count 226
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2473 place count 133 transition count 210
Iterating global reduction 7 with 4 rules applied. Total rules applied 2477 place count 133 transition count 210
Applied a total of 2477 rules in 236 ms. Remains 133 /1183 variables (removed 1050) and now considering 210/2478 (removed 2268) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/1183 places, 210/2478 transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:03:53] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229720 resets, run finished after 1376 ms. (steps per millisecond=726 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 97380 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000000 steps, including 95756 resets, run finished after 608 ms. (steps per millisecond=1644 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95777 resets, run finished after 601 ms. (steps per millisecond=1663 ) properties (out of 3) seen :2
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:03:56] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:03:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:56] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2022-06-09 15:03:56] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:03:56] [INFO ] [Real]Added 82 Read/Feed constraints in 15 ms returned sat
[2022-06-09 15:03:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:03:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:56] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-06-09 15:03:56] [INFO ] [Nat]Added 82 Read/Feed constraints in 11 ms returned sat
[2022-06-09 15:03:56] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 14 ms.
[2022-06-09 15:03:56] [INFO ] Added : 1 causal constraints over 1 iterations in 38 ms. Result :sat
Minimization took 21 ms.
[2022-06-09 15:03:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:03:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:56] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 15:03:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:03:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:03:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:56] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 15:03:56] [INFO ] [Nat]Added 82 Read/Feed constraints in 26 ms returned sat
[2022-06-09 15:03:56] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 15 ms.
[2022-06-09 15:03:56] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2022-06-09 15:03:57] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2022-06-09 15:03:57] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2022-06-09 15:03:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 251 ms
[2022-06-09 15:03:57] [INFO ] Added : 13 causal constraints over 4 iterations in 365 ms. Result :sat
Minimization took 41 ms.
[2022-06-09 15:03:57] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:57] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 15:03:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:03:57] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:03:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:03:57] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 15:03:57] [INFO ] [Nat]Added 82 Read/Feed constraints in 22 ms returned sat
[2022-06-09 15:03:57] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 18 ms.
[2022-06-09 15:03:57] [INFO ] Added : 18 causal constraints over 4 iterations in 93 ms. Result :sat
Minimization took 36 ms.
Current structural bounds on expressions (after SMT) : [8, 2887, 7] Max seen :[4, 0, 0]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 21 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:03:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:03:57] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:03:57] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:03:57] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:03:58] [INFO ] Implicit Places using invariants and state equation in 312 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2022-06-09 15:03:58] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:03:58] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:03:58] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:03:58] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229923 resets, run finished after 1322 ms. (steps per millisecond=756 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 96591 resets, run finished after 609 ms. (steps per millisecond=1642 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 96196 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 95210 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 3) seen :2
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:01] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 15:04:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:01] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-06-09 15:04:01] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:04:01] [INFO ] [Nat]Added 82 Read/Feed constraints in 33 ms returned sat
[2022-06-09 15:04:01] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 16 ms.
[2022-06-09 15:04:01] [INFO ] Added : 1 causal constraints over 1 iterations in 39 ms. Result :sat
Minimization took 21 ms.
[2022-06-09 15:04:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:01] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2022-06-09 15:04:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:01] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 15:04:01] [INFO ] [Nat]Added 82 Read/Feed constraints in 25 ms returned sat
[2022-06-09 15:04:01] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 17 ms.
[2022-06-09 15:04:01] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2022-06-09 15:04:02] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2022-06-09 15:04:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2022-06-09 15:04:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 227 ms
[2022-06-09 15:04:02] [INFO ] Added : 13 causal constraints over 4 iterations in 333 ms. Result :sat
Minimization took 40 ms.
[2022-06-09 15:04:02] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:02] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 15:04:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:02] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:02] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 15:04:02] [INFO ] [Nat]Added 82 Read/Feed constraints in 21 ms returned sat
[2022-06-09 15:04:02] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 14 ms.
[2022-06-09 15:04:02] [INFO ] Added : 18 causal constraints over 4 iterations in 89 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [8, 2887, 7] Max seen :[5, 0, 0]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:02] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:04:02] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:02] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:04:02] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:04:02] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2022-06-09 15:04:02] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:02] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:04:03] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:03] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229848 resets, run finished after 1328 ms. (steps per millisecond=753 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96558 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 3) seen :4
Incomplete Best-First random walk after 1000001 steps, including 95578 resets, run finished after 602 ms. (steps per millisecond=1661 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 95346 resets, run finished after 626 ms. (steps per millisecond=1597 ) properties (out of 3) seen :2
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:06] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:04:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:06] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 15:04:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:06] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-06-09 15:04:06] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:04:06] [INFO ] [Nat]Added 82 Read/Feed constraints in 11 ms returned sat
[2022-06-09 15:04:06] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 15 ms.
[2022-06-09 15:04:06] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 22 ms.
[2022-06-09 15:04:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:06] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-06-09 15:04:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:06] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2022-06-09 15:04:06] [INFO ] [Nat]Added 82 Read/Feed constraints in 23 ms returned sat
[2022-06-09 15:04:06] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 13 ms.
[2022-06-09 15:04:06] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2022-06-09 15:04:06] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 0 ms to minimize.
[2022-06-09 15:04:06] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2022-06-09 15:04:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 221 ms
[2022-06-09 15:04:07] [INFO ] Added : 13 causal constraints over 4 iterations in 323 ms. Result :sat
Minimization took 45 ms.
[2022-06-09 15:04:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:07] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2022-06-09 15:04:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:07] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2022-06-09 15:04:07] [INFO ] [Nat]Added 82 Read/Feed constraints in 22 ms returned sat
[2022-06-09 15:04:07] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 14 ms.
[2022-06-09 15:04:07] [INFO ] Added : 18 causal constraints over 4 iterations in 87 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : [8, 2887, 7] Max seen :[5, 0, 0]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 133 /133 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:07] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:04:07] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:04:07] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:04:07] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2022-06-09 15:04:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:07] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:04:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 210/210 transitions.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-00
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:07] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 10000 steps, including 926 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :2
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:07] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:04:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:08] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2022-06-09 15:04:08] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:04:08] [INFO ] [Real]Added 82 Read/Feed constraints in 11 ms returned sat
[2022-06-09 15:04:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:08] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 15:04:08] [INFO ] [Nat]Added 82 Read/Feed constraints in 12 ms returned sat
[2022-06-09 15:04:08] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 14 ms.
[2022-06-09 15:04:08] [INFO ] Added : 1 causal constraints over 1 iterations in 36 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 131 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 131 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 131 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 129 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 129 transition count 194
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 128 transition count 193
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 128 transition count 193
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 127 transition count 192
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 127 transition count 192
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 126 transition count 191
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 126 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 126 transition count 188
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 21 place count 123 transition count 168
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 123 transition count 168
Applied a total of 24 rules in 23 ms. Remains 123 /133 variables (removed 10) and now considering 168/210 (removed 42) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/133 places, 168/210 transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:08] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229946 resets, run finished after 1161 ms. (steps per millisecond=861 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000000 steps, including 96599 resets, run finished after 511 ms. (steps per millisecond=1956 ) properties (out of 1) seen :4
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:09] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:04:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:10] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-06-09 15:04:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 15:04:10] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2022-06-09 15:04:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:10] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 15:04:10] [INFO ] [Nat]Added 49 Read/Feed constraints in 8 ms returned sat
[2022-06-09 15:04:10] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 11 ms.
[2022-06-09 15:04:10] [INFO ] Added : 1 causal constraints over 1 iterations in 32 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:10] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:04:10] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:10] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 15:04:10] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2022-06-09 15:04:10] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:10] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:10] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230190 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 96290 resets, run finished after 504 ms. (steps per millisecond=1984 ) properties (out of 1) seen :4
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:12] [INFO ] Computed 2 place invariants in 7 ms
[2022-06-09 15:04:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:12] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2022-06-09 15:04:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 15:04:12] [INFO ] [Real]Added 49 Read/Feed constraints in 8 ms returned sat
[2022-06-09 15:04:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-09 15:04:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:12] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2022-06-09 15:04:12] [INFO ] [Nat]Added 49 Read/Feed constraints in 8 ms returned sat
[2022-06-09 15:04:12] [INFO ] Computed and/alt/rep : 49/115/49 causal constraints (skipped 118 transitions) in 19 ms.
[2022-06-09 15:04:12] [INFO ] Added : 1 causal constraints over 1 iterations in 40 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[4]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 168/168 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 168/168 (removed 0) transitions.
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:12] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:12] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:12] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-06-09 15:04:12] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2022-06-09 15:04:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 168 rows 123 cols
[2022-06-09 15:04:12] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:04:12] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 168/168 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-00 in 4860 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-02
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:12] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2295 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 963 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:12] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:04:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:12] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 15:04:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:12] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 15:04:12] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:04:13] [INFO ] [Nat]Added 82 Read/Feed constraints in 25 ms returned sat
[2022-06-09 15:04:13] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 15 ms.
[2022-06-09 15:04:13] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 0 ms to minimize.
[2022-06-09 15:04:13] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2022-06-09 15:04:13] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2022-06-09 15:04:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 239 ms
[2022-06-09 15:04:13] [INFO ] Added : 13 causal constraints over 4 iterations in 331 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 131 transition count 205
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 131 transition count 205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 130 transition count 204
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 130 transition count 204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 203
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 202
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 13 place count 128 transition count 199
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 125 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 125 transition count 179
Applied a total of 19 rules in 16 ms. Remains 125 /133 variables (removed 8) and now considering 179/210 (removed 31) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/133 places, 179/210 transitions.
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:04:13] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230211 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95993 resets, run finished after 542 ms. (steps per millisecond=1845 ) properties (out of 1) seen :0
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:04:15] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:04:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:15] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2022-06-09 15:04:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:15] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-06-09 15:04:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 15:04:15] [INFO ] [Nat]Added 58 Read/Feed constraints in 12 ms returned sat
[2022-06-09 15:04:15] [INFO ] Computed and/alt/rep : 49/119/49 causal constraints (skipped 129 transitions) in 12 ms.
[2022-06-09 15:04:15] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2022-06-09 15:04:15] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2022-06-09 15:04:15] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2022-06-09 15:04:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 203 ms
[2022-06-09 15:04:15] [INFO ] Added : 12 causal constraints over 3 iterations in 269 ms. Result :sat
Minimization took 38 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 179/179 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 125/125 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 125 /125 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:04:15] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:04:15] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:04:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2022-06-09 15:04:15] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2022-06-09 15:04:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 179 rows 125 cols
[2022-06-09 15:04:15] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:16] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 125/125 places, 179/179 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-02 in 3259 ms.
Starting property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-08
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:16] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 962 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
// Phase 1: matrix 210 rows 133 cols
[2022-06-09 15:04:16] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:16] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2022-06-09 15:04:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:16] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2022-06-09 15:04:16] [INFO ] State equation strengthened by 82 read => feed constraints.
[2022-06-09 15:04:16] [INFO ] [Nat]Added 82 Read/Feed constraints in 23 ms returned sat
[2022-06-09 15:04:16] [INFO ] Computed and/alt/rep : 51/126/51 causal constraints (skipped 158 transitions) in 15 ms.
[2022-06-09 15:04:16] [INFO ] Added : 18 causal constraints over 4 iterations in 91 ms. Result :sat
Minimization took 34 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 133 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 133/133 places, 210/210 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 208
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 132 transition count 207
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 131 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 131 transition count 199
Applied a total of 5 rules in 10 ms. Remains 131 /133 variables (removed 2) and now considering 199/210 (removed 11) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/133 places, 199/210 transitions.
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 15:04:16] [INFO ] Computed 2 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 230084 resets, run finished after 1243 ms. (steps per millisecond=804 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 95828 resets, run finished after 566 ms. (steps per millisecond=1766 ) properties (out of 1) seen :0
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 15:04:18] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 15:04:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:18] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2022-06-09 15:04:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-09 15:04:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 15:04:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-09 15:04:18] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-06-09 15:04:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 15:04:18] [INFO ] [Nat]Added 73 Read/Feed constraints in 21 ms returned sat
[2022-06-09 15:04:18] [INFO ] Computed and/alt/rep : 51/122/51 causal constraints (skipped 147 transitions) in 15 ms.
[2022-06-09 15:04:18] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2022-06-09 15:04:18] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 0 ms to minimize.
[2022-06-09 15:04:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 139 ms
[2022-06-09 15:04:18] [INFO ] Added : 11 causal constraints over 3 iterations in 206 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 131 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 199/199 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 131/131 places, 199/199 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 15:04:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:18] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 15:04:18] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:18] [INFO ] State equation strengthened by 73 read => feed constraints.
[2022-06-09 15:04:19] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2022-06-09 15:04:19] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 199 rows 131 cols
[2022-06-09 15:04:19] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:04:19] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/131 places, 199/199 transitions.
Ending property specific reduction for DBSingleClientW-PT-d2m08-UpperBounds-08 in 3061 ms.
[2022-06-09 15:04:19] [INFO ] Flatten gal took : 47 ms
[2022-06-09 15:04:19] [INFO ] Applying decomposition
[2022-06-09 15:04:19] [INFO ] Flatten gal took : 17 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/graph5249940652241178763.txt' '-o' '/tmp/graph5249940652241178763.bin' '-w' '/tmp/graph5249940652241178763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph5249940652241178763.bin' '-l' '-1' '-v' '-w' '/tmp/graph5249940652241178763.weights' '-q' '0' '-e' '0.001'
[2022-06-09 15:04:19] [INFO ] Decomposing Gal with order
[2022-06-09 15:04:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 15:04:19] [INFO ] Removed a total of 214 redundant transitions.
[2022-06-09 15:04:19] [INFO ] Flatten gal took : 63 ms
[2022-06-09 15:04:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 175 labels/synchronizations in 10 ms.
[2022-06-09 15:04:19] [INFO ] Time to serialize gal into /tmp/UpperBounds12897622177916736691.gal : 8 ms
[2022-06-09 15:04:19] [INFO ] Time to serialize properties into /tmp/UpperBounds11618194031705346706.prop : 1 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/UpperBounds12897622177916736691.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds11618194031705346706.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...276
Loading property file /tmp/UpperBounds11618194031705346706.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,6.56357e+07,6.07033,149972,2630,1617,153305,75369,507,631623,259,652554,0
Total reachable state count : 65635684

Verifying 3 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 6
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-00 :0 <= i1.u5.l3656 <= 6
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-00 6 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-d2m08-UpperBounds-00,0,6.43189,149972,1,0,153305,75369,618,631623,309,652554,831
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-02 :0 <= i3.u7.l1666 <= 1
FORMULA DBSingleClientW-PT-d2m08-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-d2m08-UpperBounds-02,0,6.43984,149972,1,0,153305,75369,643,631623,333,652554,961
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DBSingleClientW-PT-d2m08-UpperBounds-08 :0 <= i5.u11.p316 <= 1
FORMULA DBSingleClientW-PT-d2m08-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DBSingleClientW-PT-d2m08-UpperBounds-08,0,6.44081,149972,1,0,153305,75369,667,631623,344,652554,1022
Total runtime 52323 ms.

BK_STOP 1654787066128

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

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