Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117600014.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-01a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117600014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 11 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 201K May 18 16:42 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 ASLink-PT-01a-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-01a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717179006949

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:10:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:10:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:10:09] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2024-05-31 18:10:09] [INFO ] Transformed 431 places.
[2024-05-31 18:10:09] [INFO ] Transformed 735 transitions.
[2024-05-31 18:10:09] [INFO ] Found NUPN structural information;
[2024-05-31 18:10:09] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 635 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (799 resets) in 2810 ms. (14 steps per ms) remains 4/13 properties
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (293 resets) in 758 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (290 resets) in 511 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (263 resets) in 374 ms. (106 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (224 resets) in 541 ms. (73 steps per ms) remains 4/4 properties
// Phase 1: matrix 728 rows 431 cols
[2024-05-31 18:10:11] [INFO ] Computed 80 invariants in 63 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 74/125 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 74/137 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 23/148 variables, 7/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 23/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem ASLink-PT-01a-ReachabilityCardinality-2024-13 is UNSAT
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 277/425 variables, 57/225 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/425 variables, 277/502 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/425 variables, 0/502 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/431 variables, 3/505 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 6/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1159 variables, 0/942 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 942 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1952 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 45/55 variables, 7/17 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 45/62 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 56/111 variables, 12/74 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 56/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 310/421 variables, 56/186 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 310/496 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 0/496 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 10/431 variables, 5/501 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/431 variables, 10/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/431 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 728/1159 variables, 431/942 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1159 variables, 3/945 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-31 18:10:16] [INFO ] Deduced a trap composed of 51 places in 517 ms of which 82 ms to minimize.
[2024-05-31 18:10:17] [INFO ] Deduced a trap composed of 26 places in 709 ms of which 11 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1159 variables, 2/947 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1159 variables, 0/947 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1159 variables, 0/947 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 947 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5013 ms.
Refiners :[Domain max(s): 431/431 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 61/61 constraints, State Equation: 431/431 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 7197ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1067 ms.
Support contains 10 out of 431 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 425 transition count 702
Reduce places removed 26 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 61 place count 399 transition count 699
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 396 transition count 699
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 64 place count 396 transition count 671
Deduced a syphon composed of 28 places in 3 ms
Ensure Unique test removed 11 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 67 rules applied. Total rules applied 131 place count 357 transition count 671
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 357 transition count 670
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 356 transition count 670
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 136 place count 353 transition count 659
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 140 place count 352 transition count 659
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 146 place count 351 transition count 654
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 149 place count 348 transition count 654
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 150 place count 347 transition count 646
Iterating global reduction 7 with 1 rules applied. Total rules applied 151 place count 347 transition count 646
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 152 place count 346 transition count 638
Iterating global reduction 7 with 1 rules applied. Total rules applied 153 place count 346 transition count 638
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 154 place count 345 transition count 630
Iterating global reduction 7 with 1 rules applied. Total rules applied 155 place count 345 transition count 630
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 156 place count 344 transition count 622
Iterating global reduction 7 with 1 rules applied. Total rules applied 157 place count 344 transition count 622
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 158 place count 343 transition count 614
Iterating global reduction 7 with 1 rules applied. Total rules applied 159 place count 343 transition count 614
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 160 place count 342 transition count 606
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 342 transition count 606
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 162 place count 341 transition count 598
Iterating global reduction 7 with 1 rules applied. Total rules applied 163 place count 341 transition count 598
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 164 place count 340 transition count 590
Iterating global reduction 7 with 1 rules applied. Total rules applied 165 place count 340 transition count 590
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 166 place count 339 transition count 582
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 339 transition count 582
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 168 place count 338 transition count 574
Iterating global reduction 7 with 1 rules applied. Total rules applied 169 place count 338 transition count 574
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 170 place count 337 transition count 566
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 337 transition count 566
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 172 place count 336 transition count 558
Iterating global reduction 7 with 1 rules applied. Total rules applied 173 place count 336 transition count 558
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 174 place count 335 transition count 550
Iterating global reduction 7 with 1 rules applied. Total rules applied 175 place count 335 transition count 550
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 176 place count 334 transition count 542
Iterating global reduction 7 with 1 rules applied. Total rules applied 177 place count 334 transition count 542
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 178 place count 333 transition count 534
Iterating global reduction 7 with 1 rules applied. Total rules applied 179 place count 333 transition count 534
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 180 place count 332 transition count 526
Iterating global reduction 7 with 1 rules applied. Total rules applied 181 place count 332 transition count 526
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 193 place count 326 transition count 520
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 194 place count 326 transition count 519
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 195 place count 325 transition count 519
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 196 place count 325 transition count 518
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 197 place count 324 transition count 518
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 198 place count 324 transition count 518
Applied a total of 198 rules in 484 ms. Remains 324 /431 variables (removed 107) and now considering 518/728 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 500 ms. Remains : 324/431 places, 518/728 transitions.
RANDOM walk for 40000 steps (754 resets) in 308 ms. (129 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (355 resets) in 168 ms. (236 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (359 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (312 resets) in 198 ms. (201 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 250668 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :1 out of 3
Probabilistic random walk after 250668 steps, saw 94407 distinct states, run finished after 3006 ms. (steps per millisecond=83 ) properties seen :1
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 518 rows 324 cols
[2024-05-31 18:10:23] [INFO ] Computed 61 invariants in 11 ms
[2024-05-31 18:10:23] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/146 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 177/323 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 518/842 variables, 324/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 7/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/842 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 324/324 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/146 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 177/323 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:10:24] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 518/842 variables, 324/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 7/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/842 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/842 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/842 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 395 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 324/324 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1775ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1648 ms.
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 518/518 transitions.
Applied a total of 0 rules in 21 ms. Remains 324 /324 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 324/324 places, 518/518 transitions.
RANDOM walk for 40000 steps (809 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (346 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (347 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 396556 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :0 out of 2
Probabilistic random walk after 396556 steps, saw 142716 distinct states, run finished after 3002 ms. (steps per millisecond=132 ) properties seen :0
[2024-05-31 18:10:30] [INFO ] Invariant cache hit.
[2024-05-31 18:10:30] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/146 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 177/323 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/324 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 518/842 variables, 324/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 7/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/842 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 392 constraints, problems are : Problem set: 0 solved, 2 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 324/324 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/78 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 68/146 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 177/323 variables, 41/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:10:31] [INFO ] Deduced a trap composed of 27 places in 320 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/324 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 518/842 variables, 324/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 7/393 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/842 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-31 18:10:35] [INFO ] Deduced a trap composed of 43 places in 238 ms of which 5 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/842 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/842 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/842 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 396 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4722 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 324/324 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 5357ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3353 ms.
Support contains 8 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 518/518 transitions.
Applied a total of 0 rules in 23 ms. Remains 324 /324 variables (removed 0) and now considering 518/518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 324/324 places, 518/518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 518/518 transitions.
Applied a total of 0 rules in 16 ms. Remains 324 /324 variables (removed 0) and now considering 518/518 (removed 0) transitions.
[2024-05-31 18:10:39] [INFO ] Invariant cache hit.
[2024-05-31 18:10:39] [INFO ] Implicit Places using invariants in 598 ms returned [1, 19, 20, 22, 51, 69, 150, 155, 168, 169, 170, 171, 189, 191, 194, 212, 213, 214, 215, 227, 234, 240, 246, 252, 258, 264, 270, 276, 282, 288]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 610 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 294/324 places, 518/518 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 294 transition count 481
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 257 transition count 479
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 255 transition count 479
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 78 place count 255 transition count 465
Deduced a syphon composed of 14 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 107 place count 240 transition count 465
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 11 rules applied. Total rules applied 118 place count 235 transition count 459
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 124 place count 229 transition count 459
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 139 place count 214 transition count 444
Iterating global reduction 5 with 15 rules applied. Total rules applied 154 place count 214 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 155 place count 214 transition count 443
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 161 place count 208 transition count 437
Iterating global reduction 6 with 6 rules applied. Total rules applied 167 place count 208 transition count 437
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 170 place count 208 transition count 434
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 171 place count 207 transition count 433
Iterating global reduction 7 with 1 rules applied. Total rules applied 172 place count 207 transition count 433
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 173 place count 206 transition count 432
Iterating global reduction 7 with 1 rules applied. Total rules applied 174 place count 206 transition count 432
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 204 place count 191 transition count 417
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 209 place count 191 transition count 412
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 214 place count 186 transition count 412
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 218 place count 186 transition count 412
Applied a total of 218 rules in 59 ms. Remains 186 /294 variables (removed 108) and now considering 412/518 (removed 106) transitions.
// Phase 1: matrix 412 rows 186 cols
[2024-05-31 18:10:40] [INFO ] Computed 25 invariants in 4 ms
[2024-05-31 18:10:40] [INFO ] Implicit Places using invariants in 190 ms returned [75, 97, 103, 106, 108, 115, 185]
[2024-05-31 18:10:40] [INFO ] Actually due to overlaps returned [97, 103, 108, 75, 115, 185]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 192 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 180/324 places, 412/518 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 175 transition count 407
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 175 transition count 407
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 0 with 4 rules applied. Total rules applied 14 place count 173 transition count 405
Free-agglomeration rule applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 173 transition count 401
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 169 transition count 401
Applied a total of 22 rules in 21 ms. Remains 169 /180 variables (removed 11) and now considering 401/412 (removed 11) transitions.
// Phase 1: matrix 401 rows 169 cols
[2024-05-31 18:10:40] [INFO ] Computed 19 invariants in 6 ms
[2024-05-31 18:10:40] [INFO ] Implicit Places using invariants in 243 ms returned []
[2024-05-31 18:10:40] [INFO ] Invariant cache hit.
[2024-05-31 18:10:41] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 169/324 places, 401/518 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1785 ms. Remains : 169/324 places, 401/518 transitions.
RANDOM walk for 40000 steps (1112 resets) in 112 ms. (353 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (546 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (510 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 107597 steps, run visited all 2 properties in 686 ms. (steps per millisecond=156 )
Probabilistic random walk after 107597 steps, saw 45496 distinct states, run finished after 691 ms. (steps per millisecond=155 ) properties seen :2
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ASLink-PT-01a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 32645 ms.
ITS solved all properties within timeout

BK_STOP 1717179041973

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

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="ASLink-PT-01a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-01a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117600014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;