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.r540-smll-171690573500036.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 TCPcondis-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r540-smll-171690573500036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 02:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 02:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 02:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 12 02:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rwxr-xr-x 1 mcc users 24K May 18 16:43 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 TCPcondis-PT-25-LTLFireability-00
FORMULA_NAME TCPcondis-PT-25-LTLFireability-01
FORMULA_NAME TCPcondis-PT-25-LTLFireability-02
FORMULA_NAME TCPcondis-PT-25-LTLFireability-03
FORMULA_NAME TCPcondis-PT-25-LTLFireability-04
FORMULA_NAME TCPcondis-PT-25-LTLFireability-05
FORMULA_NAME TCPcondis-PT-25-LTLFireability-06
FORMULA_NAME TCPcondis-PT-25-LTLFireability-07
FORMULA_NAME TCPcondis-PT-25-LTLFireability-08
FORMULA_NAME TCPcondis-PT-25-LTLFireability-09
FORMULA_NAME TCPcondis-PT-25-LTLFireability-10
FORMULA_NAME TCPcondis-PT-25-LTLFireability-11
FORMULA_NAME TCPcondis-PT-25-LTLFireability-12
FORMULA_NAME TCPcondis-PT-25-LTLFireability-13
FORMULA_NAME TCPcondis-PT-25-LTLFireability-14
FORMULA_NAME TCPcondis-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717229477758

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-25
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:11:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:11:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:11:20] [WARNING] Skipping unknown tool specific annotation : Tina
[2024-06-01 08:11:20] [WARNING] Unknown XML tag in source file: size
[2024-06-01 08:11:20] [WARNING] Unknown XML tag in source file: color
[2024-06-01 08:11:20] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 08:11:21] [INFO ] Transformed 30 places.
[2024-06-01 08:11:21] [INFO ] Transformed 32 transitions.
[2024-06-01 08:11:21] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TCPcondis-PT-25-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 20 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-06-01 08:11:21] [INFO ] Computed 9 invariants in 21 ms
[2024-06-01 08:11:21] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-06-01 08:11:21] [INFO ] Invariant cache hit.
[2024-06-01 08:11:21] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 08:11:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 1113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 2005ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 2026ms
Finished structural reductions in LTL mode , in 1 iterations and 2590 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 19 out of 30 places after structural reductions.
[2024-06-01 08:11:24] [INFO ] Flatten gal took : 45 ms
[2024-06-01 08:11:24] [INFO ] Flatten gal took : 17 ms
[2024-06-01 08:11:24] [INFO ] Input system was already deterministic with 32 transitions.
RANDOM walk for 8644 steps (1 resets) in 221 ms. (38 steps per ms) remains 0/18 properties
FORMULA TCPcondis-PT-25-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 26 transition count 27
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 9 place count 26 transition count 26
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 25 transition count 26
Applied a total of 11 rules in 52 ms. Remains 25 /30 variables (removed 5) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 25 cols
[2024-06-01 08:11:25] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 08:11:25] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 08:11:25] [INFO ] Invariant cache hit.
[2024-06-01 08:11:25] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-01 08:11:25] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 08:11:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 26/51 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 26/51 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 510 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 982ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 983ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1208 ms. Remains : 25/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-00
Product exploration explored 100000 steps with 1614 reset in 655 ms.
Product exploration explored 100000 steps with 1619 reset in 367 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 364 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 3618 steps (0 resets) in 22 ms. (157 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 501 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 26/26 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 26/26 (removed 0) transitions.
[2024-06-01 08:11:28] [INFO ] Invariant cache hit.
[2024-06-01 08:11:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-01 08:11:28] [INFO ] Invariant cache hit.
[2024-06-01 08:11:28] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-01 08:11:28] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 08:11:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 26/51 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 0/51 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 26/51 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/51 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 533 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1026ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1205 ms. Remains : 25/25 places, 26/26 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 341 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 3030 steps (0 resets) in 18 ms. (159 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 6 factoid took 481 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1607 reset in 322 ms.
Stack based approach found an accepted trace after 36681 steps with 609 reset with depth 20 and stack size 20 in 122 ms.
FORMULA TCPcondis-PT-25-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-00 finished in 6449 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)))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 10 place count 26 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 9 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-06-01 08:11:31] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 08:11:31] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-06-01 08:11:31] [INFO ] Invariant cache hit.
[2024-06-01 08:11:31] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-06-01 08:11:31] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 08:11:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 494 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 972ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 973ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1131 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-01
Product exploration explored 100000 steps with 10 reset in 514 ms.
Product exploration explored 100000 steps with 9 reset in 424 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 182 steps (0 resets) in 4 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-06-01 08:11:34] [INFO ] Invariant cache hit.
[2024-06-01 08:11:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 08:11:34] [INFO ] Invariant cache hit.
[2024-06-01 08:11:34] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-06-01 08:11:34] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 08:11:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 528 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 502 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 1043ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 1045ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1189 ms. Remains : 25/25 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 182 steps (0 resets) in 4 ms. (36 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 10 reset in 355 ms.
Product exploration explored 100000 steps with 12 reset in 310 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2024-06-01 08:11:36] [INFO ] Invariant cache hit.
[2024-06-01 08:11:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 08:11:36] [INFO ] Invariant cache hit.
[2024-06-01 08:11:36] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-06-01 08:11:36] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 08:11:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 936ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 938ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1062 ms. Remains : 25/25 places, 25/25 transitions.
Treatment of property TCPcondis-PT-25-LTLFireability-01 finished in 6478 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)||G(F(p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 16 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2024-06-01 08:11:37] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 08:11:38] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-01 08:11:38] [INFO ] Invariant cache hit.
[2024-06-01 08:11:38] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-06-01 08:11:38] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 08:11:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 24/47 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 24/47 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 787ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 788ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 955 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-02
Product exploration explored 100000 steps with 6124 reset in 324 ms.
Stack based approach found an accepted trace after 26424 steps with 1514 reset with depth 16 and stack size 16 in 106 ms.
FORMULA TCPcondis-PT-25-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-02 finished in 1512 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)))'
Support contains 2 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 9 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
[2024-06-01 08:11:39] [INFO ] Invariant cache hit.
[2024-06-01 08:11:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 08:11:39] [INFO ] Invariant cache hit.
[2024-06-01 08:11:39] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-06-01 08:11:39] [INFO ] Redundant transitions in 1 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 08:11:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 24/47 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 24/47 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 865ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 866ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1006 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-04
Product exploration explored 100000 steps with 10848 reset in 217 ms.
Stack based approach found an accepted trace after 13435 steps with 1431 reset with depth 12 and stack size 12 in 49 ms.
FORMULA TCPcondis-PT-25-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-04 finished in 1388 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) U (X(p1) U !p0))) U X(p2)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-06-01 08:11:40] [INFO ] Computed 9 invariants in 6 ms
[2024-06-01 08:11:40] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 08:11:40] [INFO ] Invariant cache hit.
[2024-06-01 08:11:41] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 08:11:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 774 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 414 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1203ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1204ms
Finished structural reductions in LTL mode , in 1 iterations and 1382 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 257 ms :[(NOT p2), (OR (NOT p1) p0), (OR (NOT p1) (NOT p2) p0), (NOT p2), true]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 18 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-25-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-25-LTLFireability-07 finished in 2204 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(p0)&&F(p1)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 08:11:43] [INFO ] Invariant cache hit.
[2024-06-01 08:11:43] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 08:11:43] [INFO ] Invariant cache hit.
[2024-06-01 08:11:43] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 08:11:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 792 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1453ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1454ms
Finished structural reductions in LTL mode , in 1 iterations and 1561 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 97 ms.
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X p0), (X (X p1))]
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 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TCPcondis-PT-25-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TCPcondis-PT-25-LTLFireability-08 finished in 2155 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(((!p1 U p2)&&X(G(!p3))&&p0))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 08:11:45] [INFO ] Invariant cache hit.
[2024-06-01 08:11:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 08:11:45] [INFO ] Invariant cache hit.
[2024-06-01 08:11:45] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 08:11:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1479ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1482ms
Finished structural reductions in LTL mode , in 1 iterations and 1606 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) (NOT p2) p3), (OR (NOT p0) (NOT p2) p3), true, (NOT p2), p3]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-09 finished in 1922 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(((!p0 U (p1||G(!p0))) U (!p2&&(!p0 U (p1||G(!p0)))))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 08:11:47] [INFO ] Invariant cache hit.
[2024-06-01 08:11:47] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 08:11:47] [INFO ] Invariant cache hit.
[2024-06-01 08:11:47] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 08:11:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 743 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1466ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1467ms
Finished structural reductions in LTL mode , in 1 iterations and 1620 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) p0), (OR p2 (AND p0 (NOT p1))), true, (OR p2 (AND p0 (NOT p1)))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-11
Entered a terminal (fully accepting) state of product in 419 steps with 39 reset in 3 ms.
FORMULA TCPcondis-PT-25-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-11 finished in 1837 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||G(F((G(!p1)||(!p1&&F(!p2)))))))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 12 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2024-06-01 08:11:48] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 08:11:49] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 08:11:49] [INFO ] Invariant cache hit.
[2024-06-01 08:11:49] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-06-01 08:11:49] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2024-06-01 08:11:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
After SMT, in 791ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 792ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0) p2)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-12
Product exploration explored 100000 steps with 1233 reset in 356 ms.
Stack based approach found an accepted trace after 83326 steps with 1042 reset with depth 75 and stack size 75 in 278 ms.
FORMULA TCPcondis-PT-25-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-12 finished in 1865 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)) U (p0&&X(X(F(p1))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2024-06-01 08:11:50] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 08:11:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-01 08:11:50] [INFO ] Invariant cache hit.
[2024-06-01 08:11:50] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2024-06-01 08:11:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
After SMT, in 1282ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1283ms
Finished structural reductions in LTL mode , in 1 iterations and 1374 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-15
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-15 finished in 1616 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)))'
[2024-06-01 08:11:52] [INFO ] Flatten gal took : 9 ms
[2024-06-01 08:11:52] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 08:11:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 8 ms.
Total runtime 32218 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA TCPcondis-PT-25-LTLFireability-01 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717229580753

