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.r492-smll-171636266200108.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 Echo-PT-d03r03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266200108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 5.9K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 04:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 04:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 114K 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 Echo-PT-d03r03-LTLFireability-00
FORMULA_NAME Echo-PT-d03r03-LTLFireability-01
FORMULA_NAME Echo-PT-d03r03-LTLFireability-02
FORMULA_NAME Echo-PT-d03r03-LTLFireability-03
FORMULA_NAME Echo-PT-d03r03-LTLFireability-04
FORMULA_NAME Echo-PT-d03r03-LTLFireability-05
FORMULA_NAME Echo-PT-d03r03-LTLFireability-06
FORMULA_NAME Echo-PT-d03r03-LTLFireability-07
FORMULA_NAME Echo-PT-d03r03-LTLFireability-08
FORMULA_NAME Echo-PT-d03r03-LTLFireability-09
FORMULA_NAME Echo-PT-d03r03-LTLFireability-10
FORMULA_NAME Echo-PT-d03r03-LTLFireability-11
FORMULA_NAME Echo-PT-d03r03-LTLFireability-12
FORMULA_NAME Echo-PT-d03r03-LTLFireability-13
FORMULA_NAME Echo-PT-d03r03-LTLFireability-14
FORMULA_NAME Echo-PT-d03r03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717204357163

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 01:12:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 01:12:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 01:12:39] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-06-01 01:12:39] [INFO ] Transformed 265 places.
[2024-06-01 01:12:39] [INFO ] Transformed 206 transitions.
[2024-06-01 01:12:39] [INFO ] Found NUPN structural information;
[2024-06-01 01:12:39] [INFO ] Parsed PT model containing 265 places and 206 transitions and 1252 arcs in 445 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 Echo-PT-d03r03-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 80 out of 265 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 206/206 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 238 transition count 206
Applied a total of 27 rules in 70 ms. Remains 238 /265 variables (removed 27) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2024-06-01 01:12:40] [INFO ] Computed 108 invariants in 121 ms
[2024-06-01 01:12:41] [INFO ] Implicit Places using invariants in 1141 ms returned []
[2024-06-01 01:12:41] [INFO ] Invariant cache hit.
[2024-06-01 01:12:42] [INFO ] Implicit Places using invariants and state equation in 967 ms returned []
Implicit Place search using SMT with State Equation took 2173 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:12:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30045 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30034 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60433ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60466ms
Starting structural reductions in LTL mode, iteration 1 : 238/265 places, 206/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62756 ms. Remains : 238/265 places, 206/206 transitions.
Support contains 80 out of 238 places after structural reductions.
[2024-06-01 01:13:43] [INFO ] Flatten gal took : 113 ms
[2024-06-01 01:13:43] [INFO ] Flatten gal took : 52 ms
[2024-06-01 01:13:43] [INFO ] Input system was already deterministic with 206 transitions.
Reduction of identical properties reduced properties to check from 31 to 29
RANDOM walk for 4842 steps (86 resets) in 403 ms. (11 steps per ms) remains 0/29 properties
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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' '!(G(F(p0)))'
Support contains 2 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.5 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 50 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2024-06-01 01:13:44] [INFO ] Computed 102 invariants in 32 ms
[2024-06-01 01:13:44] [INFO ] Implicit Places using invariants in 702 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 705 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 22 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 779 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-00
Stuttering criterion allowed to conclude after 71 steps with 1 reset in 5 ms.
FORMULA Echo-PT-d03r03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-00 finished in 1097 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' '!(G(F(((X(p2)&&p1)||p0))))'
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2024-06-01 01:13:45] [INFO ] Computed 108 invariants in 19 ms
[2024-06-01 01:13:45] [INFO ] Implicit Places using invariants in 747 ms returned []
[2024-06-01 01:13:45] [INFO ] Invariant cache hit.
[2024-06-01 01:13:47] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:13:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30025 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30018 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in LTL mode , in 1 iterations and 61972 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-01
Product exploration explored 100000 steps with 2107 reset in 812 ms.
Product exploration explored 100000 steps with 2112 reset in 545 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 24 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-01 finished in 63730 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(X(X(!(F(p0) U !p1))))&&F((p0 U !p2))))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 5 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 01:14:48] [INFO ] Invariant cache hit.
[2024-06-01 01:14:49] [INFO ] Implicit Places using invariants in 910 ms returned []
[2024-06-01 01:14:49] [INFO ] Invariant cache hit.
[2024-06-01 01:14:50] [INFO ] Implicit Places using invariants and state equation in 1062 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:14:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30014 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30013 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60177ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in LTL mode , in 1 iterations and 62170 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 446 ms :[(OR (NOT p1) p2), (NOT p1), p2, (NOT p1), (NOT p1), true, (AND (NOT p1) p0), p0]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-02
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-02 finished in 62645 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(X(F((p0&&X(G(p1)))))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 01:15:51] [INFO ] Invariant cache hit.
[2024-06-01 01:15:53] [INFO ] Implicit Places using invariants in 1395 ms returned []
[2024-06-01 01:15:53] [INFO ] Invariant cache hit.
[2024-06-01 01:15:54] [INFO ] Implicit Places using invariants and state equation in 1343 ms returned []
Implicit Place search using SMT with State Equation took 2740 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:15:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30030 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30012 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Finished structural reductions in LTL mode , in 1 iterations and 62930 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-03
Product exploration explored 100000 steps with 1818 reset in 482 ms.
Product exploration explored 100000 steps with 1818 reset in 560 ms.
Computed a total of 238 stabilizing places and 206 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 238 transition count 206
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-03 finished in 64452 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(X(G(p0))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 4 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
[2024-06-01 01:16:56] [INFO ] Invariant cache hit.
[2024-06-01 01:16:56] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-06-01 01:16:56] [INFO ] Invariant cache hit.
[2024-06-01 01:16:58] [INFO ] Implicit Places using invariants and state equation in 1192 ms returned []
Implicit Place search using SMT with State Equation took 2099 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:16:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30012 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30015 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Finished structural reductions in LTL mode , in 1 iterations and 62262 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-05 finished in 62468 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' '!(F(G(p0)))'
Support contains 4 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 24 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2024-06-01 01:17:58] [INFO ] Computed 102 invariants in 26 ms
[2024-06-01 01:17:59] [INFO ] Implicit Places using invariants in 745 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 747 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 23 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 796 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-06
Product exploration explored 100000 steps with 1886 reset in 392 ms.
Product exploration explored 100000 steps with 1886 reset in 444 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 22 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-06 finished in 1898 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' '!(F(G(((F(!p1)||G(!p2))&&p0))))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.3 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 26 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
[2024-06-01 01:18:00] [INFO ] Invariant cache hit.
[2024-06-01 01:18:01] [INFO ] Implicit Places using invariants in 785 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 788 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 20 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 836 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (AND p1 p2)), (AND p1 p2), (OR (AND (NOT p0) p1) (AND p1 p2))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-08
Product exploration explored 100000 steps with 1939 reset in 422 ms.
Product exploration explored 100000 steps with 1938 reset in 464 ms.
Computed a total of 224 stabilizing places and 204 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 224 transition count 204
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2)))), (X p0), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND p1 p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 p2)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 256 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-08 finished in 2303 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' '!(F((p0||(G(p1)&&X(p0)))))'
Support contains 3 out of 238 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 12 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
[2024-06-01 01:18:02] [INFO ] Invariant cache hit.
[2024-06-01 01:18:03] [INFO ] Implicit Places using invariants in 934 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 935 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 10 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 958 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-09
Stuttering criterion allowed to conclude after 131 steps with 3 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-09 finished in 1025 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' '!(G((X(p0)||(G(p2)&&p1))))'
Support contains 9 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 2 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2024-06-01 01:18:03] [INFO ] Computed 108 invariants in 21 ms
[2024-06-01 01:18:05] [INFO ] Implicit Places using invariants in 1329 ms returned []
[2024-06-01 01:18:05] [INFO ] Invariant cache hit.
[2024-06-01 01:18:06] [INFO ] Implicit Places using invariants and state equation in 1291 ms returned []
Implicit Place search using SMT with State Equation took 2622 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:18:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30014 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30010 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Finished structural reductions in LTL mode , in 1 iterations and 62760 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-10
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-10 finished in 62965 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' '!(F((((p0||X(p0)) U p1)||G(p0))))'
Support contains 5 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 10 ms. Remains 231 /238 variables (removed 7) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 231 cols
[2024-06-01 01:19:06] [INFO ] Computed 102 invariants in 17 ms
[2024-06-01 01:19:07] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2024-06-01 01:19:07] [INFO ] Invariant cache hit.
[2024-06-01 01:19:08] [INFO ] Implicit Places using invariants and state equation in 1058 ms returned []
Implicit Place search using SMT with State Equation took 2103 ms to find 0 implicit places.
[2024-06-01 01:19:08] [INFO ] Redundant transitions in 11 ms returned []
Running 204 sub problems to find dead transitions.
[2024-06-01 01:19:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 96/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/436 variables, and 564 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30014 ms.
Refiners :[Domain max(s): 231/231 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 96/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/436 variables, 231/564 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 204/768 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 768 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30015 ms.
Refiners :[Domain max(s): 231/231 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in SI_LTL mode, iteration 1 : 231/238 places, 205/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62261 ms. Remains : 231/238 places, 205/206 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Product exploration explored 100000 steps with 50000 reset in 260 ms.
Computed a total of 231 stabilizing places and 205 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 205
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-11 finished in 63094 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' '!(G((F((G((p1 U !p2))&&p0)) U p3)))'
Support contains 8 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 11 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
// Phase 1: matrix 204 rows 230 cols
[2024-06-01 01:20:09] [INFO ] Computed 102 invariants in 32 ms
[2024-06-01 01:20:10] [INFO ] Implicit Places using invariants in 928 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 929 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 9 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 950 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p3), (OR (NOT p0) p2), (NOT p3), p2, p2]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-12
Stuttering criterion allowed to conclude after 55 steps with 1 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-12 finished in 1283 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 14 ms. Remains 230 /238 variables (removed 8) and now considering 204/206 (removed 2) transitions.
[2024-06-01 01:20:11] [INFO ] Invariant cache hit.
[2024-06-01 01:20:12] [INFO ] Implicit Places using invariants in 1025 ms returned [16, 181, 203, 211, 216, 224]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1028 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 224/238 places, 204/206 transitions.
Applied a total of 0 rules in 14 ms. Remains 224 /224 variables (removed 0) and now considering 204/204 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1057 ms. Remains : 224/238 places, 204/206 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-13
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d03r03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-13 finished in 1237 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' '!(G(F((G(p1)||p0))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Graph (complete) has 727 edges and 238 vertex of which 231 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 15 ms. Remains 231 /238 variables (removed 7) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 231 cols
[2024-06-01 01:20:12] [INFO ] Computed 102 invariants in 14 ms
[2024-06-01 01:20:13] [INFO ] Implicit Places using invariants in 1384 ms returned []
[2024-06-01 01:20:13] [INFO ] Invariant cache hit.
[2024-06-01 01:20:14] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 2109 ms to find 0 implicit places.
[2024-06-01 01:20:14] [INFO ] Redundant transitions in 13 ms returned []
Running 204 sub problems to find dead transitions.
[2024-06-01 01:20:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 96/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 436/436 variables, and 564 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30013 ms.
Refiners :[Domain max(s): 231/231 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 230/230 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/230 variables, 96/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/231 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 6 (OVERLAPS) 205/436 variables, 231/564 constraints. Problems are: Problem set: 0 solved, 204 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 204/768 constraints. Problems are: Problem set: 0 solved, 204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 768 constraints, problems are : Problem set: 0 solved, 204 unsolved in 30012 ms.
Refiners :[Domain max(s): 231/231 constraints, Generalized P Invariants (flows): 102/102 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 204/204 constraints, Known Traps: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 204 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in SI_LTL mode, iteration 1 : 231/238 places, 205/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62287 ms. Remains : 231/238 places, 205/206 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-14
Product exploration explored 100000 steps with 2926 reset in 432 ms.
Product exploration explored 100000 steps with 2957 reset in 492 ms.
Computed a total of 231 stabilizing places and 205 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 231 transition count 205
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 39 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r03-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r03-LTLFireability-14 finished in 63502 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(X((!p0&&X((F(p1)||G(!p0)))))))'
Support contains 7 out of 238 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 238/238 places, 206/206 transitions.
Applied a total of 0 rules in 3 ms. Remains 238 /238 variables (removed 0) and now considering 206/206 (removed 0) transitions.
// Phase 1: matrix 206 rows 238 cols
[2024-06-01 01:21:15] [INFO ] Computed 108 invariants in 16 ms
[2024-06-01 01:21:16] [INFO ] Implicit Places using invariants in 942 ms returned []
[2024-06-01 01:21:16] [INFO ] Invariant cache hit.
[2024-06-01 01:21:17] [INFO ] Implicit Places using invariants and state equation in 853 ms returned []
Implicit Place search using SMT with State Equation took 1806 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-06-01 01:21:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 584 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30022 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 237/237 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 31/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (OVERLAPS) 1/238 variables, 77/345 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/444 variables, 238/584 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 205/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 789 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30011 ms.
Refiners :[Domain max(s): 238/238 constraints, Generalized P Invariants (flows): 108/108 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 0/0 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in LTL mode , in 1 iterations and 61930 ms. Remains : 238/238 places, 206/206 transitions.
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p1), p0, (AND (NOT p1) p0), p0, p0]
Running random walk in product with property : Echo-PT-d03r03-LTLFireability-15
Stuttering criterion allowed to conclude after 302 steps with 5 reset in 2 ms.
FORMULA Echo-PT-d03r03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r03-LTLFireability-15 finished in 62227 ms.
All properties solved by simple procedures.
Total runtime 578941 ms.
ITS solved all properties within timeout

BK_STOP 1717204938467

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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="Echo-PT-d03r03"
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 Echo-PT-d03r03, 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 r492-smll-171636266200108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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