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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Jun 7 17:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 6 15:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K Jun 6 15:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.8K Jun 7 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 7 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 7 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Jun 7 17:15 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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654778904763

Running Version 202205111006
[2022-06-09 12:48:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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:48:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 12:48:26] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2022-06-09 12:48:26] [INFO ] Transformed 1440 places.
[2022-06-09 12:48:26] [INFO ] Transformed 672 transitions.
[2022-06-09 12:48:26] [INFO ] Parsed PT model containing 1440 places and 672 transitions in 282 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 396 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 966 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 944 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 964 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 973 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 364458 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :{3=1}
Probabilistic random walk after 364458 steps, saw 143638 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :1
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 672 rows 347 cols
[2022-06-09 12:48:30] [INFO ] Computed 6 place invariants in 33 ms
[2022-06-09 12:48:30] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-09 12:48:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2022-06-09 12:48:30] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2022-06-09 12:48:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2022-06-09 12:48:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2022-06-09 12:48:31] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-09 12:48:31] [INFO ] State equation strengthened by 418 read => feed constraints.
[2022-06-09 12:48:31] [INFO ] After 166ms SMT Verify possible using 418 Read/Feed constraints in natural domain returned unsat :2 sat :1
[2022-06-09 12:48:31] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-06-09 12:48:31] [INFO ] After 648ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 75 ms.
Support contains 1 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.6 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 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 166 place count 230 transition count 328
Iterating global reduction 1 with 96 rules applied. Total rules applied 262 place count 230 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 266 place count 230 transition count 324
Discarding 74 places :
Symmetric choice reduction at 2 with 74 rule applications. Total rules 340 place count 156 transition count 250
Iterating global reduction 2 with 74 rules applied. Total rules applied 414 place count 156 transition count 250
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 420 place count 156 transition count 244
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 463 place count 113 transition count 175
Iterating global reduction 3 with 43 rules applied. Total rules applied 506 place count 113 transition count 175
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 530 place count 113 transition count 151
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 542 place count 101 transition count 132
Iterating global reduction 4 with 12 rules applied. Total rules applied 554 place count 101 transition count 132
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 556 place count 101 transition count 130
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 565 place count 92 transition count 121
Iterating global reduction 5 with 9 rules applied. Total rules applied 574 place count 92 transition count 121
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 577 place count 92 transition count 118
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 584 place count 85 transition count 111
Iterating global reduction 6 with 7 rules applied. Total rules applied 591 place count 85 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 594 place count 85 transition count 108
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 596 place count 83 transition count 100
Iterating global reduction 7 with 2 rules applied. Total rules applied 598 place count 83 transition count 100
Applied a total of 598 rules in 86 ms. Remains 83 /347 variables (removed 264) and now considering 100/672 (removed 572) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/347 places, 100/672 transitions.
Incomplete random walk after 1000000 steps, including 229689 resets, run finished after 1132 ms. (steps per millisecond=883 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 99996 resets, run finished after 537 ms. (steps per millisecond=1862 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2988435 steps, run timeout after 3001 ms. (steps per millisecond=995 ) properties seen :{}
Probabilistic random walk after 2988435 steps, saw 1208183 distinct states, run finished after 3001 ms. (steps per millisecond=995 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:36] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-09 12:48:36] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 12:48:36] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 12:48:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:36] [INFO ] After 9ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:36] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:36] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 12:48:36] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:36] [INFO ] After 7ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:36] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-09 12:48:36] [INFO ] After 77ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
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 5 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 5 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:48:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:36] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:36] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:36] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:36] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
[2022-06-09 12:48:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:36] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-09 12:48:36] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Incomplete random walk after 100000 steps, including 23018 resets, run finished after 327 ms. (steps per millisecond=305 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:37] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 12:48:37] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:37] [INFO ] After 9ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:37] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 12:48:37] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:37] [INFO ] After 7ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:37] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-09 12:48:37] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000000 steps, including 229661 resets, run finished after 1042 ms. (steps per millisecond=959 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 99319 resets, run finished after 526 ms. (steps per millisecond=1901 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3073459 steps, run timeout after 3001 ms. (steps per millisecond=1024 ) properties seen :{}
Probabilistic random walk after 3073459 steps, saw 1244753 distinct states, run finished after 3001 ms. (steps per millisecond=1024 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:42] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 12:48:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:42] [INFO ] After 11ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:42] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:42] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:42] [INFO ] After 6ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:42] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 12:48:42] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
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 6 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 6 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:48:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:42] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:42] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2022-06-09 12:48:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:42] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Incomplete random walk after 100000 steps, including 22880 resets, run finished after 109 ms. (steps per millisecond=917 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:42] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 0 ms returned sat
[2022-06-09 12:48:42] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 12:48:42] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:42] [INFO ] After 9ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:42] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:42] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:42] [INFO ] After 7ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:42] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-09 12:48:42] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 2251 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 968 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3051650 steps, run timeout after 3001 ms. (steps per millisecond=1016 ) properties seen :{}
Probabilistic random walk after 3051650 steps, saw 1235098 distinct states, run finished after 3001 ms. (steps per millisecond=1016 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:45] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 12:48:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:45] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 12:48:45] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:45] [INFO ] After 10ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:46] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:46] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:46] [INFO ] After 11ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:46] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2022-06-09 12:48:46] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
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.
Incomplete random walk after 10000 steps, including 2269 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 991 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 3051180 steps, run timeout after 3001 ms. (steps per millisecond=1016 ) properties seen :{}
Probabilistic random walk after 3051180 steps, saw 1234887 distinct states, run finished after 3001 ms. (steps per millisecond=1016 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:49] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-06-09 12:48:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:49] [INFO ] After 9ms SMT Verify possible using 30 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:49] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-06-09 12:48:49] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:49] [INFO ] After 7ms SMT Verify possible using 30 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:49] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 12:48:49] [INFO ] After 70ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
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 8 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 6 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:48:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:49] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:49] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-06-09 12:48:49] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2022-06-09 12:48:49] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:49] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:49] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 100/100 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 83 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 81 transition count 92
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 81 transition count 84
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 73 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 72 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 72 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 68 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 67 transition count 98
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 67 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 63 transition count 94
Applied a total of 46 rules in 38 ms. Remains 63 /83 variables (removed 20) and now considering 94/100 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 63 cols
[2022-06-09 12:48:49] [INFO ] Computed 6 place invariants in 1 ms
[2022-06-09 12:48:49] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:48:49] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-09 12:48:49] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:48:49] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-09 12:48:49] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:49] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-09 12:48:49] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:49] [INFO ] Flatten gal took : 44 ms
[2022-06-09 12:48:49] [INFO ] Flatten gal took : 11 ms
[2022-06-09 12:48:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12634781221534616343.gal : 12 ms
[2022-06-09 12:48:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9782743056513111406.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms2084975100545762134;'/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/ReachabilityCardinality12634781221534616343.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9782743056513111406.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...320
Loading property file /tmp/ReachabilityCardinality9782743056513111406.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 59
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :59 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 1239
Invariant property AtomicProp does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,1815,0.05259,5316,2,2037,11,8367,6,0,345,3451,0
Total reachable state count : 1815

Verifying 1 reachability properties.
Invariant property AtomicProp does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AtomicProp,9,0.05346,5580,2,139,11,8367,7,0,348,3451,0
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 83 transition count 92
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 81 transition count 92
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 81 transition count 84
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 26 place count 73 transition count 84
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 72 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 72 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 71 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 71 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 68 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 67 transition count 98
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 42 place count 67 transition count 94
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 46 place count 63 transition count 94
Applied a total of 46 rules in 14 ms. Remains 63 /83 variables (removed 20) and now considering 94/100 (removed 6) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 63 cols
[2022-06-09 12:48:49] [INFO ] Computed 6 place invariants in 0 ms
[2022-06-09 12:48:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 12:48:49] [INFO ] [Real]Absence check using 1 positive and 5 generalized place invariants in 8 ms returned sat
[2022-06-09 12:48:49] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 12:48:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 12:48:49] [INFO ] [Nat]Absence check using 1 positive and 5 generalized place invariants in 2 ms returned sat
[2022-06-09 12:48:50] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:50] [INFO ] After 70ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-09 12:48:50] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-09 12:48:50] [INFO ] Flatten gal took : 12 ms
[2022-06-09 12:48:50] [INFO ] Flatten gal took : 7 ms
[2022-06-09 12:48:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15069987323995993551.gal : 2 ms
[2022-06-09 12:48:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15796147237099606686.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/ReachabilityCardinality15069987323995993551.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15796147237099606686.prop' '--nowitness' '--gen-order' 'FOLLOW'

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...321
Loading property file /tmp/ReachabilityCardinality15796147237099606686.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 28
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :28 after 59
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :59 after 152
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :152 after 1239
Reachability property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
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,1815,0.042022,5516,2,2037,11,8367,6,0,345,3451,0
Total reachable state count : 1815

Verifying 1 reachability properties.
Reachability property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11 is true.

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-d1m08-ReachabilityCardinality-11,9,0.042412,5516,2,139,11,8367,7,0,348,3451,0
[2022-06-09 12:48:50] [INFO ] Flatten gal took : 11 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7489528016480913685
[2022-06-09 12:48:50] [INFO ] Applying decomposition
[2022-06-09 12:48:50] [INFO ] Flatten gal took : 15 ms
[2022-06-09 12:48:50] [INFO ] Flatten gal took : 6 ms
[2022-06-09 12:48:50] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2022-06-09 12:48:50] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:48:50] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2022-06-09 12:48:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:48:50] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2022-06-09 12:48:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 12:48:50] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7489528016480913685
Running compilation step : cd /tmp/ltsmin7489528016480913685;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-09 12:48:50] [INFO ] Input system was already deterministic with 100 transitions.
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/graph606648352374699671.txt' '-o' '/tmp/graph606648352374699671.bin' '-w' '/tmp/graph606648352374699671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph606648352374699671.bin' '-l' '-1' '-v' '-w' '/tmp/graph606648352374699671.weights' '-q' '0' '-e' '0.001'
[2022-06-09 12:48:50] [INFO ] Decomposing Gal with order
[2022-06-09 12:48:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-09 12:48:50] [INFO ] Removed a total of 93 redundant transitions.
[2022-06-09 12:48:50] [INFO ] Ran tautology test, simplified 0 / 1 in 245 ms.
[2022-06-09 12:48:50] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=0 took 19 ms
[2022-06-09 12:48:50] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=1 took 0 ms
[2022-06-09 12:48:50] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=2 took 19 ms
[2022-06-09 12:48:50] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=3 took 22 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 100 rows 83 cols
[2022-06-09 12:48:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:50] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 12:48:50] [INFO ] Flatten gal took : 167 ms
[2022-06-09 12:48:50] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=4 took 52 ms
[2022-06-09 12:48:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 72 labels/synchronizations in 35 ms.
[2022-06-09 12:48:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1577880254501410889.gal : 3 ms
[2022-06-09 12:48:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12213654018063993598.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/ReachabilityCardinality1577880254501410889.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12213654018063993598.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...299
Loading property file /tmp/ReachabilityCardinality12213654018063993598.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 28
[2022-06-09 12:48:50] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=5 took 63 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 38
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :38 after 322
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :322 after 6378
[2022-06-09 12:48:50] [INFO ] Proved 83 variables to be positive in 312 ms
[2022-06-09 12:48:50] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=6 took 214 ms
[2022-06-09 12:48:50] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDBSingleClientW-PT-d1m08-ReachabilityCardinality-11
[2022-06-09 12:48:50] [INFO ] KInduction solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(SAT) depth K=0 took 33 ms
[2022-06-09 12:48:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDBSingleClientW-PT-d1m08-ReachabilityCardinality-11
[2022-06-09 12:48:51] [INFO ] KInduction solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(SAT) depth K=1 took 50 ms
Compilation finished in 805 ms.
Running link step : cd /tmp/ltsmin7489528016480913685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 93 ms.
Running LTSmin : cd /tmp/ltsmin7489528016480913685;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'DBSingleClientWPTd1m08ReachabilityCardinality11==true'
[2022-06-09 12:48:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDBSingleClientW-PT-d1m08-ReachabilityCardinality-11
[2022-06-09 12:48:51] [INFO ] KInduction solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(SAT) depth K=2 took 264 ms
[2022-06-09 12:48:51] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=7 took 460 ms
[2022-06-09 12:48:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDBSingleClientW-PT-d1m08-ReachabilityCardinality-11
[2022-06-09 12:48:51] [INFO ] KInduction solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(SAT) depth K=3 took 376 ms
[2022-06-09 12:48:53] [INFO ] BMC solution for property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11(UNSAT) depth K=8 took 1800 ms
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,1.298e+07,2.8261,56952,2094,554,69596,4264,331,281104,99,34798,0
Total reachable state count : 12979982

Verifying 1 reachability properties.
Reachability property DBSingleClientW-PT-d1m08-ReachabilityCardinality-11 is true.
FORMULA DBSingleClientW-PT-d1m08-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING 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-d1m08-ReachabilityCardinality-11,24,2.82975,56952,31,32,69596,4264,331,281104,101,34798,0
[2022-06-09 12:48:57] [WARNING] Interrupting SMT solver.
ITS tools runner thread asked to quit. Dying gracefully.
[2022-06-09 12:48:57] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-09 12:48:57] [WARNING] Unexpected error occurred while running SMT. Was verifying DBSingleClientW-PT-d1m08-ReachabilityCardinality-11 K-induction depth 4
[2022-06-09 12:48:57] [WARNING] Unexpected error occurred while running SMT. Was verifying DBSingleClientW-PT-d1m08-ReachabilityCardinality-11 SMT depth 9
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 2 more
Exception in thread "Thread-9" [2022-06-09 12:48:57] [INFO ] During BMC, SMT solver timed out at depth 9
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:587)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 2 more
[2022-06-09 12:48:57] [INFO ] BMC solving timed out (3600000 secs) at depth 9
[2022-06-09 12:48:57] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 31756 ms.

BK_STOP 1654778937760

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-d1m08"
export BK_EXAMINATION="ReachabilityCardinality"
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-d1m08, examination is ReachabilityCardinality"
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-165472281900222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m08.tgz
mv DBSingleClientW-PT-d1m08 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;