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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
531.976 11235.00 20870.00 211.20 TTFFFFTFFTFFFTFF 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-165472282000259.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-d2m06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r312-tall-165472282000259
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Jun 7 17:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Jun 7 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K Jun 7 17:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Jun 6 15:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 11K Jun 7 17:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Jun 7 17:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 7 17:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 7 17:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 6 15:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 1.6M Jun 6 12:11 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654783193759

Running Version 202205111006
[2022-06-09 13:59:54] [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 13:59:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-09 13:59:55] [INFO ] Load time of PNML (sax parser for PT used): 206 ms
[2022-06-09 13:59:55] [INFO ] Transformed 4763 places.
[2022-06-09 13:59:55] [INFO ] Transformed 2478 transitions.
[2022-06-09 13:59:55] [INFO ] Parsed PT model containing 4763 places and 2478 transitions in 322 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 3580 places in 19 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 389 places :
Symmetric choice reduction at 1 with 389 rule applications. Total rules 634 place count 748 transition count 1211
Iterating global reduction 1 with 389 rules applied. Total rules applied 1023 place count 748 transition count 1211
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1032 place count 748 transition count 1202
Discarding 313 places :
Symmetric choice reduction at 2 with 313 rule applications. Total rules 1345 place count 435 transition count 889
Iterating global reduction 2 with 313 rules applied. Total rules applied 1658 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 1670 place count 435 transition count 877
Discarding 239 places :
Symmetric choice reduction at 3 with 239 rule applications. Total rules 1909 place count 196 transition count 536
Iterating global reduction 3 with 239 rules applied. Total rules applied 2148 place count 196 transition count 536
Ensure Unique test removed 208 transitions
Reduce isomorphic transitions removed 208 transitions.
Iterating post reduction 3 with 208 rules applied. Total rules applied 2356 place count 196 transition count 328
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 2381 place count 171 transition count 282
Iterating global reduction 4 with 25 rules applied. Total rules applied 2406 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 2412 place count 171 transition count 276
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2429 place count 154 transition count 259
Iterating global reduction 5 with 17 rules applied. Total rules applied 2446 place count 154 transition count 259
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 2450 place count 154 transition count 255
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 2464 place count 140 transition count 241
Iterating global reduction 6 with 14 rules applied. Total rules applied 2478 place count 140 transition count 241
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 2491 place count 140 transition count 228
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 2495 place count 136 transition count 212
Iterating global reduction 7 with 4 rules applied. Total rules applied 2499 place count 136 transition count 212
Applied a total of 2499 rules in 189 ms. Remains 136 /1183 variables (removed 1047) and now considering 212/2478 (removed 2266) transitions.
// Phase 1: matrix 212 rows 136 cols
[2022-06-09 13:59:55] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-09 13:59:55] [INFO ] Implicit Places using invariants in 252 ms returned []
// Phase 1: matrix 212 rows 136 cols
[2022-06-09 13:59:55] [INFO ] Computed 2 place invariants in 3 ms
[2022-06-09 13:59:55] [INFO ] State equation strengthened by 87 read => feed constraints.
[2022-06-09 13:59:56] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
// Phase 1: matrix 212 rows 136 cols
[2022-06-09 13:59:56] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 13:59:56] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 136/1183 places, 212/2478 transitions.
Finished structural reductions, in 1 iterations. Remains : 136/1183 places, 212/2478 transitions.
Support contains 3 out of 136 places after structural reductions.
[2022-06-09 13:59:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-06-09 13:59:56] [INFO ] Flatten gal took : 46 ms
[2022-06-09 13:59:56] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-09 13:59:56] [INFO ] Flatten gal took : 19 ms
[2022-06-09 13:59:56] [INFO ] Input system was already deterministic with 212 transitions.
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1011 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1003 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 935 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1974492 steps, run timeout after 3001 ms. (steps per millisecond=657 ) properties seen :{0=1, 1=1}
Probabilistic random walk after 1974492 steps, saw 801364 distinct states, run finished after 3002 ms. (steps per millisecond=657 ) properties seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 212 rows 136 cols
[2022-06-09 14:00:00] [INFO ] Computed 2 place invariants in 5 ms
[2022-06-09 14:00:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-09 14:00:00] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-09 14:00:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 5 stabilizing places and 5 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 212/212 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 134 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 134 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 132 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 132 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 132 transition count 207
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 130 transition count 198
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 130 transition count 198
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 130 transition count 195
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 18 place count 128 transition count 183
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 128 transition count 183
Applied a total of 20 rules in 12 ms. Remains 128 /136 variables (removed 8) and now considering 183/212 (removed 29) transitions.
// Phase 1: matrix 183 rows 128 cols
[2022-06-09 14:00:00] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:00] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 183 rows 128 cols
[2022-06-09 14:00:00] [INFO ] Computed 2 place invariants in 9 ms
[2022-06-09 14:00:00] [INFO ] State equation strengthened by 62 read => feed constraints.
[2022-06-09 14:00:01] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
// Phase 1: matrix 183 rows 128 cols
[2022-06-09 14:00:01] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-09 14:00:01] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/136 places, 183/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 128/136 places, 183/212 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s88 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-02 finished in 1205 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(X(F(G(G(p0)))))))))'
Support contains 1 out of 136 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 136/136 places, 212/212 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 134 transition count 210
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 134 transition count 210
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 132 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 132 transition count 208
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 130 transition count 206
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 130 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 16 place count 130 transition count 202
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 127 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 127 transition count 182
Applied a total of 22 rules in 32 ms. Remains 127 /136 variables (removed 9) and now considering 182/212 (removed 30) transitions.
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:00:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:01] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:00:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:01] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 14:00:01] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2022-06-09 14:00:01] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:00:01] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:02] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 127/136 places, 182/212 transitions.
Finished structural reductions, in 1 iterations. Remains : 127/136 places, 182/212 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s8)], 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 22931 reset in 309 ms.
Product exploration explored 100000 steps with 22985 reset in 164 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 113 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)]
Incomplete random walk after 10000 steps, including 2296 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 959 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20667 steps, run visited all 1 properties in 64 ms. (steps per millisecond=322 )
Probabilistic random walk after 20667 steps, saw 10204 distinct states, run finished after 64 ms. (steps per millisecond=322 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 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)]
Stuttering acceptance computed with spot in 26 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 17 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 14:00:03] [INFO ] Computed 2 place invariants in 1 ms
[2022-06-09 14:00:03] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:00:03] [INFO ] Computed 2 place invariants in 2 ms
[2022-06-09 14:00:03] [INFO ] State equation strengthened by 61 read => feed constraints.
[2022-06-09 14:00:03] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2022-06-09 14:00:03] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 182 rows 127 cols
[2022-06-09 14:00:03] [INFO ] Computed 2 place invariants in 4 ms
[2022-06-09 14:00:03] [INFO ] Dead Transitions using invariants and state equation in 92 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 90 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 24 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20667 steps, run visited all 1 properties in 40 ms. (steps per millisecond=516 )
Probabilistic random walk after 20667 steps, saw 10204 distinct states, run finished after 40 ms. (steps per millisecond=516 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23001 reset in 121 ms.
Product exploration explored 100000 steps with 22923 reset in 140 ms.
Built C files in :
/tmp/ltsmin10169162569316880845
[2022-06-09 14:00:04] [INFO ] Computing symmetric may disable matrix : 182 transitions.
[2022-06-09 14:00:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:04] [INFO ] Computing symmetric may enable matrix : 182 transitions.
[2022-06-09 14:00:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:04] [INFO ] Computing Do-Not-Accords matrix : 182 transitions.
[2022-06-09 14:00:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-09 14:00:04] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10169162569316880845
Running compilation step : cd /tmp/ltsmin10169162569316880845;'/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 461 ms.
Running link step : cd /tmp/ltsmin10169162569316880845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10169162569316880845;'/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/stateBased3899504849719309437.hoa' '--buchi-type=spotba'
LTSmin run took 220 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLCardinality-10 finished in 3357 ms.
All properties solved by simple procedures.
Total runtime 10086 ms.

BK_STOP 1654783204994

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

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