Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r354-tall-178024402800148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is LastZero-PT-N24, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r354-tall-178024402800148
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 8.0K May 27 10:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 27 10:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 27 10:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 27 10:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Jun 16 12:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 16 12:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Jun 16 12:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Jun 16 12:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 13K May 27 10:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K May 27 10:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 27 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 27 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Jun 16 12:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Jun 16 12:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 4 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 5.2M Jun 10 11:58 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 LastZero-PT-N24-LTLFireability-00
FORMULA_NAME LastZero-PT-N24-LTLFireability-01
FORMULA_NAME LastZero-PT-N24-LTLFireability-02
FORMULA_NAME LastZero-PT-N24-LTLFireability-03
FORMULA_NAME LastZero-PT-N24-LTLFireability-04
FORMULA_NAME LastZero-PT-N24-LTLFireability-05
FORMULA_NAME LastZero-PT-N24-LTLFireability-06
FORMULA_NAME LastZero-PT-N24-LTLFireability-07
FORMULA_NAME LastZero-PT-N24-LTLFireability-08
FORMULA_NAME LastZero-PT-N24-LTLFireability-09
FORMULA_NAME LastZero-PT-N24-LTLFireability-10
FORMULA_NAME LastZero-PT-N24-LTLFireability-11
FORMULA_NAME LastZero-PT-N24-LTLFireability-12
FORMULA_NAME LastZero-PT-N24-LTLFireability-13
FORMULA_NAME LastZero-PT-N24-LTLFireability-14
FORMULA_NAME LastZero-PT-N24-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1781643383810

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LastZero-PT-N24
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-06-16 20:56:24] [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]
[2026-06-16 20:56:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-16 20:56:25] [INFO ] Load time of PNML (sax parser for PT used): 376 ms
[2026-06-16 20:56:25] [INFO ] Transformed 1300 places.
[2026-06-16 20:56:25] [INFO ] Transformed 16777 transitions.
[2026-06-16 20:56:25] [INFO ] Parsed PT model containing 1300 places and 16777 transitions and 51483 arcs in 524 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 626 places in 69 ms
Reduce places removed 626 places and 10977 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N24-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 673 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 673/673 places, 5800/5800 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 672 transition count 5800
Applied a total of 1 rules in 74 ms. Remains 672 /673 variables (removed 1) and now considering 5800/5800 (removed 0) transitions.
[2026-06-16 20:56:25] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15732219980568319829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7549279711619291138.kers'
[2026-06-16 20:56:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15732219980568319829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7549279711619291138.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5524 rows 671 cols 15646 entries
Finished phase 1 with 648 SingleSign rule and 0 generalized
[2026-06-16 20:56:25] [INFO ] Computed 24 invariants in 13 ms
Computed 24 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-7549279711619291138.kers
Total runtime 18 ms.
[2026-06-16 20:56:26] [INFO ] Implicit Places using invariants in 996 ms returned []
[2026-06-16 20:56:26] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-16 20:56:26] [INFO ] Invariant cache hit.
[2026-06-16 20:56:27] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-16 20:56:57] [INFO ] Performed 480/672 implicitness test of which 1 returned IMPLICIT in 30 seconds.
[2026-06-16 20:57:25] [INFO ] Implicit Places using invariants and state equation in 59060 ms returned [255]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 60104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 671/673 places, 5800/5800 transitions.
Applied a total of 0 rules in 30 ms. Remains 671 /671 variables (removed 0) and now considering 5800/5800 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60220 ms. Remains : 671/673 places, 5800/5800 transitions.
Starting structural reductions in LTL mode, iteration 0 : 671/671 places, 5800/5800 transitions.
Applied a total of 0 rules in 20 ms. Remains 671 /671 variables (removed 0) and now considering 5800/5800 (removed 0) transitions.
[2026-06-16 20:57:26] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9401379156028228155.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1933325189625477663.kers'
[2026-06-16 20:57:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9401379156028228155.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1933325189625477663.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 2 ms.
// Phase 1: matrix 5524 rows 670 cols 15622 entries
Finished phase 1 with 648 SingleSign rule and 0 generalized
[2026-06-16 20:57:26] [INFO ] Computed 23 invariants in 13 ms
Computed 23 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-1933325189625477663.kers
Total runtime 18 ms.
[2026-06-16 20:57:26] [INFO ] Implicit Places using invariants in 513 ms returned []
[2026-06-16 20:57:26] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-16 20:57:26] [INFO ] Invariant cache hit.
[2026-06-16 20:57:27] [INFO ] State equation strengthened by 600 read => feed constraints.
[2026-06-16 20:57:58] [INFO ] Performed 329/671 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2026-06-16 20:58:28] [INFO ] Performed 532/671 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2026-06-16 20:58:46] [INFO ] Implicit Places using invariants and state equation in 79574 ms returned []
Implicit Place search using SMT with State Equation took 80092 ms to find 0 implicit places.
Running 5776 sub problems to find dead transitions.
[2026-06-16 20:58:46] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-16 20:58:46] [INFO ] Invariant cache hit.
[2026-06-16 20:58:46] [INFO ] State equation strengthened by 600 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5776 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/6195 variables, and 23 constraints, problems are : Problem set: 0 solved, 5776 unsolved in 30124 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/671 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 5776/5776 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5776 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 5776 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/6195 variables, and 23 constraints, problems are : Problem set: 0 solved, 5776 unsolved in 30096 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/671 constraints, ReadFeed: 0/600 constraints, PredecessorRefiner: 0/5776 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 64508ms problems are : Problem set: 0 solved, 5776 unsolved
Search for dead transitions found 0 dead transitions in 64583ms
Finished structural reductions in LTL mode , in 1 iterations and 144754 ms. Remains : 671/671 places, 5800/5800 transitions.
Support contains 10 out of 671 places after structural reductions.
[2026-06-16 20:59:51] [INFO ] Flatten gal took : 315 ms
[2026-06-16 20:59:51] [INFO ] Flatten gal took : 208 ms
[2026-06-16 20:59:51] [INFO ] Input system was already deterministic with 5800 transitions.
RANDOM walk for 40000 steps (544 resets) in 1619 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (44 resets) in 215 ms. (185 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (47 resets) in 241 ms. (165 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (46 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 102900 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :0 out of 4
Probabilistic random walk after 102900 steps, saw 22363 distinct states, run finished after 3005 ms. (steps per millisecond=34 ) properties seen :0
[2026-06-16 20:59:55] [INFO ] Flow matrix only has 5524 transitions (discarded 276 similar events)
[2026-06-16 20:59:55] [INFO ] Invariant cache hit.
[2026-06-16 20:59:55] [INFO ] State equation strengthened by 600 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 60/70 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1339/1409 variables, 70/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1409 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1409 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
At refinement iteration 6 (OVERLAPS) 773/2182 variables, 107/186 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2182 variables, 102/288 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2182 variables, 0/288 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1182/3364 variables, 100/388 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3364 variables, 0/388 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 568/3932 variables, 145/533 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3932 variables, 3/536 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3932 variables, 78/614 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3932 variables, 0/614 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 46/3978 variables, 25/639 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3978 variables, 1/640 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3978 variables, 2/642 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3978 variables, 0/642 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/3980 variables, 1/643 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3980 variables, 0/643 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/3982 variables, 1/644 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3982 variables, 0/644 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/3984 variables, 1/645 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3984 variables, 0/645 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/3986 variables, 1/646 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3986 variables, 0/646 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/3988 variables, 1/647 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/3988 variables, 0/647 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/3990 variables, 1/648 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/3990 variables, 0/648 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/3992 variables, 1/649 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/3992 variables, 0/649 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/3994 variables, 1/650 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/3994 variables, 0/650 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/3996 variables, 1/651 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/3996 variables, 0/651 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/3998 variables, 1/652 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/3998 variables, 0/652 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/4000 variables, 1/653 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/4000 variables, 0/653 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/4002 variables, 1/654 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/4002 variables, 0/654 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/4004 variables, 1/655 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/4004 variables, 0/655 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 2/4006 variables, 1/656 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/4006 variables, 0/656 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 1619/5625 variables, 68/724 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/5625 variables, 0/724 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 555/6180 variables, 295/1019 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/6180 variables, 16/1035 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/6180 variables, 244/1279 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/6180 variables, 0/1279 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 15/6195 variables, 15/1294 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/6195 variables, 0/1294 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 0/6195 variables, 0/1294 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6195/6195 variables, and 1294 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3123 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 671/671 constraints, ReadFeed: 600/600 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 531/556 variables, 25/26 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 1/27 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/27 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 67/623 variables, 23/50 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/623 variables, 22/72 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/623 variables, 0/72 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 508/1131 variables, 46/118 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1131 variables, 0/118 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 693/1824 variables, 71/189 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1824 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1824 variables, 46/236 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1824 variables, 1/237 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1824 variables, 0/237 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 54/1878 variables, 28/265 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1878 variables, 2/267 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1878 variables, 0/267 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/1880 variables, 1/268 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1880 variables, 0/268 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 2/1882 variables, 1/269 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1882 variables, 0/269 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/1884 variables, 1/270 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1884 variables, 0/270 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 2/1886 variables, 1/271 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1886 variables, 0/271 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/1888 variables, 1/272 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1888 variables, 0/272 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 2/1890 variables, 1/273 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1890 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 2/1892 variables, 1/274 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1892 variables, 0/274 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 2/1894 variables, 1/275 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1894 variables, 0/275 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 2/1896 variables, 1/276 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1896 variables, 0/276 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 2/1898 variables, 1/277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1898 variables, 0/277 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 2/1900 variables, 1/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1900 variables, 0/278 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 2/1902 variables, 1/279 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1902 variables, 0/279 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 2/1904 variables, 1/280 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1904 variables, 0/280 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 2/1906 variables, 1/281 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1906 variables, 0/281 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 2/1908 variables, 1/282 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1908 variables, 0/282 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 49 (OVERLAPS) 2/1910 variables, 1/283 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/1910 variables, 0/283 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 51 (OVERLAPS) 2/1912 variables, 1/284 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/1912 variables, 0/284 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 53 (OVERLAPS) 2/1914 variables, 1/285 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/1914 variables, 0/285 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 55 (OVERLAPS) 2/1916 variables, 1/286 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/1916 variables, 0/286 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 57 (OVERLAPS) 2/1918 variables, 1/287 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/1918 variables, 0/287 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 59 (OVERLAPS) 3311/5229 variables, 42/329 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/5229 variables, 0/329 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 61 (OVERLAPS) 945/6174 variables, 483/812 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/6174 variables, 21/833 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/6174 variables, 441/1274 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/6174 variables, 0/1274 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 65 (OVERLAPS) 21/6195 variables, 21/1295 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/6195 variables, 0/1295 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 67 (OVERLAPS) 0/6195 variables, 0/1295 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6195/6195 variables, and 1295 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 671/671 constraints, ReadFeed: 600/600 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7134ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 3 atomic propositions for a total of 3 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA LastZero-PT-N24-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LastZero-PT-N24-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 671 stabilizing places and 5800 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 671 transition count 5800
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
All properties solved by simple procedures.
Total runtime 217917 ms.

BK_STOP 1781643602909

--------------------
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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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="LastZero-PT-N24"
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-5973"
echo " Executing tool itstools"
echo " Input is LastZero-PT-N24, 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 r354-tall-178024402800148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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