fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r042-smll-165252095700415
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DES-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
433.535 54819.00 74198.00 218.10 TTTTFTFTFFFTTFFT 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.r042-smll-165252095700415.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 DES-PT-01b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700415
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 29 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 15:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 29 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 29 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 15:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Apr 29 15:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 68K May 10 09:33 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 DES-PT-01b-ReachabilityFireability-00
FORMULA_NAME DES-PT-01b-ReachabilityFireability-01
FORMULA_NAME DES-PT-01b-ReachabilityFireability-02
FORMULA_NAME DES-PT-01b-ReachabilityFireability-03
FORMULA_NAME DES-PT-01b-ReachabilityFireability-04
FORMULA_NAME DES-PT-01b-ReachabilityFireability-05
FORMULA_NAME DES-PT-01b-ReachabilityFireability-06
FORMULA_NAME DES-PT-01b-ReachabilityFireability-07
FORMULA_NAME DES-PT-01b-ReachabilityFireability-08
FORMULA_NAME DES-PT-01b-ReachabilityFireability-09
FORMULA_NAME DES-PT-01b-ReachabilityFireability-10
FORMULA_NAME DES-PT-01b-ReachabilityFireability-11
FORMULA_NAME DES-PT-01b-ReachabilityFireability-12
FORMULA_NAME DES-PT-01b-ReachabilityFireability-13
FORMULA_NAME DES-PT-01b-ReachabilityFireability-14
FORMULA_NAME DES-PT-01b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654183165616

