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.r245-tall-171654350200582.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 NoC3x3-PT-2B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350200582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 06:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 12 06:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Apr 12 06:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 548K 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 NoC3x3-PT-2B-ReachabilityCardinality-2024-00
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-01
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-02
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-03
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-04
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-05
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-06
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-07
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-08
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-09
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-10
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-11
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-12
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-13
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-14
FORMULA_NAME NoC3x3-PT-2B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716682898175

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-2B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 00:21:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 00:21:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:21:39] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-26 00:21:39] [INFO ] Transformed 2003 places.
[2024-05-26 00:21:39] [INFO ] Transformed 2292 transitions.
[2024-05-26 00:21:39] [INFO ] Found NUPN structural information;
[2024-05-26 00:21:39] [INFO ] Parsed PT model containing 2003 places and 2292 transitions and 5835 arcs in 287 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (61 resets) in 1656 ms. (24 steps per ms) remains 3/13 properties
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 3/3 properties
// Phase 1: matrix 2292 rows 2003 cols
[2024-05-26 00:21:40] [INFO ] Computed 66 invariants in 35 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 888/908 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/908 variables, 888/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1095/2003 variables, 51/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 1095/2069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2003 variables, 0/2069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2292/4295 variables, 2003/4072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/4295 variables, 0/4072 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4295/4295 variables, and 4072 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2489 ms.
Refiners :[Domain max(s): 2003/2003 constraints, Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 2003/2003 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/20 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 888/908 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/908 variables, 888/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/908 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1095/2003 variables, 51/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2003 variables, 1095/2069 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-26 00:21:45] [INFO ] Deduced a trap composed of 15 places in 1357 ms of which 154 ms to minimize.
[2024-05-26 00:21:46] [INFO ] Deduced a trap composed of 41 places in 1105 ms of which 38 ms to minimize.
[2024-05-26 00:21:47] [INFO ] Deduced a trap composed of 54 places in 875 ms of which 21 ms to minimize.
[2024-05-26 00:21:48] [INFO ] Deduced a trap composed of 49 places in 931 ms of which 14 ms to minimize.
SMT process timed out in 8047ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 20 out of 2003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2003/2003 places, 2292/2292 transitions.
Graph (trivial) has 1601 edges and 2003 vertex of which 72 / 2003 are part of one of the 9 SCC in 7 ms
Free SCC test removed 63 places
Drop transitions (Empty/Sink Transition effects.) removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 395 transitions
Trivial Post-agglo rules discarded 395 transitions
Performed 395 trivial Post agglomeration. Transition count delta: 395
Iterating post reduction 0 with 404 rules applied. Total rules applied 405 place count 1931 transition count 1825
Reduce places removed 395 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 398 rules applied. Total rules applied 803 place count 1536 transition count 1822
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 806 place count 1533 transition count 1822
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 806 place count 1533 transition count 1798
Deduced a syphon composed of 24 places in 5 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 854 place count 1509 transition count 1798
Discarding 343 places :
Symmetric choice reduction at 3 with 343 rule applications. Total rules 1197 place count 1166 transition count 1455
Iterating global reduction 3 with 343 rules applied. Total rules applied 1540 place count 1166 transition count 1455
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 1540 place count 1166 transition count 1415
Deduced a syphon composed of 40 places in 8 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 1620 place count 1126 transition count 1415
Discarding 129 places :
Symmetric choice reduction at 3 with 129 rule applications. Total rules 1749 place count 997 transition count 1249
Iterating global reduction 3 with 129 rules applied. Total rules applied 1878 place count 997 transition count 1249
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 1998 place count 877 transition count 1116
Iterating global reduction 3 with 120 rules applied. Total rules applied 2118 place count 877 transition count 1116
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 2163 place count 832 transition count 1037
Iterating global reduction 3 with 45 rules applied. Total rules applied 2208 place count 832 transition count 1037
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 17 rules applied. Total rules applied 2225 place count 830 transition count 1022
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 2227 place count 828 transition count 1022
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 2259 place count 796 transition count 990
Iterating global reduction 5 with 32 rules applied. Total rules applied 2291 place count 796 transition count 990
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 2 rules applied. Total rules applied 2293 place count 795 transition count 989
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2294 place count 794 transition count 989
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2314 place count 774 transition count 949
Iterating global reduction 7 with 20 rules applied. Total rules applied 2334 place count 774 transition count 949
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 2354 place count 754 transition count 929
Iterating global reduction 7 with 20 rules applied. Total rules applied 2374 place count 754 transition count 929
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 24 rules applied. Total rules applied 2398 place count 752 transition count 907
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2400 place count 750 transition count 907
Performed 297 Post agglomeration using F-continuation condition.Transition count delta: 297
Deduced a syphon composed of 297 places in 0 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 9 with 594 rules applied. Total rules applied 2994 place count 453 transition count 610
Discarding 12 places :
Symmetric choice reduction at 9 with 12 rule applications. Total rules 3006 place count 441 transition count 598
Iterating global reduction 9 with 12 rules applied. Total rules applied 3018 place count 441 transition count 598
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 3024 place count 435 transition count 586
Iterating global reduction 9 with 6 rules applied. Total rules applied 3030 place count 435 transition count 586
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 3032 place count 433 transition count 581
Iterating global reduction 9 with 2 rules applied. Total rules applied 3034 place count 433 transition count 581
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 9 with 36 rules applied. Total rules applied 3070 place count 415 transition count 613
Free-agglomeration rule applied 23 times.
Iterating global reduction 9 with 23 rules applied. Total rules applied 3093 place count 415 transition count 590
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 3122 place count 392 transition count 584
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 3123 place count 392 transition count 583
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 10 with 1 rules applied. Total rules applied 3124 place count 392 transition count 582
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 3125 place count 391 transition count 582
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 3128 place count 391 transition count 582
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 3129 place count 391 transition count 582
Applied a total of 3129 rules in 1525 ms. Remains 391 /2003 variables (removed 1612) and now considering 582/2292 (removed 1710) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1559 ms. Remains : 391/2003 places, 582/2292 transitions.
RANDOM walk for 40000 steps (519 resets) in 1477 ms. (27 steps per ms) remains 2/3 properties
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (31 resets) in 133 ms. (298 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (29 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2024-05-26 00:21:50] [INFO ] Flow matrix only has 580 transitions (discarded 2 similar events)
// Phase 1: matrix 580 rows 391 cols
[2024-05-26 00:21:50] [INFO ] Computed 55 invariants in 24 ms
[2024-05-26 00:21:50] [INFO ] State equation strengthened by 66 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/153 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 194/347 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 571/918 variables, 347/402 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/918 variables, 57/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 53/971 variables, 44/503 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/971 variables, 9/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/971 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 971/971 variables, and 512 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 391/391 constraints, ReadFeed: 66/66 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 134/153 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 194/347 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 1 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-26 00:21:51] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-26 00:21:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-26 00:21:52] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/347 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/347 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 571/918 variables, 347/413 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/918 variables, 57/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/918 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 53/971 variables, 44/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/971 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/971 variables, 2/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/971 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/971 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 971/971 variables, and 525 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1275 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 391/391 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 1616ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 52 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=52 )
FORMULA NoC3x3-PT-2B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 69 ms.
All properties solved without resorting to model-checking.
Total runtime 13196 ms.
ITS solved all properties within timeout

BK_STOP 1716682912615

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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="NoC3x3-PT-2B"
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 NoC3x3-PT-2B, 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 r245-tall-171654350200582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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