Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654446100510.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-PT-S10J60, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654446100510
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 24M
-rw-r--r-- 1 mcc users 36K Apr 12 11:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 196K Apr 12 11:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Apr 12 11:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.2M Apr 12 11:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 180K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 160K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 714K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 401K Apr 12 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.6M Apr 12 13:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.5K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M 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 PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-00
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-01
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-02
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-03
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-04
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-05
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-06
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-07
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-08
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-09
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-10
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-11
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-12
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-13
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-14
FORMULA_NAME PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716892824945

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:40:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 10:40:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:40:28] [INFO ] Load time of PNML (sax parser for PT used): 1294 ms
[2024-05-28 10:40:29] [INFO ] Transformed 1234 places.
[2024-05-28 10:40:29] [INFO ] Transformed 12920 transitions.
[2024-05-28 10:40:29] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 1747 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
RANDOM walk for 40000 steps (2239 resets) in 3395 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 239 ms. (16 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 174 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (48 resets) in 88 ms. (44 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 423 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (40 resets) in 173 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 109 ms. (36 steps per ms) remains 15/16 properties
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4004 steps (10 resets) in 249 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (39 resets) in 219 ms. (18 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 46 ms. (85 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 47 ms. (83 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (39 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 59 ms. (66 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (40 resets) in 64 ms. (61 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (39 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 49950 steps, run timeout after 3001 ms. (steps per millisecond=16 ) properties seen :0 out of 15
Probabilistic random walk after 49950 steps, saw 15718 distinct states, run finished after 3023 ms. (steps per millisecond=16 ) properties seen :0
[2024-05-28 10:40:34] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-28 10:40:34] [INFO ] Computed 152 invariants in 170 ms
[2024-05-28 10:40:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-00 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-01 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-02 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-03 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-03 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-07 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-09 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-10 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-11 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-14 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-15 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1234 variables, 121/121 constraints. Problems are: Problem set: 10 solved, 5 unsolved
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-04 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-06 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-13 is UNSAT
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/1234 variables, 31/152 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1234 variables, 0/152 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2801/4035 variables, 1234/1386 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4035 variables, 1/1387 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4035 variables, 0/1387 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/4035 variables, 0/1387 constraints. Problems are: Problem set: 13 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4035/4035 variables, and 1387 constraints, problems are : Problem set: 13 solved, 2 unsolved in 3083 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 1234/1234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 530/598 variables, 48/48 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/598 variables, 0/48 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 316/914 variables, 48/96 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/914 variables, 0/96 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 210/1124 variables, 21/117 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1124 variables, 0/117 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 105/1229 variables, 31/148 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1229 variables, 0/148 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/1233 variables, 4/152 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1233 variables, 0/152 constraints. Problems are: Problem set: 13 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2801/4034 variables, 1233/1385 constraints. Problems are: Problem set: 13 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4034/4035 variables, and 1386 constraints, problems are : Problem set: 13 solved, 2 unsolved in 4067 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 1233/1234 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 8764ms problems are : Problem set: 13 solved, 2 unsolved
Parikh walk visited 0 properties in 290 ms.
Support contains 68 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 1225 transition count 2755
Reduce places removed 55 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 123 place count 1170 transition count 2751
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 127 place count 1166 transition count 2751
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 127 place count 1166 transition count 2694
Deduced a syphon composed of 57 places in 3 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 241 place count 1109 transition count 2694
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 242 place count 1108 transition count 2693
Iterating global reduction 3 with 1 rules applied. Total rules applied 243 place count 1108 transition count 2693
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 247 place count 1106 transition count 2691
Applied a total of 247 rules in 728 ms. Remains 1106 /1234 variables (removed 128) and now considering 2691/2810 (removed 119) transitions.
Running 2680 sub problems to find dead transitions.
[2024-05-28 10:40:44] [INFO ] Flow matrix only has 2682 transitions (discarded 9 similar events)
// Phase 1: matrix 2682 rows 1106 cols
[2024-05-28 10:40:44] [INFO ] Computed 143 invariants in 114 ms
[2024-05-28 10:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1095 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 2680 unsolved
SMT process timed out in 42999ms, After SMT, problems are : Problem set: 0 solved, 2680 unsolved
Search for dead transitions found 0 dead transitions in 43038ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43796 ms. Remains : 1106/1234 places, 2691/2810 transitions.
RANDOM walk for 40000 steps (2958 resets) in 1793 ms. (22 steps per ms) remains 1/2 properties
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (360 resets) in 264 ms. (150 steps per ms) remains 1/1 properties
[2024-05-28 10:41:27] [INFO ] Flow matrix only has 2682 transitions (discarded 9 similar events)
[2024-05-28 10:41:27] [INFO ] Invariant cache hit.
[2024-05-28 10:41:27] [INFO ] State equation strengthened by 1 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 276/295 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/558 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 440/998 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/998 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/1100 variables, 23/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1100 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1105 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1105 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2682/3787 variables, 1105/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3787 variables, 1/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3787 variables, 0/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3788 variables, 1/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3788 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3788 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3788/3788 variables, and 1250 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2434 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 1106/1106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 276/295 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/295 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 263/558 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/558 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 440/998 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/998 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 102/1100 variables, 23/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1100 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1105 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1105 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2682/3787 variables, 1105/1248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3787 variables, 1/1249 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3787 variables, 1/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3787 variables, 0/1250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/3788 variables, 1/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3788 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3788 variables, 0/1251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3788/3788 variables, and 1251 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4177 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 1106/1106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6650ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 14 ms.
All properties solved without resorting to model-checking.
Total runtime 67149 ms.
ITS solved all properties within timeout

BK_STOP 1716892894698

--------------------
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="PolyORBNT-PT-S10J60"
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 PolyORBNT-PT-S10J60, 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 r289-tajo-171654446100510"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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