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.r627-smll-171774445400006.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 ResIsolation-PT-N08P1, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r627-smll-171774445400006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.5M
-rw-r--r-- 1 mcc users 5.5K Jun 7 06:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Jun 7 06:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 7 06:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Jun 7 06:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 7 06:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 7 06:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 7 06:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 7 06:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 7 06:26 NewModel
-rw-r--r-- 1 mcc users 8.8K Jun 7 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Jun 7 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 7 06:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Jun 7 06:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 7 06:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 7 06:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 equiv_col
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 instance
-rw-r--r-- 1 mcc users 6 Jun 7 06:26 iscolored
-rw-r--r-- 1 mcc users 4.1M Jun 7 06:26 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 ResIsolation-PT-N08P1-ReachabilityCardinality-2024-00
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-01
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-02
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-03
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-04
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-05
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-06
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-07
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-08
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-09
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-10
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-11
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-12
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-13
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-14
FORMULA_NAME ResIsolation-PT-N08P1-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717751125176

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ResIsolation-PT-N08P1
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-07 09:05:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-07 09:05:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-07 09:05:27] [INFO ] Load time of PNML (sax parser for PT used): 787 ms
[2024-06-07 09:05:27] [INFO ] Transformed 270 places.
[2024-06-07 09:05:28] [INFO ] Transformed 4850 transitions.
[2024-06-07 09:05:28] [INFO ] Found NUPN structural information;
[2024-06-07 09:05:28] [INFO ] Parsed PT model containing 270 places and 4850 transitions and 83436 arcs in 1003 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 6357 ms. (6 steps per ms) remains 12/13 properties
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 714 ms. (55 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 548 ms. (72 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (8 resets) in 733 ms. (54 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 442 ms. (90 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 475 ms. (84 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 616 ms. (64 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 371 ms. (107 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 11/12 properties
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 422 ms. (94 steps per ms) remains 10/11 properties
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 1063 ms. (37 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 517 ms. (77 steps per ms) remains 10/10 properties
// Phase 1: matrix 4850 rows 270 cols
[2024-06-07 09:05:32] [INFO ] Computed 9 invariants in 159 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 192/270 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 192/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4850/5120 variables, 270/549 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5120/5120 variables, and 549 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5091 ms.
Refiners :[Domain max(s): 270/270 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 10/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 192/270 variables, 9/87 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 192/279 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-07 09:05:45] [INFO ] Deduced a trap composed of 36 places in 5869 ms of which 57 ms to minimize.
SMT process timed out in 12642ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 78 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 4850/4850 transitions.
Graph (trivial) has 131 edges and 270 vertex of which 15 / 270 are part of one of the 5 SCC in 7 ms
Free SCC test removed 10 places
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 2557 edges and 260 vertex of which 244 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.103 ms
Discarding 16 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 16 rules applied. Total rules applied 18 place count 244 transition count 4810
Reduce places removed 12 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 232 transition count 4804
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 42 place count 226 transition count 4804
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 42 place count 226 transition count 4798
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 54 place count 220 transition count 4798
Discarding 88 places :
Symmetric choice reduction at 3 with 88 rule applications. Total rules 142 place count 132 transition count 4710
Iterating global reduction 3 with 88 rules applied. Total rules applied 230 place count 132 transition count 4710
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 250 place count 122 transition count 4700
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 122 transition count 4698
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 254 place count 122 transition count 4696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 256 place count 120 transition count 4696
Applied a total of 256 rules in 10677 ms. Remains 120 /270 variables (removed 150) and now considering 4696/4850 (removed 154) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10698 ms. Remains : 120/270 places, 4696/4850 transitions.
RANDOM walk for 40000 steps (8 resets) in 1701 ms. (23 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 317 ms. (125 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 473 ms. (84 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 570 ms. (70 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (8 resets) in 345 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 381 ms. (104 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3016 ms. (13 steps per ms) remains 8/10 properties
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 4696 rows 120 cols
[2024-06-07 09:05:58] [INFO ] Computed 6 invariants in 62 ms
[2024-06-07 09:06:04] [INFO ] State equation strengthened by 4326 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 27/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4696/4798 variables, 102/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4798 variables, 4326/4434 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4798 variables, 0/4434 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 18/4816 variables, 18/4452 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4816 variables, 0/4452 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/4816 variables, 0/4452 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4816/4816 variables, and 4452 constraints, problems are : Problem set: 0 solved, 8 unsolved in 28188 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 120/120 constraints, ReadFeed: 4326/4326 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 27/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-07 09:06:35] [INFO ] Deduced a trap composed of 10 places in 2192 ms of which 2 ms to minimize.
[2024-06-07 09:06:37] [INFO ] Deduced a trap composed of 19 places in 2103 ms of which 3 ms to minimize.
[2024-06-07 09:06:39] [INFO ] Deduced a trap composed of 12 places in 1940 ms of which 2 ms to minimize.
[2024-06-07 09:06:41] [INFO ] Deduced a trap composed of 9 places in 2217 ms of which 3 ms to minimize.
[2024-06-07 09:06:43] [INFO ] Deduced a trap composed of 24 places in 1913 ms of which 3 ms to minimize.
[2024-06-07 09:06:45] [INFO ] Deduced a trap composed of 15 places in 1892 ms of which 2 ms to minimize.
[2024-06-07 09:06:46] [INFO ] Deduced a trap composed of 17 places in 1571 ms of which 1 ms to minimize.
[2024-06-07 09:06:48] [INFO ] Deduced a trap composed of 19 places in 1250 ms of which 3 ms to minimize.
[2024-06-07 09:06:49] [INFO ] Deduced a trap composed of 18 places in 1163 ms of which 2 ms to minimize.
[2024-06-07 09:06:50] [INFO ] Deduced a trap composed of 11 places in 1478 ms of which 2 ms to minimize.
[2024-06-07 09:06:52] [INFO ] Deduced a trap composed of 12 places in 1371 ms of which 1 ms to minimize.
[2024-06-07 09:06:53] [INFO ] Deduced a trap composed of 12 places in 1495 ms of which 5 ms to minimize.
[2024-06-07 09:06:55] [INFO ] Deduced a trap composed of 18 places in 1478 ms of which 2 ms to minimize.
[2024-06-07 09:06:56] [INFO ] Deduced a trap composed of 10 places in 1871 ms of which 2 ms to minimize.
[2024-06-07 09:06:58] [INFO ] Deduced a trap composed of 9 places in 1445 ms of which 3 ms to minimize.
[2024-06-07 09:06:59] [INFO ] Deduced a trap composed of 12 places in 1309 ms of which 1 ms to minimize.
[2024-06-07 09:07:01] [INFO ] Deduced a trap composed of 15 places in 1367 ms of which 1 ms to minimize.
[2024-06-07 09:07:02] [INFO ] Deduced a trap composed of 12 places in 1235 ms of which 1 ms to minimize.
[2024-06-07 09:07:03] [INFO ] Deduced a trap composed of 13 places in 915 ms of which 2 ms to minimize.
[2024-06-07 09:07:05] [INFO ] Deduced a trap composed of 16 places in 2301 ms of which 2 ms to minimize.
Problem ResIsolation-PT-N08P1-ReachabilityCardinality-2024-01 is UNSAT
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 20/26 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-07 09:07:07] [INFO ] Deduced a trap composed of 9 places in 1824 ms of which 2 ms to minimize.
[2024-06-07 09:07:09] [INFO ] Deduced a trap composed of 15 places in 1530 ms of which 2 ms to minimize.
[2024-06-07 09:07:10] [INFO ] Deduced a trap composed of 12 places in 1591 ms of which 1 ms to minimize.
[2024-06-07 09:07:12] [INFO ] Deduced a trap composed of 14 places in 1901 ms of which 2 ms to minimize.
[2024-06-07 09:07:14] [INFO ] Deduced a trap composed of 16 places in 1581 ms of which 1 ms to minimize.
[2024-06-07 09:07:15] [INFO ] Deduced a trap composed of 13 places in 1244 ms of which 1 ms to minimize.
[2024-06-07 09:07:16] [INFO ] Deduced a trap composed of 12 places in 1376 ms of which 2 ms to minimize.
[2024-06-07 09:07:18] [INFO ] Deduced a trap composed of 12 places in 1609 ms of which 1 ms to minimize.
SMT process timed out in 79686ms, After SMT, problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 48 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 4696/4696 transitions.
Graph (trivial) has 31 edges and 120 vertex of which 5 / 120 are part of one of the 2 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1256 edges and 117 vertex of which 115 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
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 0 with 2 rules applied. Total rules applied 4 place count 115 transition count 4687
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 113 transition count 4686
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 112 transition count 4686
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 112 transition count 4684
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 110 transition count 4684
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 24 place count 98 transition count 4672
Iterating global reduction 3 with 12 rules applied. Total rules applied 36 place count 98 transition count 4672
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 40 place count 98 transition count 4668
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 56 place count 90 transition count 4660
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 60 place count 90 transition count 4656
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 89 transition count 4656
Drop transitions (Redundant composition of simpler transitions.) removed 100 transitions
Redundant transition composition rules discarded 100 transitions
Iterating global reduction 5 with 100 rules applied. Total rules applied 162 place count 89 transition count 4556
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 89 transition count 4553
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 168 place count 86 transition count 4553
Applied a total of 168 rules in 10447 ms. Remains 86 /120 variables (removed 34) and now considering 4553/4696 (removed 143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10447 ms. Remains : 86/120 places, 4553/4696 transitions.
RANDOM walk for 40000 steps (14 resets) in 1091 ms. (36 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 1145 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (14 resets) in 1042 ms. (38 steps per ms) remains 2/7 properties
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (8 resets) in 1331 ms. (30 steps per ms) remains 2/2 properties
// Phase 1: matrix 4553 rows 86 cols
[2024-06-07 09:07:30] [INFO ] Computed 6 invariants in 25 ms
[2024-06-07 09:07:36] [INFO ] State equation strengthened by 4432 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4544/4608 variables, 64/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4608 variables, 1214/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4608 variables, 0/1284 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 27/4635 variables, 20/1304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4635 variables, 3218/4522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4635 variables, 0/4522 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/4639 variables, 2/4524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4639 variables, 0/4524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/4639 variables, 0/4524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4639/4639 variables, and 4524 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26879 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 86/86 constraints, ReadFeed: 4432/4432 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 39/64 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:08:05] [INFO ] Deduced a trap composed of 11 places in 1871 ms of which 1 ms to minimize.
[2024-06-07 09:08:07] [INFO ] Deduced a trap composed of 11 places in 1943 ms of which 2 ms to minimize.
[2024-06-07 09:08:09] [INFO ] Deduced a trap composed of 9 places in 1876 ms of which 1 ms to minimize.
[2024-06-07 09:08:11] [INFO ] Deduced a trap composed of 15 places in 1813 ms of which 2 ms to minimize.
[2024-06-07 09:08:12] [INFO ] Deduced a trap composed of 10 places in 1489 ms of which 1 ms to minimize.
[2024-06-07 09:08:14] [INFO ] Deduced a trap composed of 13 places in 1533 ms of which 1 ms to minimize.
[2024-06-07 09:08:15] [INFO ] Deduced a trap composed of 8 places in 1408 ms of which 2 ms to minimize.
[2024-06-07 09:08:17] [INFO ] Deduced a trap composed of 7 places in 1501 ms of which 2 ms to minimize.
[2024-06-07 09:08:18] [INFO ] Deduced a trap composed of 9 places in 1393 ms of which 1 ms to minimize.
[2024-06-07 09:08:19] [INFO ] Deduced a trap composed of 10 places in 1285 ms of which 1 ms to minimize.
[2024-06-07 09:08:21] [INFO ] Deduced a trap composed of 14 places in 1659 ms of which 2 ms to minimize.
[2024-06-07 09:08:22] [INFO ] Deduced a trap composed of 11 places in 1455 ms of which 2 ms to minimize.
[2024-06-07 09:08:24] [INFO ] Deduced a trap composed of 7 places in 1143 ms of which 1 ms to minimize.
[2024-06-07 09:08:25] [INFO ] Deduced a trap composed of 9 places in 1277 ms of which 2 ms to minimize.
[2024-06-07 09:08:26] [INFO ] Deduced a trap composed of 9 places in 1332 ms of which 1 ms to minimize.
[2024-06-07 09:08:27] [INFO ] Deduced a trap composed of 10 places in 1191 ms of which 2 ms to minimize.
[2024-06-07 09:08:28] [INFO ] Deduced a trap composed of 11 places in 1045 ms of which 1 ms to minimize.
[2024-06-07 09:08:30] [INFO ] Deduced a trap composed of 10 places in 1156 ms of which 1 ms to minimize.
[2024-06-07 09:08:31] [INFO ] Deduced a trap composed of 6 places in 1566 ms of which 1 ms to minimize.
[2024-06-07 09:08:33] [INFO ] Deduced a trap composed of 11 places in 1615 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:08:34] [INFO ] Deduced a trap composed of 10 places in 1592 ms of which 1 ms to minimize.
[2024-06-07 09:08:36] [INFO ] Deduced a trap composed of 10 places in 1462 ms of which 2 ms to minimize.
[2024-06-07 09:08:37] [INFO ] Deduced a trap composed of 8 places in 1094 ms of which 2 ms to minimize.
[2024-06-07 09:08:38] [INFO ] Deduced a trap composed of 7 places in 1093 ms of which 0 ms to minimize.
[2024-06-07 09:08:39] [INFO ] Deduced a trap composed of 11 places in 1400 ms of which 1 ms to minimize.
[2024-06-07 09:08:41] [INFO ] Deduced a trap composed of 7 places in 1253 ms of which 1 ms to minimize.
[2024-06-07 09:08:42] [INFO ] Deduced a trap composed of 10 places in 1226 ms of which 1 ms to minimize.
[2024-06-07 09:08:43] [INFO ] Deduced a trap composed of 12 places in 1243 ms of which 3 ms to minimize.
[2024-06-07 09:08:44] [INFO ] Deduced a trap composed of 14 places in 1290 ms of which 1 ms to minimize.
[2024-06-07 09:08:46] [INFO ] Deduced a trap composed of 11 places in 1080 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4544/4608 variables, 64/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4608 variables, 1214/1314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:08:52] [INFO ] Deduced a trap composed of 9 places in 1459 ms of which 1 ms to minimize.
[2024-06-07 09:08:54] [INFO ] Deduced a trap composed of 11 places in 1125 ms of which 2 ms to minimize.
[2024-06-07 09:08:55] [INFO ] Deduced a trap composed of 8 places in 1335 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/4608 variables, 3/1317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4608 variables, 0/1317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 27/4635 variables, 20/1337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4635 variables, 3218/4555 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-07 09:09:16] [INFO ] Deduced a trap composed of 12 places in 2134 ms of which 2 ms to minimize.
[2024-06-07 09:09:18] [INFO ] Deduced a trap composed of 10 places in 1957 ms of which 1 ms to minimize.
SMT process timed out in 108285ms, After SMT, problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 272 ms.
Support contains 25 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 4553/4553 transitions.
Graph (trivial) has 19 edges and 86 vertex of which 2 / 86 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1002 edges and 85 vertex of which 81 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.14 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
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 0 with 1 rules applied. Total rules applied 3 place count 81 transition count 4546
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 80 transition count 4546
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 80 transition count 4545
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 79 transition count 4545
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 14 place count 71 transition count 4537
Iterating global reduction 2 with 8 rules applied. Total rules applied 22 place count 71 transition count 4537
Performed 7 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 64 transition count 4521
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Iterating post reduction 2 with 53 rules applied. Total rules applied 89 place count 64 transition count 4468
Drop transitions (Redundant composition of simpler transitions.) removed 169 transitions
Redundant transition composition rules discarded 169 transitions
Iterating global reduction 3 with 169 rules applied. Total rules applied 258 place count 64 transition count 4299
Applied a total of 258 rules in 9641 ms. Remains 64 /86 variables (removed 22) and now considering 4299/4553 (removed 254) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9641 ms. Remains : 64/86 places, 4299/4553 transitions.
RANDOM walk for 40000 steps (82 resets) in 15732 ms. (2 steps per ms) remains 1/2 properties
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (43 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
// Phase 1: matrix 4299 rows 64 cols
[2024-06-07 09:09:32] [INFO ] Computed 6 invariants in 24 ms
[2024-06-07 09:09:39] [INFO ] State equation strengthened by 4242 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4279/4328 variables, 49/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4328 variables, 804/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4328 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 33/4361 variables, 14/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4361 variables, 3438/4311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4361 variables, 0/4311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/4363 variables, 1/4312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/4363 variables, 0/4312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/4363 variables, 0/4312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4363/4363 variables, and 4312 constraints, problems are : Problem set: 0 solved, 1 unsolved in 30839 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 64/64 constraints, ReadFeed: 4242/4242 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/49 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:10:11] [INFO ] Deduced a trap composed of 9 places in 1432 ms of which 2 ms to minimize.
[2024-06-07 09:10:13] [INFO ] Deduced a trap composed of 9 places in 1301 ms of which 2 ms to minimize.
[2024-06-07 09:10:14] [INFO ] Deduced a trap composed of 9 places in 1174 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4279/4328 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4328 variables, 804/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4328 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/4361 variables, 14/876 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4361 variables, 3438/4314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-07 09:10:45] [INFO ] Deduced a trap composed of 9 places in 2023 ms of which 1 ms to minimize.
[2024-06-07 09:10:47] [INFO ] Deduced a trap composed of 9 places in 1808 ms of which 1 ms to minimize.
[2024-06-07 09:10:49] [INFO ] Deduced a trap composed of 11 places in 1703 ms of which 1 ms to minimize.
[2024-06-07 09:10:51] [INFO ] Deduced a trap composed of 7 places in 1510 ms of which 2 ms to minimize.
[2024-06-07 09:10:53] [INFO ] Deduced a trap composed of 10 places in 1711 ms of which 2 ms to minimize.
[2024-06-07 09:10:55] [INFO ] Deduced a trap composed of 11 places in 1534 ms of which 1 ms to minimize.
[2024-06-07 09:10:56] [INFO ] Deduced a trap composed of 10 places in 1257 ms of which 1 ms to minimize.
Problem ResIsolation-PT-N08P1-ReachabilityCardinality-2024-14 is UNSAT
FORMULA ResIsolation-PT-N08P1-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 4361/4363 variables, and 4321 constraints, problems are : Problem set: 1 solved, 0 unsolved in 46265 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 63/64 constraints, ReadFeed: 4242/4242 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 10/10 constraints]
After SMT, in 83995ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 329616 ms.
ITS solved all properties within timeout

BK_STOP 1717751456716

--------------------
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="ResIsolation-PT-N08P1"
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 ResIsolation-PT-N08P1, 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 r627-smll-171774445400006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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