--------------------
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
mcc2024
ltl formula name TCPcondis-PT-25-LTLFireability-01
ltl formula formula --ltl=/tmp/1096/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 30 places, 32 transitions and 108 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1096/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 32 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 31, there are 35 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~304 levels ~10000 states ~27456 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~20000 states ~53676 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~40000 states ~106588 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~80000 states ~225800 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~160000 states ~478136 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~320000 states ~1044632 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~640000 states ~2095172 transitions
pnml2lts-mc( 3/ 4): ~327 levels ~1280000 states ~3879736 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~2560000 states ~9472396 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~5120000 states ~19955636 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~10240000 states ~42330424 transitions
pnml2lts-mc( 1/ 4): ~304 levels ~20480000 states ~88447564 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33549564
pnml2lts-mc( 0/ 4): unique states count: 33550721
pnml2lts-mc( 0/ 4): unique transitions count: 153767073
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 120224087
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33556476
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1308
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33556476 states 153807793 transitions, fanout: 4.584
pnml2lts-mc( 0/ 4): Total exploration time 67.120 sec (67.100 sec minimum, 67.107 sec on average)
pnml2lts-mc( 0/ 4): States per second: 499947, Transitions per second: 2291534
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 305.9MB, 9.6 B/state, compr.: 7.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/78.0%
pnml2lts-mc( 0/ 4): Stored 32 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 305.9MB (~256.0MB paged-in)

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="TCPcondis-PT-25"
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 TCPcondis-PT-25, 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 r540-smll-171690573500036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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