fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r290-tajo-171654447300510
Last Updated
July 7, 2024

About the Execution of ITS-Tools for PolyORBNT-PT-S10J60

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8931.535 77055.00 191490.00 65.20 FFTTFFFTFFTTFFFF normal

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.r290-tajo-171654447300510.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 itstools
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 r290-tajo-171654447300510
=====================================================================

--------------------
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 1716934310446

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J60
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-28 22:11:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 22:11:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 22:11:52] [INFO ] Load time of PNML (sax parser for PT used): 620 ms
[2024-05-28 22:11:52] [INFO ] Transformed 1234 places.
[2024-05-28 22:11:52] [INFO ] Transformed 12920 transitions.
[2024-05-28 22:11:52] [INFO ] Parsed PT model containing 1234 places and 12920 transitions and 116879 arcs in 848 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 50 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
[2024-05-28 22:11:54] [INFO ] Flatten gal took : 589 ms
[2024-05-28 22:11:54] [INFO ] Flatten gal took : 342 ms
RANDOM walk for 40000 steps (2238 resets) in 6482 ms. (6 steps per ms) remains 15/16 properties
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 22:11:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7533025514095345269.gal : 151 ms
BEST_FIRST walk for 4003 steps (39 resets) in 215 ms. (18 steps per ms) remains 15/15 properties
[2024-05-28 22:11:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11819857437906220951.prop : 16 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7533025514095345269.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11819857437906220951.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4003 steps (40 resets) in 177 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (48 resets) in 100 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 226 ms. (17 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 154 ms. (25 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 260 ms. (15 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 223 ms. (17 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 4002 steps (40 resets) in 48 ms. (81 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 79 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (38 resets) in 175 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 180 ms. (22 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 61 ms. (64 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 134 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (39 resets) in 54 ms. (72 steps per ms) remains 15/15 properties
Loading property file /tmp/ReachabilityCardinality11819857437906220951.prop.
SDD proceeding with computation,15 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,15 properties remain. new max is 8
SDD size :8 after 32
Interrupted probabilistic random walk after 102443 steps, run timeout after 6001 ms. (steps per millisecond=17 ) properties seen :0 out of 15
Probabilistic random walk after 102443 steps, saw 30711 distinct states, run finished after 6006 ms. (steps per millisecond=17 ) properties seen :0
[2024-05-28 22:12:01] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-28 22:12:01] [INFO ] Computed 152 invariants in 192 ms
[2024-05-28 22:12:02] [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 2430 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 3726 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 7551ms problems are : Problem set: 13 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 333 ms.
Support contains 19 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 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 1224 transition count 2747
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 136 place count 1161 transition count 2747
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 136 place count 1161 transition count 2683
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 264 place count 1097 transition count 2683
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 265 place count 1096 transition count 2682
Iterating global reduction 2 with 1 rules applied. Total rules applied 266 place count 1096 transition count 2682
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 270 place count 1094 transition count 2680
Applied a total of 270 rules in 842 ms. Remains 1094 /1234 variables (removed 140) and now considering 2680/2810 (removed 130) transitions.
Running 2669 sub problems to find dead transitions.
[2024-05-28 22:12:10] [INFO ] Flow matrix only has 2671 transitions (discarded 9 similar events)
// Phase 1: matrix 2671 rows 1094 cols
[2024-05-28 22:12:10] [INFO ] Computed 142 invariants in 69 ms
[2024-05-28 22:12:10] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,15 properties remain. new max is 16
SDD size :32 after 128
At refinement iteration 0 (INCLUDED_ONLY) 0/1084 variables, 120/120 constraints. Problems are: Problem set: 0 solved, 2669 unsolved
SMT process timed out in 44241ms, After SMT, problems are : Problem set: 0 solved, 2669 unsolved
Search for dead transitions found 0 dead transitions in 44284ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45156 ms. Remains : 1094/1234 places, 2680/2810 transitions.
RANDOM walk for 40000 steps (2865 resets) in 2563 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (311 resets) in 349 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 118795 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 1
Probabilistic random walk after 118795 steps, saw 21277 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 22:12:58] [INFO ] Flow matrix only has 2671 transitions (discarded 9 similar events)
[2024-05-28 22:12:58] [INFO ] Invariant cache hit.
[2024-05-28 22:12:58] [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) 274/293 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 255/548 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 440/988 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/988 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 100/1088 variables, 22/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1093 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1093 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2671/3764 variables, 1093/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3764 variables, 1/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3764 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3765 variables, 1/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3765 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3765 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3765/3765 variables, and 1237 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2418 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1094/1094 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) 274/293 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/293 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 255/548 variables, 54/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 440/988 variables, 44/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/988 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 100/1088 variables, 22/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/1093 variables, 5/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1093 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2671/3764 variables, 1093/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3764 variables, 1/1236 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3764 variables, 1/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3764 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/3765 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3765 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3765 variables, 0/1238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3765/3765 variables, and 1238 constraints, problems are : Problem set: 0 solved, 1 unsolved in 6048 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 1094/1094 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 8515ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 20 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
FORMULA PolyORBNT-PT-S10J60-ReachabilityCardinality-2024-08 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 5 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 75477 ms.

BK_STOP 1716934387501

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r290-tajo-171654447300510"
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 ;