About the Execution of ITS-Tools for PolyORBNT-PT-S05J40
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 134002.00 | 0.00 | 0.00 | FTTFFFTTFFFTFFFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254400655.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is PolyORBNT-PT-S05J40, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254400655
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 19K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 77K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 337K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 236K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 88K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 399K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 7 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M May 29 14:32 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-00
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-01
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-02
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-03
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-04
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-05
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-06
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-07
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-08
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-09
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-10
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-11
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-12
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-13
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-14
FORMULA_NAME PolyORBNT-PT-S05J40-ReachabilityFireability-2025-15
=== Now, execution of the tool begins
BK_START 1749090061154
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-06-05 02:21:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 02:21:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 02:21:02] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2025-06-05 02:21:02] [INFO ] Transformed 629 places.
[2025-06-05 02:21:02] [INFO ] Transformed 1590 transitions.
[2025-06-05 02:21:02] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 02:21:02] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-05 02:21:02] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-05 02:21:02] [INFO ] Reduced 10 identical enabling conditions.
[2025-06-05 02:21:02] [INFO ] Reduced 555 identical enabling conditions.
[2025-06-05 02:21:02] [INFO ] Reduced 90 identical enabling conditions.
[2025-06-05 02:21:02] [INFO ] Reduced 555 identical enabling conditions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
[2025-06-05 02:21:03] [INFO ] Flatten gal took : 197 ms
[2025-06-05 02:21:03] [INFO ] Flatten gal took : 108 ms
RANDOM walk for 40000 steps (2728 resets) in 2436 ms. (16 steps per ms) remains 10/16 properties
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-05 02:21:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17848219770076076705.gal : 94 ms
[2025-06-05 02:21:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4911240291671628292.prop : 39 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17848219770076076705.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4911240291671628292.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality4911240291671628292.prop.
BEST_FIRST walk for 40003 steps (591 resets) in 3681 ms. (10 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :8 after 32
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :32 after 64
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :64 after 99
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :99 after 103
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :103 after 111
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :111 after 122
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :122 after 142
BEST_FIRST walk for 40003 steps (598 resets) in 2703 ms. (14 steps per ms) remains 9/10 properties
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (621 resets) in 248 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (76 resets) in 1199 ms. (33 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (76 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (551 resets) in 322 ms. (123 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (76 resets) in 92 ms. (430 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (49 resets) in 365 ms. (109 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (76 resets) in 285 ms. (139 steps per ms) remains 9/9 properties
[2025-06-05 02:21:06] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 629 cols
[2025-06-05 02:21:06] [INFO ] Computed 102 invariants in 139 ms
[2025-06-05 02:21:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/540 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-08 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-12 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-13 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-14 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/540 variables, 11/54 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/540 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 5 unsolved
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-07 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 73/613 variables, 33/87 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/613 variables, 4/91 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/613 variables, 0/91 constraints. Problems are: Problem set: 5 solved, 4 unsolved
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-03 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-09 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 16/629 variables, 11/102 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 931/1560 variables, 629/731 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 1/732 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1560 variables, 0/732 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1560 variables, 0/732 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1560/1560 variables, and 732 constraints, problems are : Problem set: 7 solved, 2 unsolved in 3771 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/443 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 152/595 variables, 76/76 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/595 variables, 3/79 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/595 variables, 0/79 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 34/629 variables, 23/102 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/629 variables, 0/102 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 931/1560 variables, 629/731 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1560 variables, 1/732 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1560 variables, 1/733 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1560 variables, 0/733 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1560 variables, 0/733 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1560/1560 variables, and 733 constraints, problems are : Problem set: 7 solved, 2 unsolved in 1793 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 629/629 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5938ms problems are : Problem set: 7 solved, 2 unsolved
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-00 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 34 ms.
Support contains 1 out of 629 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 624 transition count 889
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 97 place count 578 transition count 889
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 97 place count 578 transition count 844
Deduced a syphon composed of 45 places in 3 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 187 place count 533 transition count 844
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 532 transition count 843
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 532 transition count 843
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 193 place count 530 transition count 841
Applied a total of 193 rules in 213 ms. Remains 530 /629 variables (removed 99) and now considering 841/935 (removed 94) transitions.
Running 835 sub problems to find dead transitions.
[2025-06-05 02:21:12] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
// Phase 1: matrix 837 rows 530 cols
[2025-06-05 02:21:12] [INFO ] Computed 97 invariants in 36 ms
[2025-06-05 02:21:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 835 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :142 after 21895
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/1367 variables, and 92 constraints, problems are : Problem set: 0 solved, 835 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:21:37] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:21:42] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:21:45] [INFO ] Deduced a trap composed of 92 places in 217 ms of which 23 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1367 variables, and 95 constraints, problems are : Problem set: 0 solved, 835 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41182ms problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 41188ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41417 ms. Remains : 530/629 places, 841/935 transitions.
RANDOM walk for 40000 steps (2094 resets) in 616 ms. (64 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (184 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 211661 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 1
Probabilistic random walk after 211661 steps, saw 62894 distinct states, run finished after 3007 ms. (steps per millisecond=70 ) properties seen :0
[2025-06-05 02:21:57] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
[2025-06-05 02:21:57] [INFO ] Invariant cache hit.
[2025-06-05 02:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 242/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/504 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/529 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 837/1366 variables, 529/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1366 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1366 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1367 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1367 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1367 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1367/1367 variables, and 628 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 242/243 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 261/504 variables, 75/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/504 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/529 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 837/1366 variables, 529/626 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1366 variables, 1/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1366 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1367 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1367 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1367 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1367 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1367/1367 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1470ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 841/841 transitions.
Applied a total of 0 rules in 41 ms. Remains 530 /530 variables (removed 0) and now considering 841/841 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 530/530 places, 841/841 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 841/841 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 841/841 (removed 0) transitions.
[2025-06-05 02:21:58] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
[2025-06-05 02:21:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:21:59] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2025-06-05 02:21:59] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
[2025-06-05 02:21:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 02:22:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-05 02:22:06] [INFO ] Implicit Places using invariants and state equation in 7270 ms returned []
Implicit Place search using SMT with State Equation took 8334 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:22:07] [INFO ] Redundant transitions in 85 ms returned []
Running 835 sub problems to find dead transitions.
[2025-06-05 02:22:07] [INFO ] Flow matrix only has 837 transitions (discarded 4 similar events)
[2025-06-05 02:22:07] [INFO ] Invariant cache hit.
[2025-06-05 02:22:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 17/92 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD545 is UNSAT
Problem TDEAD546 is UNSAT
Problem TDEAD547 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD550 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD586 is UNSAT
Problem TDEAD587 is UNSAT
Problem TDEAD588 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD591 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD593 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD601 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD605 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
At refinement iteration 3 (OVERLAPS) 5/530 variables, 5/97 constraints. Problems are: Problem set: 95 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1367 variables, and 97 constraints, problems are : Problem set: 95 solved, 740 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 95 solved, 740 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/525 variables, 75/75 constraints. Problems are: Problem set: 95 solved, 740 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/525 variables, 17/92 constraints. Problems are: Problem set: 95 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:22:44] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:22:45] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 2/94 constraints. Problems are: Problem set: 95 solved, 740 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:22:57] [INFO ] Deduced a trap composed of 92 places in 225 ms of which 23 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 1/95 constraints. Problems are: Problem set: 95 solved, 740 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/1367 variables, and 95 constraints, problems are : Problem set: 95 solved, 740 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 17/22 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60841ms problems are : Problem set: 95 solved, 740 unsolved
Search for dead transitions found 95 dead transitions in 60845ms
Found 95 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 95 transitions
Dead transitions reduction (with SMT) removed 95 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 530/530 places, 746/841 transitions.
Applied a total of 0 rules in 49 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 02:23:07] [INFO ] Redundant transitions in 11 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 69372 ms. Remains : 530/530 places, 746/841 transitions.
RANDOM walk for 40000 steps (2086 resets) in 433 ms. (92 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (174 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 234091 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 1
Probabilistic random walk after 234091 steps, saw 69729 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
[2025-06-05 02:23:11] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2025-06-05 02:23:11] [INFO ] Computed 97 invariants in 23 ms
[2025-06-05 02:23:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/505 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:11] [INFO ] Deduced a trap composed of 84 places in 216 ms of which 40 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/529 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 742/1271 variables, 529/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1271 variables, 1/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1271 variables, 0/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/1272 variables, 1/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1272 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1272 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1272/1272 variables, and 629 constraints, problems are : Problem set: 0 solved, 1 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 530/530 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 235/244 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 261/505 variables, 75/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/529 variables, 19/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:12] [INFO ] Deduced a trap composed of 134 places in 221 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:12] [INFO ] Deduced a trap composed of 134 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:12] [INFO ] Deduced a trap composed of 134 places in 277 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:13] [INFO ] Deduced a trap composed of 134 places in 250 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:13] [INFO ] Deduced a trap composed of 134 places in 502 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:13] [INFO ] Deduced a trap composed of 134 places in 191 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:13] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:14] [INFO ] Deduced a trap composed of 134 places in 220 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:14] [INFO ] Deduced a trap composed of 134 places in 187 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:14] [INFO ] Deduced a trap composed of 134 places in 200 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 02:23:14] [INFO ] Deduced a trap composed of 134 places in 222 ms of which 54 ms to minimize.
Problem PolyORBNT-PT-S05J40-ReachabilityFireability-2025-04 is UNSAT
FORMULA PolyORBNT-PT-S05J40-ReachabilityFireability-2025-04 FALSE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 529/1272 variables, and 109 constraints, problems are : Problem set: 1 solved, 0 unsolved in 3015 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/530 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3733ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 132812 ms.
BK_STOP 1749090195156
--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-S05J40"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is PolyORBNT-PT-S05J40, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254400655"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;