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.r399-tall-171690529700150.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 greatspnxred
Input is StigmergyCommit-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529700150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.4M May 18 16:43 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 StigmergyCommit-PT-05b-ReachabilityCardinality-2024-00
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-01
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-02
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-03
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-04
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-05
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-06
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-07
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-08
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-09
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-10
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-11
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-12
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-13
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-14
FORMULA_NAME StigmergyCommit-PT-05b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716989512121

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:31:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 13:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:31:53] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2024-05-29 13:31:53] [INFO ] Transformed 1837 places.
[2024-05-29 13:31:53] [INFO ] Transformed 3460 transitions.
[2024-05-29 13:31:53] [INFO ] Found NUPN structural information;
[2024-05-29 13:31:53] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (353 resets) in 2007 ms. (19 steps per ms) remains 7/14 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (57 resets) in 283 ms. (140 steps per ms) remains 6/7 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (57 resets) in 116 ms. (341 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 355 ms. (112 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (57 resets) in 548 ms. (72 steps per ms) remains 5/6 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (58 resets) in 289 ms. (137 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 92 ms. (430 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (56 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
// Phase 1: matrix 3460 rows 1837 cols
[2024-05-29 13:31:55] [INFO ] Computed 7 invariants in 62 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1735/1818 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1818 variables, 1735/1824 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1818 variables, 0/1824 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 19/1837 variables, 1/1825 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1837 variables, 19/1844 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 13:31:57] [INFO ] Deduced a trap composed of 396 places in 1335 ms of which 87 ms to minimize.
[2024-05-29 13:31:58] [INFO ] Deduced a trap composed of 396 places in 1106 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1837 variables, 2/1846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1837 variables, 0/1846 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3460/5297 variables, 1837/3683 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5297/5297 variables, and 3683 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5057 ms.
Refiners :[Domain max(s): 1837/1837 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1837/1837 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 83/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/83 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 1735/1818 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1818 variables, 1735/1824 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1818 variables, 2/1826 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 13:32:01] [INFO ] Deduced a trap composed of 396 places in 1087 ms of which 10 ms to minimize.
[2024-05-29 13:32:02] [INFO ] Deduced a trap composed of 490 places in 1061 ms of which 10 ms to minimize.
[2024-05-29 13:32:03] [INFO ] Deduced a trap composed of 399 places in 953 ms of which 8 ms to minimize.
[2024-05-29 13:32:04] [INFO ] Deduced a trap composed of 397 places in 787 ms of which 7 ms to minimize.
[2024-05-29 13:32:05] [INFO ] Deduced a trap composed of 399 places in 767 ms of which 7 ms to minimize.
SMT process timed out in 10506ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 1837 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Graph (trivial) has 1656 edges and 1837 vertex of which 84 / 1837 are part of one of the 14 SCC in 7 ms
Free SCC test removed 70 places
Drop transitions (Empty/Sink Transition effects.) removed 90 transitions
Reduce isomorphic transitions removed 90 transitions.
Graph (complete) has 2769 edges and 1767 vertex of which 1755 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.22 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1219 transitions
Trivial Post-agglo rules discarded 1219 transitions
Performed 1219 trivial Post agglomeration. Transition count delta: 1219
Iterating post reduction 0 with 1224 rules applied. Total rules applied 1226 place count 1755 transition count 2140
Reduce places removed 1219 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1249 rules applied. Total rules applied 2475 place count 536 transition count 2110
Reduce places removed 11 places and 0 transitions.
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Iterating post reduction 2 with 65 rules applied. Total rules applied 2540 place count 525 transition count 2056
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 3 with 54 rules applied. Total rules applied 2594 place count 471 transition count 2056
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 77 Pre rules applied. Total rules applied 2594 place count 471 transition count 1979
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 2748 place count 394 transition count 1979
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 2808 place count 334 transition count 1919
Iterating global reduction 4 with 60 rules applied. Total rules applied 2868 place count 334 transition count 1919
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2869 place count 334 transition count 1918
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2869 place count 334 transition count 1917
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2871 place count 333 transition count 1917
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 2892 place count 312 transition count 598
Iterating global reduction 5 with 21 rules applied. Total rules applied 2913 place count 312 transition count 598
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2918 place count 312 transition count 593
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 2921 place count 309 transition count 590
Iterating global reduction 6 with 3 rules applied. Total rules applied 2924 place count 309 transition count 590
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2925 place count 308 transition count 589
Iterating global reduction 6 with 1 rules applied. Total rules applied 2926 place count 308 transition count 589
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 2982 place count 280 transition count 561
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2987 place count 275 transition count 556
Iterating global reduction 6 with 5 rules applied. Total rules applied 2992 place count 275 transition count 556
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 2997 place count 270 transition count 551
Iterating global reduction 6 with 5 rules applied. Total rules applied 3002 place count 270 transition count 551
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 3006 place count 266 transition count 547
Iterating global reduction 6 with 4 rules applied. Total rules applied 3010 place count 266 transition count 547
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 3026 place count 258 transition count 570
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 3029 place count 258 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 3033 place count 258 transition count 563
Free-agglomeration rule applied 49 times.
Iterating global reduction 7 with 49 rules applied. Total rules applied 3082 place count 258 transition count 514
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 7 with 49 rules applied. Total rules applied 3131 place count 209 transition count 514
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 3135 place count 205 transition count 510
Iterating global reduction 8 with 4 rules applied. Total rules applied 3139 place count 205 transition count 510
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 8 with 63 rules applied. Total rules applied 3202 place count 205 transition count 447
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 3207 place count 205 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 3209 place count 205 transition count 445
Applied a total of 3209 rules in 519 ms. Remains 205 /1837 variables (removed 1632) and now considering 445/3460 (removed 3015) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 531 ms. Remains : 205/1837 places, 445/3460 transitions.
RANDOM walk for 40000 steps (953 resets) in 636 ms. (62 steps per ms) remains 3/5 properties
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (142 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (141 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (137 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
// Phase 1: matrix 445 rows 205 cols
[2024-05-29 13:32:06] [INFO ] Computed 6 invariants in 4 ms
[2024-05-29 13:32:06] [INFO ] State equation strengthened by 178 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/173 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 421/594 variables, 173/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/594 variables, 116/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 45/639 variables, 23/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 60/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 11/650 variables, 9/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/650 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/650 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/650 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/650 variables, and 389 constraints, problems are : Problem set: 0 solved, 3 unsolved in 437 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 205/205 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/172 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 13:32:07] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
[2024-05-29 13:32:07] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:32:07] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 1 ms to minimize.
Problem StigmergyCommit-PT-05b-ReachabilityCardinality-2024-05 is UNSAT
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
[2024-05-29 13:32:07] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 4/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/173 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 421/594 variables, 173/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/594 variables, 116/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/594 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 45/639 variables, 23/322 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 60/382 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 2/384 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/650 variables, 9/393 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/650 variables, 2/395 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/650 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/650 variables, 0/395 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 650/650 variables, and 395 constraints, problems are : Problem set: 1 solved, 2 unsolved in 900 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 205/205 constraints, ReadFeed: 178/178 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 1377ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 50 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 445/445 transitions.
Graph (trivial) has 72 edges and 205 vertex of which 8 / 205 are part of one of the 3 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 200 transition count 409
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 32 rules applied. Total rules applied 57 place count 176 transition count 401
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 67 place count 169 transition count 398
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 67 place count 169 transition count 394
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 75 place count 165 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 163 transition count 392
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 163 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 80 place count 163 transition count 391
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 162 transition count 390
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 162 transition count 390
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 96 place count 155 transition count 383
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 153 transition count 381
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 153 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 109 place count 153 transition count 372
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 115 place count 153 transition count 366
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 121 place count 147 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 123 place count 147 transition count 364
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 147 transition count 364
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 125 place count 147 transition count 363
Applied a total of 125 rules in 84 ms. Remains 147 /205 variables (removed 58) and now considering 363/445 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 147/205 places, 363/445 transitions.
RANDOM walk for 40000 steps (1106 resets) in 144 ms. (275 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (170 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (169 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1762349 steps, run timeout after 3001 ms. (steps per millisecond=587 ) properties seen :1 out of 2
Probabilistic random walk after 1762349 steps, saw 295110 distinct states, run finished after 3004 ms. (steps per millisecond=586 ) properties seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 363 rows 147 cols
[2024-05-29 13:32:11] [INFO ] Computed 6 invariants in 5 ms
[2024-05-29 13:32:11] [INFO ] State equation strengthened by 189 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1/119 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 337/456 variables, 119/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 127/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 28/484 variables, 13/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/484 variables, 57/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 20/504 variables, 11/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/504 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/504 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 6/510 variables, 4/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/510 variables, 2/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/510 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 510/510 variables, and 342 constraints, problems are : Problem set: 0 solved, 1 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/118 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:32:11] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:32:11] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:32:11] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/119 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 337/456 variables, 119/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 127/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 28/484 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 57/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/484 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 20/504 variables, 11/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/504 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/504 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/510 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/510 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/510 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/510 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 510/510 variables, and 346 constraints, problems are : Problem set: 0 solved, 1 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 147/147 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 843ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 29 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 363/363 transitions.
Graph (trivial) has 49 edges and 147 vertex of which 6 / 147 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 144 transition count 344
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 131 transition count 343
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 28 place count 131 transition count 337
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 125 transition count 337
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 119 transition count 331
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 119 transition count 331
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 62 place count 119 transition count 321
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 65 place count 116 transition count 318
Iterating global reduction 3 with 3 rules applied. Total rules applied 68 place count 116 transition count 318
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 115 transition count 317
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 115 transition count 317
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 114 transition count 316
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 114 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 114 transition count 315
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 83 place count 109 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 84 place count 109 transition count 309
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 89 place count 104 transition count 304
Iterating global reduction 5 with 5 rules applied. Total rules applied 94 place count 104 transition count 304
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 97 place count 101 transition count 301
Iterating global reduction 5 with 3 rules applied. Total rules applied 100 place count 101 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 101 place count 101 transition count 300
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 103 place count 99 transition count 298
Iterating global reduction 6 with 2 rules applied. Total rules applied 105 place count 99 transition count 298
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 111 place count 99 transition count 292
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 119 place count 99 transition count 284
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 128 place count 91 transition count 283
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 130 place count 91 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 131 place count 91 transition count 282
Applied a total of 131 rules in 64 ms. Remains 91 /147 variables (removed 56) and now considering 282/363 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 91/147 places, 282/363 transitions.
RANDOM walk for 40000 steps (1316 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (218 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 431466 steps, run visited all 1 properties in 527 ms. (steps per millisecond=818 )
Probabilistic random walk after 431466 steps, saw 68922 distinct states, run finished after 533 ms. (steps per millisecond=809 ) properties seen :1
FORMULA StigmergyCommit-PT-05b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 19398 ms.
ITS solved all properties within timeout

BK_STOP 1716989532788

--------------------
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="StigmergyCommit-PT-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is StigmergyCommit-PT-05b, 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 r399-tall-171690529700150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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