Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r500-smll-171649588000340.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is IBM5964-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r500-smll-171649588000340
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 16K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 11 18:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 11 18:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 11 18:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 18:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 171K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME IBM5964-PT-none-LTLFireability-00
FORMULA_NAME IBM5964-PT-none-LTLFireability-01
FORMULA_NAME IBM5964-PT-none-LTLFireability-02
FORMULA_NAME IBM5964-PT-none-LTLFireability-03
FORMULA_NAME IBM5964-PT-none-LTLFireability-04
FORMULA_NAME IBM5964-PT-none-LTLFireability-05
FORMULA_NAME IBM5964-PT-none-LTLFireability-06
FORMULA_NAME IBM5964-PT-none-LTLFireability-07
FORMULA_NAME IBM5964-PT-none-LTLFireability-08
FORMULA_NAME IBM5964-PT-none-LTLFireability-09
FORMULA_NAME IBM5964-PT-none-LTLFireability-10
FORMULA_NAME IBM5964-PT-none-LTLFireability-11
FORMULA_NAME IBM5964-PT-none-LTLFireability-12
FORMULA_NAME IBM5964-PT-none-LTLFireability-13
FORMULA_NAME IBM5964-PT-none-LTLFireability-14
FORMULA_NAME IBM5964-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717286099436

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IBM5964-PT-none
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:55:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 23:55:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:55:02] [INFO ] Load time of PNML (sax parser for PT used): 180 ms
[2024-06-01 23:55:02] [INFO ] Transformed 263 places.
[2024-06-01 23:55:02] [INFO ] Transformed 139 transitions.
[2024-06-01 23:55:02] [INFO ] Parsed PT model containing 263 places and 139 transitions and 541 arcs in 406 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA IBM5964-PT-none-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 59 out of 263 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 263/263 places, 139/139 transitions.
Ensure Unique test removed 92 places
Reduce places removed 101 places and 0 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 162 transition count 139
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 106 place count 157 transition count 134
Iterating global reduction 1 with 5 rules applied. Total rules applied 111 place count 157 transition count 134
Applied a total of 111 rules in 105 ms. Remains 157 /263 variables (removed 106) and now considering 134/139 (removed 5) transitions.
// Phase 1: matrix 134 rows 157 cols
[2024-06-01 23:55:03] [INFO ] Computed 30 invariants in 38 ms
[2024-06-01 23:55:03] [INFO ] Implicit Places using invariants in 459 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 528 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 156/263 places, 134/139 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 133
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 133
Applied a total of 2 rules in 30 ms. Remains 155 /156 variables (removed 1) and now considering 133/134 (removed 1) transitions.
// Phase 1: matrix 133 rows 155 cols
[2024-06-01 23:55:03] [INFO ] Computed 29 invariants in 6 ms
[2024-06-01 23:55:03] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 23:55:03] [INFO ] Invariant cache hit.
[2024-06-01 23:55:03] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 155/263 places, 133/139 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1193 ms. Remains : 155/263 places, 133/139 transitions.
Support contains 59 out of 155 places after structural reductions.
[2024-06-01 23:55:04] [INFO ] Flatten gal took : 74 ms
[2024-06-01 23:55:04] [INFO ] Flatten gal took : 31 ms
[2024-06-01 23:55:04] [INFO ] Input system was already deterministic with 133 transitions.
Support contains 56 out of 155 places (down from 59) after GAL structural reductions.
RANDOM walk for 40001 steps (820 resets) in 1521 ms. (26 steps per ms) remains 24/29 properties
BEST_FIRST walk for 4003 steps (21 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (22 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (23 resets) in 37 ms. (105 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (24 resets) in 70 ms. (56 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (21 resets) in 49 ms. (80 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (23 resets) in 77 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (21 resets) in 71 ms. (55 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (22 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 44 ms. (88 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (23 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (22 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (23 resets) in 31 ms. (125 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (22 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (22 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (20 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (22 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (23 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
[2024-06-01 23:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 13/63 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 60/123 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 70/193 variables, 37/125 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/193 variables, 2/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 38/231 variables, 22/149 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 11 (OVERLAPS) 27/258 variables, 15/164 constraints. Problems are: Problem set: 8 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/258 variables, 0/164 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 13/271 variables, 2/166 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/271 variables, 1/167 constraints. Problems are: Problem set: 8 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/271 variables, 0/167 constraints. Problems are: Problem set: 8 solved, 16 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 16 (OVERLAPS) 14/285 variables, 15/182 constraints. Problems are: Problem set: 10 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/182 constraints. Problems are: Problem set: 10 solved, 14 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
After SMT solving in domain Real declared 288/288 variables, and 184 constraints, problems are : Problem set: 24 solved, 0 unsolved in 1845 ms.
Refiners :[Generalized P Invariants (flows): 29/29 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
After SMT, in 1887ms problems are : Problem set: 24 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 24 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA IBM5964-PT-none-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 155 stabilizing places and 133 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 155 transition count 133
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA IBM5964-PT-none-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA IBM5964-PT-none-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 133/133 transitions.
Ensure Unique test removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 130 transition count 133
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 124 transition count 127
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 123 transition count 126
Applied a total of 39 rules in 40 ms. Remains 123 /155 variables (removed 32) and now considering 126/133 (removed 7) transitions.
// Phase 1: matrix 126 rows 123 cols
[2024-06-01 23:55:07] [INFO ] Computed 4 invariants in 4 ms
[2024-06-01 23:55:07] [INFO ] Implicit Places using invariants in 109 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 112 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 122/155 places, 126/133 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 121 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 121 transition count 125
Applied a total of 2 rules in 11 ms. Remains 121 /122 variables (removed 1) and now considering 125/126 (removed 1) transitions.
// Phase 1: matrix 125 rows 121 cols
[2024-06-01 23:55:07] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 23:55:07] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-01 23:55:07] [INFO ] Invariant cache hit.
[2024-06-01 23:55:08] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/155 places, 125/133 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 464 ms. Remains : 121/155 places, 125/133 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-02
Stuttering criterion allowed to conclude after 46 steps with 4 reset in 4 ms.
FORMULA IBM5964-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLFireability-02 finished in 935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 133/133 transitions.
Ensure Unique test removed 25 places
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 130 transition count 133
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 31 place count 124 transition count 127
Iterating global reduction 1 with 6 rules applied. Total rules applied 37 place count 124 transition count 127
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 123 transition count 126
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 123 transition count 126
Applied a total of 39 rules in 17 ms. Remains 123 /155 variables (removed 32) and now considering 126/133 (removed 7) transitions.
// Phase 1: matrix 126 rows 123 cols
[2024-06-01 23:55:08] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 23:55:08] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-01 23:55:08] [INFO ] Invariant cache hit.
[2024-06-01 23:55:08] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-06-01 23:55:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (OVERLAPS) 1/123 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD125 is UNSAT
At refinement iteration 4 (OVERLAPS) 126/249 variables, 123/127 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/127 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/127 constraints. Problems are: Problem set: 104 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 127 constraints, problems are : Problem set: 104 solved, 21 unsolved in 3104 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 104 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/22 variables, 2/2 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/44 variables, 22/24 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 13/37 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/37 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 5/49 variables, 3/40 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 8/48 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/48 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 6/55 variables, 3/51 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/51 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 8/63 variables, 4/55 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/63 variables, 0/55 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 8/71 variables, 1/56 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/71 variables, 0/56 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 8/79 variables, 9/65 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 0/65 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 17 (OVERLAPS) 2/81 variables, 1/66 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/81 variables, 0/66 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 3/84 variables, 1/67 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/84 variables, 0/67 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 6/90 variables, 2/69 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/90 variables, 0/69 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 11/101 variables, 4/73 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/101 variables, 0/73 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 25 (OVERLAPS) 16/117 variables, 7/80 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/117 variables, 0/80 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 27 (OVERLAPS) 13/130 variables, 7/87 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/130 variables, 0/87 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 29 (OVERLAPS) 9/139 variables, 5/92 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/139 variables, 0/92 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 31 (OVERLAPS) 9/148 variables, 4/96 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/148 variables, 0/96 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 33 (OVERLAPS) 11/159 variables, 5/101 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/159 variables, 0/101 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 35 (OVERLAPS) 14/173 variables, 7/108 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/173 variables, 0/108 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 37 (OVERLAPS) 4/177 variables, 1/109 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/177 variables, 0/109 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 39 (OVERLAPS) 15/192 variables, 9/118 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/192 variables, 0/118 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 41 (OVERLAPS) 19/211 variables, 8/126 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/211 variables, 0/126 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 43 (OVERLAPS) 17/228 variables, 10/136 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/228 variables, 0/136 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 45 (OVERLAPS) 10/238 variables, 6/142 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/238 variables, 0/142 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 47 (OVERLAPS) 5/243 variables, 3/145 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/243 variables, 0/145 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 49 (OVERLAPS) 4/247 variables, 2/147 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/247 variables, 0/147 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 51 (OVERLAPS) 2/249 variables, 1/148 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/249 variables, 0/148 constraints. Problems are: Problem set: 104 solved, 21 unsolved
At refinement iteration 53 (OVERLAPS) 0/249 variables, 0/148 constraints. Problems are: Problem set: 104 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 148 constraints, problems are : Problem set: 104 solved, 21 unsolved in 3788 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 123/123 constraints, PredecessorRefiner: 21/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 6979ms problems are : Problem set: 104 solved, 21 unsolved
Search for dead transitions found 104 dead transitions in 6986ms
Found 104 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 104 transitions
Dead transitions reduction (with SMT) removed 104 transitions
Starting structural reductions in LTL mode, iteration 1 : 123/155 places, 22/133 transitions.
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 22 transition count 20
Applied a total of 103 rules in 1 ms. Remains 22 /123 variables (removed 101) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 22 cols
[2024-06-01 23:55:15] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 23:55:15] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 23:55:15] [INFO ] Invariant cache hit.
[2024-06-01 23:55:15] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 22/155 places, 20/133 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7375 ms. Remains : 22/155 places, 20/133 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : IBM5964-PT-none-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA IBM5964-PT-none-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property IBM5964-PT-none-LTLFireability-09 finished in 7510 ms.
All properties solved by simple procedures.
Total runtime 14161 ms.
ITS solved all properties within timeout

BK_STOP 1717286116095

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="IBM5964-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is IBM5964-PT-none, 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 r500-smll-171649588000340"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;