Running Version 202205111006
[2022-06-02 15:19:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-02 15:19:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 15:19:27] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2022-06-02 15:19:27] [INFO ] Transformed 284 places.
[2022-06-02 15:19:27] [INFO ] Transformed 235 transitions.
[2022-06-02 15:19:27] [INFO ] Found NUPN structural information;
[2022-06-02 15:19:27] [INFO ] Parsed PT model containing 284 places and 235 transitions in 304 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 96 resets, run finished after 688 ms. (steps per millisecond=14 ) properties (out of 16) seen :12
FORMULA DES-PT-01b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-01b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :1
FORMULA DES-PT-01b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 3 properties.
// Phase 1: matrix 235 rows 284 cols
[2022-06-02 15:19:29] [INFO ] Computed 65 place invariants in 55 ms
[2022-06-02 15:19:29] [INFO ] After 332ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-06-02 15:19:29] [INFO ] [Nat]Absence check using 40 positive place invariants in 22 ms returned sat
[2022-06-02 15:19:29] [INFO ] [Nat]Absence check using 40 positive and 25 generalized place invariants in 16 ms returned sat
[2022-06-02 15:19:30] [INFO ] After 273ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2022-06-02 15:19:30] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 7 ms to minimize.
[2022-06-02 15:19:30] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2022-06-02 15:19:30] [INFO ] Deduced a trap composed of 20 places in 96 ms of which 1 ms to minimize.
[2022-06-02 15:19:30] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2022-06-02 15:19:30] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2022-06-02 15:19:30] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2022-06-02 15:19:30] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 667 ms
[2022-06-02 15:19:30] [INFO ] After 1013ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-06-02 15:19:31] [INFO ] After 1309ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
FORMULA DES-PT-01b-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-01b-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 43 ms.
Support contains 23 out of 284 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 284/284 places, 235/235 transitions.
Graph (complete) has 513 edges and 284 vertex of which 273 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 273 transition count 210
Reduce places removed 18 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 255 transition count 208
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 253 transition count 208
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 43 place count 253 transition count 202
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 55 place count 247 transition count 202
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 72 place count 230 transition count 185
Iterating global reduction 3 with 17 rules applied. Total rules applied 89 place count 230 transition count 185
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 89 place count 230 transition count 184
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 229 transition count 184
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 103 place count 217 transition count 172
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 217 transition count 172
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 13 rules applied. Total rules applied 128 place count 217 transition count 159
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 131 place count 215 transition count 158
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 131 place count 215 transition count 157
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 133 place count 214 transition count 157
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 5 with 118 rules applied. Total rules applied 251 place count 155 transition count 98
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 255 place count 153 transition count 100
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 153 transition count 98
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 259 place count 151 transition count 98
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 260 place count 151 transition count 98
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 261 place count 150 transition count 97
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 263 place count 148 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 264 place count 148 transition count 97
Applied a total of 264 rules in 164 ms. Remains 148 /284 variables (removed 136) and now considering 97/235 (removed 138) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/284 places, 97/235 transitions.
Incomplete random walk after 1000000 steps, including 30249 resets, run finished after 2476 ms. (steps per millisecond=403 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5422 resets, run finished after 2094 ms. (steps per millisecond=477 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 6242092 steps, run timeout after 12001 ms. (steps per millisecond=520 ) properties seen :{}
Probabilistic random walk after 6242092 steps, saw 785347 distinct states, run finished after 12003 ms. (steps per millisecond=520 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 97 rows 148 cols
[2022-06-02 15:19:47] [INFO ] Computed 59 place invariants in 7 ms
[2022-06-02 15:19:47] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:19:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-06-02 15:19:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2022-06-02 15:19:48] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:19:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 15:19:48] [INFO ] After 43ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:19:48] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2022-06-02 15:19:48] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2022-06-02 15:19:48] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2022-06-02 15:19:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2022-06-02 15:19:48] [INFO ] After 299ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-02 15:19:48] [INFO ] After 598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 48 ms.
Support contains 23 out of 148 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 148/148 places, 97/97 transitions.
Applied a total of 0 rules in 12 ms. Remains 148 /148 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 148/148 places, 97/97 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 148/148 places, 97/97 transitions.
Applied a total of 0 rules in 10 ms. Remains 148 /148 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 148 cols
[2022-06-02 15:19:48] [INFO ] Computed 59 place invariants in 7 ms
[2022-06-02 15:19:48] [INFO ] Implicit Places using invariants in 173 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 180 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 147/148 places, 97/97 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 147 transition count 96
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 146 transition count 96
Applied a total of 2 rules in 10 ms. Remains 146 /147 variables (removed 1) and now considering 96/97 (removed 1) transitions.
// Phase 1: matrix 96 rows 146 cols
[2022-06-02 15:19:48] [INFO ] Computed 58 place invariants in 2 ms
[2022-06-02 15:19:48] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 96 rows 146 cols
[2022-06-02 15:19:48] [INFO ] Computed 58 place invariants in 4 ms
[2022-06-02 15:19:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 15:19:49] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [12, 45, 66, 68, 70, 72, 84, 89, 91, 141]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 380 ms to find 10 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 136/148 places, 96/97 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 136 transition count 93
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 133 transition count 93
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 132 transition count 89
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 132 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 125 transition count 86
Applied a total of 18 rules in 17 ms. Remains 125 /136 variables (removed 11) and now considering 86/96 (removed 10) transitions.
// Phase 1: matrix 86 rows 125 cols
[2022-06-02 15:19:49] [INFO ] Computed 44 place invariants in 2 ms
[2022-06-02 15:19:49] [INFO ] Implicit Places using invariants in 103 ms returned [77, 88]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 104 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 3 : 123/148 places, 86/97 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions, in 4 iterations. Remains : 123/148 places, 86/97 transitions.
Incomplete random walk after 1000000 steps, including 30377 resets, run finished after 1802 ms. (steps per millisecond=554 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5499 resets, run finished after 1695 ms. (steps per millisecond=589 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5225239 steps, run timeout after 9001 ms. (steps per millisecond=580 ) properties seen :{}
Probabilistic random walk after 5225239 steps, saw 767008 distinct states, run finished after 9001 ms. (steps per millisecond=580 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:01] [INFO ] Computed 42 place invariants in 1 ms
[2022-06-02 15:20:01] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:20:01] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2022-06-02 15:20:01] [INFO ] [Nat]Absence check using 25 positive and 17 generalized place invariants in 7 ms returned sat
[2022-06-02 15:20:01] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:20:02] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-06-02 15:20:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-06-02 15:20:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 121 ms
[2022-06-02 15:20:02] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-02 15:20:02] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 23 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 86/86 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 86/86 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 86/86 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:02] [INFO ] Computed 42 place invariants in 2 ms
[2022-06-02 15:20:02] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:02] [INFO ] Computed 42 place invariants in 1 ms
[2022-06-02 15:20:02] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
[2022-06-02 15:20:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:02] [INFO ] Computed 42 place invariants in 2 ms
[2022-06-02 15:20:02] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 86/86 transitions.
Incomplete random walk after 1000000 steps, including 30487 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5520 resets, run finished after 1705 ms. (steps per millisecond=586 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 5096382 steps, run timeout after 9001 ms. (steps per millisecond=566 ) properties seen :{}
Probabilistic random walk after 5096382 steps, saw 745877 distinct states, run finished after 9001 ms. (steps per millisecond=566 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:15] [INFO ] Computed 42 place invariants in 5 ms
[2022-06-02 15:20:15] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:20:15] [INFO ] [Nat]Absence check using 25 positive place invariants in 5 ms returned sat
[2022-06-02 15:20:15] [INFO ] [Nat]Absence check using 25 positive and 17 generalized place invariants in 5 ms returned sat
[2022-06-02 15:20:15] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:20:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2022-06-02 15:20:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2022-06-02 15:20:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2022-06-02 15:20:15] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-06-02 15:20:15] [INFO ] After 273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 23 out of 123 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 86/86 transitions.
Applied a total of 0 rules in 4 ms. Remains 123 /123 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 86/86 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 123/123 places, 86/86 transitions.
Applied a total of 0 rules in 5 ms. Remains 123 /123 variables (removed 0) and now considering 86/86 (removed 0) transitions.
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:15] [INFO ] Computed 42 place invariants in 1 ms
[2022-06-02 15:20:15] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:15] [INFO ] Computed 42 place invariants in 2 ms
[2022-06-02 15:20:16] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2022-06-02 15:20:16] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:16] [INFO ] Computed 42 place invariants in 26 ms
[2022-06-02 15:20:16] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 123/123 places, 86/86 transitions.
Applied a total of 0 rules in 7 ms. Remains 123 /123 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 86 rows 123 cols
[2022-06-02 15:20:16] [INFO ] Computed 42 place invariants in 2 ms
[2022-06-02 15:20:16] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 15:20:16] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2022-06-02 15:20:16] [INFO ] [Nat]Absence check using 25 positive and 17 generalized place invariants in 8 ms returned sat
[2022-06-02 15:20:16] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 15:20:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2022-06-02 15:20:16] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2022-06-02 15:20:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 115 ms
[2022-06-02 15:20:16] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2022-06-02 15:20:16] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 15:20:17] [INFO ] Flatten gal took : 86 ms
[2022-06-02 15:20:17] [INFO ] Flatten gal took : 32 ms
[2022-06-02 15:20:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8229490725661773253.gal : 15 ms
[2022-06-02 15:20:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16686467259728018968.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8229490725661773253.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16686467259728018968.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality16686467259728018968.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 51
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :51 after 511
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :511 after 639
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :639 after 4205
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :4205 after 5671
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5671 after 260378
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.2602e+06 after 1.96515e+07
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.96515e+07 after 1.42435e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.42435e+08 after 1.04992e+09
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,1.42093e+09,3.00507,18468,2,19547,17,73995,7,0,611,52078,0
Total reachable state count : 1420934684

Verifying 1 reachability properties.
Invariant property DES-PT-01b-ReachabilityFireability-00 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-01b-ReachabilityFireability-00,0,3.02183,18468,1,0,17,73995,7,0,638,52078,0
FORMULA DES-PT-01b-ReachabilityFireability-00 TRUE TECHNIQUES OVER_APPROXIMATION
All properties solved without resorting to model-checking.
Total runtime 52640 ms.

BK_STOP 1654183220435

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="DES-PT-01b"
export BK_EXAMINATION="ReachabilityFireability"
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 DES-PT-01b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-smll-165252095700415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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