Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853729000284.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 ASLink-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853729000284
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.0K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 201K 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 ASLink-PT-01a-LTLFireability-00
FORMULA_NAME ASLink-PT-01a-LTLFireability-01
FORMULA_NAME ASLink-PT-01a-LTLFireability-02
FORMULA_NAME ASLink-PT-01a-LTLFireability-03
FORMULA_NAME ASLink-PT-01a-LTLFireability-04
FORMULA_NAME ASLink-PT-01a-LTLFireability-05
FORMULA_NAME ASLink-PT-01a-LTLFireability-06
FORMULA_NAME ASLink-PT-01a-LTLFireability-07
FORMULA_NAME ASLink-PT-01a-LTLFireability-08
FORMULA_NAME ASLink-PT-01a-LTLFireability-09
FORMULA_NAME ASLink-PT-01a-LTLFireability-10
FORMULA_NAME ASLink-PT-01a-LTLFireability-11
FORMULA_NAME ASLink-PT-01a-LTLFireability-12
FORMULA_NAME ASLink-PT-01a-LTLFireability-13
FORMULA_NAME ASLink-PT-01a-LTLFireability-14
FORMULA_NAME ASLink-PT-01a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748566364189

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 00:52:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 00:52:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 00:52:45] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2025-05-30 00:52:45] [INFO ] Transformed 431 places.
[2025-05-30 00:52:45] [INFO ] Transformed 735 transitions.
[2025-05-30 00:52:45] [INFO ] Found NUPN structural information;
[2025-05-30 00:52:45] [INFO ] Parsed PT model containing 431 places and 735 transitions and 2801 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA ASLink-PT-01a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 68 out of 431 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 431/431 places, 728/728 transitions.
Ensure Unique test removed 4 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 425 transition count 728
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 10 place count 421 transition count 724
Ensure Unique test removed 1 places
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 420 transition count 724
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 420 transition count 722
Applied a total of 17 rules in 80 ms. Remains 420 /431 variables (removed 11) and now considering 722/728 (removed 6) transitions.
// Phase 1: matrix 722 rows 420 cols
[2025-05-30 00:52:45] [INFO ] Computed 73 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:52:46] [INFO ] Implicit Places using invariants in 607 ms returned [1, 19, 20, 23, 52, 70, 199, 216, 222, 258, 260, 263, 282, 283, 284, 301, 309, 317, 323, 329, 335, 341, 349, 355, 361, 369]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 638 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 394/431 places, 722/728 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 381 transition count 709
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 381 transition count 709
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 371 transition count 699
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 371 transition count 699
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 366 transition count 694
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 366 transition count 694
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 364 transition count 692
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 364 transition count 692
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 362 transition count 690
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 362 transition count 690
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 361 transition count 689
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 361 transition count 689
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 360 transition count 688
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 360 transition count 688
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 359 transition count 687
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 359 transition count 687
Applied a total of 70 rules in 87 ms. Remains 359 /394 variables (removed 35) and now considering 687/722 (removed 35) transitions.
// Phase 1: matrix 687 rows 359 cols
[2025-05-30 00:52:46] [INFO ] Computed 47 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:52:46] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-05-30 00:52:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:52:47] [INFO ] Implicit Places using invariants and state equation in 603 ms returned []
Implicit Place search using SMT with State Equation took 839 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 359/431 places, 687/728 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1660 ms. Remains : 359/431 places, 687/728 transitions.
Support contains 68 out of 359 places after structural reductions.
[2025-05-30 00:52:47] [INFO ] Flatten gal took : 73 ms
[2025-05-30 00:52:47] [INFO ] Flatten gal took : 43 ms
[2025-05-30 00:52:47] [INFO ] Input system was already deterministic with 687 transitions.
Support contains 64 out of 359 places (down from 68) after GAL structural reductions.
RANDOM walk for 40000 steps (731 resets) in 1122 ms. (35 steps per ms) remains 20/36 properties
BEST_FIRST walk for 4003 steps (28 resets) in 81 ms. (48 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (30 resets) in 80 ms. (49 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (25 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (31 resets) in 89 ms. (44 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (25 resets) in 73 ms. (54 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (30 resets) in 27 ms. (143 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (29 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (26 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (30 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (31 resets) in 28 ms. (137 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (30 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (35 resets) in 14 ms. (266 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (27 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (30 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (29 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (33 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (26 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (27 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (25 resets) in 42 ms. (93 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (33 resets) in 39 ms. (100 steps per ms) remains 20/20 properties
[2025-05-30 00:52:48] [INFO ] Invariant cache hit.
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/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 129/165 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 32/197 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 5 (OVERLAPS) 162/359 variables, 33/47 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 0/47 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 687/1046 variables, 359/406 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1046 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:52:50] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:52:50] [INFO ] Deduced a trap composed of 94 places in 257 ms of which 37 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/1046 variables, 2/408 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1046 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 11 (OVERLAPS) 0/1046 variables, 0/408 constraints. Problems are: Problem set: 1 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1046/1046 variables, and 408 constraints, problems are : Problem set: 1 solved, 19 unsolved in 3850 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 19 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 99/132 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 63/195 variables, 7/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 164/359 variables, 33/47 constraints. Problems are: Problem set: 1 solved, 19 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 2/49 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:52:52] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 00:52:53] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 2/51 constraints. Problems are: Problem set: 2 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/359 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 18 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 9 (OVERLAPS) 687/1046 variables, 359/410 constraints. Problems are: Problem set: 19 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1046 variables, 1/411 constraints. Problems are: Problem set: 19 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1046 variables, 0/411 constraints. Problems are: Problem set: 19 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1046 variables, 0/411 constraints. Problems are: Problem set: 19 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1046/1046 variables, and 411 constraints, problems are : Problem set: 19 solved, 1 unsolved in 2597 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 359/359 constraints, PredecessorRefiner: 1/20 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6549ms problems are : Problem set: 19 solved, 1 unsolved
Parikh walk visited 0 properties in 75 ms.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 687/687 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 359 transition count 643
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 315 transition count 643
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 88 place count 315 transition count 610
Deduced a syphon composed of 33 places in 1 ms
Ensure Unique test removed 12 places
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 166 place count 270 transition count 610
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 167 place count 270 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 168 place count 269 transition count 609
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 172 place count 265 transition count 592
Iterating global reduction 4 with 4 rules applied. Total rules applied 176 place count 265 transition count 592
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 178 place count 264 transition count 591
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 179 place count 263 transition count 591
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 179 place count 263 transition count 590
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 262 transition count 590
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 261 transition count 582
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 261 transition count 582
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 184 place count 260 transition count 574
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 260 transition count 574
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 186 place count 259 transition count 566
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 259 transition count 566
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 188 place count 258 transition count 558
Iterating global reduction 6 with 1 rules applied. Total rules applied 189 place count 258 transition count 558
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 190 place count 257 transition count 550
Iterating global reduction 6 with 1 rules applied. Total rules applied 191 place count 257 transition count 550
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 192 place count 256 transition count 542
Iterating global reduction 6 with 1 rules applied. Total rules applied 193 place count 256 transition count 542
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 194 place count 255 transition count 534
Iterating global reduction 6 with 1 rules applied. Total rules applied 195 place count 255 transition count 534
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 196 place count 254 transition count 526
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 254 transition count 526
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 198 place count 253 transition count 518
Iterating global reduction 6 with 1 rules applied. Total rules applied 199 place count 253 transition count 518
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 200 place count 252 transition count 510
Iterating global reduction 6 with 1 rules applied. Total rules applied 201 place count 252 transition count 510
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 202 place count 251 transition count 502
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 251 transition count 502
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 204 place count 250 transition count 494
Iterating global reduction 6 with 1 rules applied. Total rules applied 205 place count 250 transition count 494
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 206 place count 249 transition count 486
Iterating global reduction 6 with 1 rules applied. Total rules applied 207 place count 249 transition count 486
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 208 place count 248 transition count 478
Iterating global reduction 6 with 1 rules applied. Total rules applied 209 place count 248 transition count 478
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 210 place count 247 transition count 470
Iterating global reduction 6 with 1 rules applied. Total rules applied 211 place count 247 transition count 470
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 212 place count 246 transition count 462
Iterating global reduction 6 with 1 rules applied. Total rules applied 213 place count 246 transition count 462
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 273 place count 216 transition count 432
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 274 place count 215 transition count 431
Iterating global reduction 6 with 1 rules applied. Total rules applied 275 place count 215 transition count 431
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 277 place count 215 transition count 429
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 279 place count 213 transition count 429
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 288 place count 213 transition count 420
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 298 place count 203 transition count 420
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 304 place count 203 transition count 420
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 305 place count 202 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 306 place count 201 transition count 419
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 306 place count 201 transition count 417
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 5 rules applied. Total rules applied 311 place count 198 transition count 417
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 312 place count 197 transition count 416
Iterating global reduction 9 with 1 rules applied. Total rules applied 313 place count 197 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 314 place count 197 transition count 415
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 316 place count 196 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 317 place count 196 transition count 413
Applied a total of 317 rules in 431 ms. Remains 196 /359 variables (removed 163) and now considering 413/687 (removed 274) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 431 ms. Remains : 196/359 places, 413/687 transitions.
RANDOM walk for 40000 steps (981 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (556 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2703 steps, run visited all 1 properties in 40 ms. (steps per millisecond=67 )
Probabilistic random walk after 2703 steps, saw 965 distinct states, run finished after 43 ms. (steps per millisecond=62 ) properties seen :1
Successfully simplified 19 atomic propositions for a total of 14 simplifications.
FORMULA ASLink-PT-01a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-01a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)||p0))&&X(X(X(p2)))))'
Support contains 6 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 687/687 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 358 transition count 681
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 358 transition count 681
Applied a total of 2 rules in 11 ms. Remains 358 /359 variables (removed 1) and now considering 681/687 (removed 6) transitions.
// Phase 1: matrix 681 rows 358 cols
[2025-05-30 00:52:55] [INFO ] Computed 47 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:52:56] [INFO ] Implicit Places using invariants in 267 ms returned [29, 196, 212, 213]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 269 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 354/359 places, 681/687 transitions.
Applied a total of 0 rules in 6 ms. Remains 354 /354 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 286 ms. Remains : 354/359 places, 681/687 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 13 ms.
FORMULA ASLink-PT-01a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-09 finished in 680 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((!p0||G(F(!p1)))))||(X(!p1)&&F((!p0||G(F(!p1))))))))'
Support contains 4 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 687/687 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 357 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 357 transition count 672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 356 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 356 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 355 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 355 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 354 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 354 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 353 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 353 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 352 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 352 transition count 632
Applied a total of 14 rules in 33 ms. Remains 352 /359 variables (removed 7) and now considering 632/687 (removed 55) transitions.
// Phase 1: matrix 632 rows 352 cols
[2025-05-30 00:52:56] [INFO ] Computed 47 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:52:56] [INFO ] Implicit Places using invariants in 272 ms returned [29, 196, 212, 213, 262]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 274 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 347/359 places, 632/687 transitions.
Applied a total of 0 rules in 5 ms. Remains 347 /347 variables (removed 0) and now considering 632/632 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 312 ms. Remains : 347/359 places, 632/687 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND p0 p1), (AND p1 p0), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 322 ms.
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 26 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-01a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-01a-LTLFireability-10 finished in 1090 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!p0)))'
Support contains 1 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 687/687 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 357 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 357 transition count 672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 356 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 356 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 355 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 355 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 354 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 354 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 353 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 353 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 352 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 352 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 351 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 351 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 350 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 350 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 349 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 349 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 348 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 348 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 347 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 347 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 346 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 346 transition count 584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 345 transition count 576
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 345 transition count 576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 344 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 344 transition count 568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 343 transition count 560
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 343 transition count 560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 342 transition count 552
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 342 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 341 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 341 transition count 544
Applied a total of 36 rules in 73 ms. Remains 341 /359 variables (removed 18) and now considering 544/687 (removed 143) transitions.
// Phase 1: matrix 544 rows 341 cols
[2025-05-30 00:52:57] [INFO ] Computed 47 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:52:57] [INFO ] Implicit Places using invariants in 247 ms returned [29, 196, 212, 213, 251]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 248 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 336/359 places, 544/687 transitions.
Applied a total of 0 rules in 4 ms. Remains 336 /336 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 327 ms. Remains : 336/359 places, 544/687 transitions.
Stuttering acceptance computed with spot in 114 ms :[p0, true, p0, p0]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-12
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-12 finished in 474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 6 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 687/687 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 357 transition count 672
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 357 transition count 672
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 356 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 356 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 355 transition count 656
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 355 transition count 656
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 354 transition count 648
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 354 transition count 648
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 353 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 353 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 352 transition count 632
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 352 transition count 632
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 351 transition count 624
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 351 transition count 624
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 350 transition count 616
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 350 transition count 616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 349 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 349 transition count 608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 348 transition count 600
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 348 transition count 600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 347 transition count 592
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 347 transition count 592
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 346 transition count 584
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 346 transition count 584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 345 transition count 576
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 345 transition count 576
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 344 transition count 568
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 344 transition count 568
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 343 transition count 560
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 343 transition count 560
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 342 transition count 552
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 342 transition count 552
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 341 transition count 544
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 341 transition count 544
Applied a total of 36 rules in 68 ms. Remains 341 /359 variables (removed 18) and now considering 544/687 (removed 143) transitions.
[2025-05-30 00:52:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 00:52:58] [INFO ] Implicit Places using invariants in 200 ms returned [29, 196, 251]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 215 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 338/359 places, 544/687 transitions.
Applied a total of 0 rules in 4 ms. Remains 338 /338 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 338/359 places, 544/687 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-01a-LTLFireability-15
Stuttering criterion allowed to conclude after 72 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01a-LTLFireability-15 finished in 393 ms.
All properties solved by simple procedures.
Total runtime 13160 ms.

BK_STOP 1748566378559

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="ASLink-PT-01a"
export BK_EXAMINATION="LTLFireability"
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 ASLink-PT-01a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r002-tall-174853729000284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01a.tgz
mv ASLink-PT-01a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;