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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1686.976 37285.00 105076.00 1625.20 TTTFFFTTTFFFFFTT 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-165472282000283.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-d2m09, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282000283
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 5.5K Jun 7 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 7 17:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 7 17:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jun 6 15:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 14K Jun 7 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Jun 7 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Jun 7 17:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.6M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654787840713

Running Version 202205111006
[2022-06-09 15:17:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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:17:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 15:17:22] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2022-06-09 15:17:22] [INFO ] Transformed 4763 places.
[2022-06-09 15:17:22] [INFO ] Transformed 2478 transitions.
[2022-06-09 15:17:22] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 371 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 3580 places in 16 ms
Reduce places removed 3580 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1138 transition count 2281
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 631 place count 749 transition count 1212
Iterating global reduction 1 with 389 rules applied. Total rules applied 1020 place count 749 transition count 1212
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1029 place count 749 transition count 1203
Discarding 314 places :
Symmetric choice reduction at 2 with 314 rule applications. Total rules 1343 place count 435 transition count 889
Iterating global reduction 2 with 314 rules applied. Total rules applied 1657 place count 435 transition count 889
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 1669 place count 435 transition count 877
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1908 place count 196 transition count 538
Iterating global reduction 3 with 239 rules applied. Total rules applied 2147 place count 196 transition count 538
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 3 with 210 rules applied. Total rules applied 2357 place count 196 transition count 328
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2382 place count 171 transition count 282
Iterating global reduction 4 with 25 rules applied. Total rules applied 2407 place count 171 transition count 282
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2413 place count 171 transition count 276
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 2429 place count 155 transition count 260
Iterating global reduction 5 with 16 rules applied. Total rules applied 2445 place count 155 transition count 260
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2449 place count 155 transition count 256
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 2462 place count 142 transition count 243
Iterating global reduction 6 with 13 rules applied. Total rules applied 2475 place count 142 transition count 243
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 6 with 11 rules applied. Total rules applied 2486 place count 142 transition count 232
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 2492 place count 136 transition count 204
Iterating global reduction 7 with 6 rules applied. Total rules applied 2498 place count 136 transition count 204
Applied a total of 2498 rules in 194 ms. Remains 136 /1183 variables (removed 1047) and now considering 204/2478 (removed 2274) transitions.
// Phase 1: matrix 204 rows 136 cols
[2022-06-09 15:17:22] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-09 15:17:22] [INFO ] Implicit Places using invariants in 241 ms returned []
// Phase 1: matrix 204 rows 136 cols
[2022-06-09 15:17:22] [INFO ] Computed 2 place invariants in 11 ms
[2022-06-09 15:17:22] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 15:17:23] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
// Phase 1: matrix 204 rows 136 cols
[2022-06-09 15:17:23] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:17:23] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/1183 places, 204/2478 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/1183 places, 204/2478 transitions.
Support contains 5 out of 136 places after structural reductions.
[2022-06-09 15:17:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-09 15:17:23] [INFO ] Flatten gal took : 50 ms
[2022-06-09 15:17:23] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-09 15:17:23] [INFO ] Flatten gal took : 20 ms
[2022-06-09 15:17:23] [INFO ] Input system was already deterministic with 204 transitions.
Incomplete random walk after 10000 steps, including 2304 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 956 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 905 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 919 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 204 rows 136 cols
[2022-06-09 15:17:24] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 15:17:24] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-09 15:17:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 15:17:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 15:17:24] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2022-06-09 15:17:24] [INFO ] State equation strengthened by 74 read => feed constraints.
[2022-06-09 15:17:24] [INFO ] After 71ms SMT Verify possible using 74 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2022-06-09 15:17:24] [INFO ] After 114ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2022-06-09 15:17:24] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 136 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 136/136 places, 204/204 transitions.
Graph (complete) has 466 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.680 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 135 transition count 201
Applied a total of 4 rules in 703 ms. Remains 135 /136 variables (removed 1) and now considering 201/204 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 135/136 places, 201/204 transitions.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 967 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 907 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 950 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 3) seen :0
Finished probabilistic random walk after 22399 steps, run visited all 3 properties in 242 ms. (steps per millisecond=92 )
Probabilistic random walk after 22399 steps, saw 11073 distinct states, run finished after 243 ms. (steps per millisecond=92 ) properties seen :3
Computed a total of 5 stabilizing places and 5 stable transitions
Graph (complete) has 497 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(G(p0)))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 204/204 transitions.
Graph (complete) has 497 edges and 136 vertex of which 135 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 133 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 133 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 131 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 131 transition count 198
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 131 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 129 transition count 187
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 129 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 129 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 128 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 128 transition count 185
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 127 transition count 184
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 127 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 127 transition count 182
Applied a total of 22 rules in 61 ms. Remains 127 /136 variables (removed 9) and now considering 182/204 (removed 22) transitions.
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 15:17:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:26] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 15:17:26] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 15:17:26] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
[2022-06-09 15:17:26] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 15:17:26] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:26] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/136 places, 182/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/136 places, 182/204 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s8 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23072 reset in 450 ms.
Product exploration explored 100000 steps with 22925 reset in 184 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2303 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 956 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18963 steps, run visited all 1 properties in 35 ms. (steps per millisecond=541 )
Probabilistic random walk after 18963 steps, saw 9332 distinct states, run finished after 35 ms. (steps per millisecond=541 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 1 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 182/182 transitions.
Applied a total of 0 rules in 18 ms. Remains 127 /127 variables (removed 0) and now considering 182/182 (removed 0) transitions.
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 15:17:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:27] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 15:17:27] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:27] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 15:17:28] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2022-06-09 15:17:28] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 15:17:28] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:28] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 182/182 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 933 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 18963 steps, run visited all 1 properties in 178 ms. (steps per millisecond=106 )
Probabilistic random walk after 18963 steps, saw 9332 distinct states, run finished after 178 ms. (steps per millisecond=106 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23032 reset in 142 ms.
Product exploration explored 100000 steps with 23067 reset in 144 ms.
Built C files in :
/tmp/ltsmin15383709526323120619
[2022-06-09 15:17:29] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2022-06-09 15:17:29] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:17:29] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2022-06-09 15:17:29] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:17:29] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2022-06-09 15:17:29] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 15:17:29] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15383709526323120619
Running compilation step : cd /tmp/ltsmin15383709526323120619;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 1488 ms.
Running link step : cd /tmp/ltsmin15383709526323120619;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin15383709526323120619;'/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' '--hoa' '/tmp/stateBased625577426959729738.hoa' '--buchi-type=spotba'
LTSmin run took 1495 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLCardinality-03 finished in 6193 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(X(p0))||p1))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 204/204 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 135 transition count 203
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 133 transition count 201
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 133 transition count 201
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 8 place count 131 transition count 199
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 131 transition count 199
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 131 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 13 place count 129 transition count 188
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 129 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 129 transition count 187
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 128 transition count 186
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 128 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 127 transition count 185
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 127 transition count 185
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 22 place count 127 transition count 183
Applied a total of 22 rules in 14 ms. Remains 127 /136 variables (removed 9) and now considering 183/204 (removed 21) transitions.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:32] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:32] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:32] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:17:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 15:17:32] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:32] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/136 places, 183/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/136 places, 183/204 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(LEQ s8 0), p1:(LEQ s101 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23018 reset in 227 ms.
Product exploration explored 100000 steps with 22961 reset in 144 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2325 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 969 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:33] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 15:17:33] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:17:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 15:17:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 15:17:33] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:17:33] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 15:17:33] [INFO ] After 25ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:17:33] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-09 15:17:33] [INFO ] After 147ms 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 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 183/183 transitions.
Graph (complete) has 434 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 126 transition count 180
Applied a total of 4 rules in 7 ms. Remains 126 /127 variables (removed 1) and now considering 180/183 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/127 places, 180/183 transitions.
Incomplete random walk after 10000 steps, including 2276 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 988 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16802 steps, run visited all 1 properties in 34 ms. (steps per millisecond=494 )
Probabilistic random walk after 16802 steps, saw 8316 distinct states, run finished after 34 ms. (steps per millisecond=494 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 183/183 transitions.
Applied a total of 0 rules in 2 ms. Remains 127 /127 variables (removed 0) and now considering 183/183 (removed 0) transitions.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:34] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:34] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:34] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 15:17:34] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:34] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 15:17:34] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 183/183 transitions.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 1107 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:35] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:35] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-09 15:17:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-09 15:17:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 9 ms returned sat
[2022-06-09 15:17:35] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-09 15:17:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 15:17:36] [INFO ] After 23ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-09 15:17:36] [INFO ] After 37ms 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 15:17:36] [INFO ] After 134ms 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 127 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 127/127 places, 183/183 transitions.
Graph (complete) has 434 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 126 transition count 180
Applied a total of 4 rules in 11 ms. Remains 126 /127 variables (removed 1) and now considering 180/183 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 126/127 places, 180/183 transitions.
Incomplete random walk after 10000 steps, including 2310 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 927 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16802 steps, run visited all 1 properties in 33 ms. (steps per millisecond=509 )
Probabilistic random walk after 16802 steps, saw 8316 distinct states, run finished after 33 ms. (steps per millisecond=509 ) properties seen :1
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 186 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 22975 reset in 141 ms.
Product exploration explored 100000 steps with 22948 reset in 151 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 183/183 transitions.
Applied a total of 0 rules in 12 ms. Remains 127 /127 variables (removed 0) and now considering 183/183 (removed 0) transitions.
[2022-06-09 15:17:37] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:37] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:37] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 183/183 transitions.
Product exploration explored 100000 steps with 22984 reset in 186 ms.
Product exploration explored 100000 steps with 22973 reset in 178 ms.
Built C files in :
/tmp/ltsmin14620508226167414141
[2022-06-09 15:17:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14620508226167414141
Running compilation step : cd /tmp/ltsmin14620508226167414141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 274 ms.
Running link step : cd /tmp/ltsmin14620508226167414141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14620508226167414141;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3089511823343456004.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 183/183 transitions.
Applied a total of 0 rules in 3 ms. Remains 127 /127 variables (removed 0) and now considering 183/183 (removed 0) transitions.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:52] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:52] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:52] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:52] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 15:17:53] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
// Phase 1: matrix 183 rows 127 cols
[2022-06-09 15:17:53] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 15:17:53] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/127 places, 183/183 transitions.
Built C files in :
/tmp/ltsmin2437183691469001290
[2022-06-09 15:17:53] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2437183691469001290
Running compilation step : cd /tmp/ltsmin2437183691469001290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' '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'
Compilation finished in 290 ms.
Running link step : cd /tmp/ltsmin2437183691469001290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2437183691469001290;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1372977547858485930.hoa' '--buchi-type=spotba'
LTSmin run took 3018 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m09-LTLCardinality-05 finished in 24323 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(p0) U !X(F(p0))))))'
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 204/204 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 134 transition count 202
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 134 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 132 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 132 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 132 transition count 197
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 131 transition count 189
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 131 transition count 189
Applied a total of 12 rules in 12 ms. Remains 131 /136 variables (removed 5) and now considering 189/204 (removed 15) transitions.
// Phase 1: matrix 189 rows 131 cols
[2022-06-09 15:17:57] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 15:17:57] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 189 rows 131 cols
[2022-06-09 15:17:57] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 15:17:57] [INFO ] State equation strengthened by 64 read => feed constraints.
[2022-06-09 15:17:57] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
// Phase 1: matrix 189 rows 131 cols
[2022-06-09 15:17:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 15:17:57] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 131/136 places, 189/204 transitions.
Finished structural reductions, in 1 iterations. Remains : 131/136 places, 189/204 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, true, p0]
Running random walk in product with property : DBSingleClientW-PT-d2m09-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s129 s91)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m09-LTLCardinality-09 finished in 1293 ms.
All properties solved by simple procedures.
Total runtime 36076 ms.

BK_STOP 1654787877998

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

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