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.r180-tall-171640604100724.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 itstools
Input is HealthRecord-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604100724
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 20:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 20:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 20:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 20:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716519381139

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 02:56:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 02:56:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:56:22] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2024-05-24 02:56:22] [INFO ] Transformed 123 places.
[2024-05-24 02:56:22] [INFO ] Transformed 239 transitions.
[2024-05-24 02:56:22] [INFO ] Found NUPN structural information;
[2024-05-24 02:56:22] [INFO ] Parsed PT model containing 123 places and 239 transitions and 617 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 8 transitions
Reduce redundant transitions removed 8 transitions.
FORMULA HealthRecord-PT-04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-04-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 231/231 transitions.
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 52 place count 71 transition count 133
Iterating global reduction 0 with 52 rules applied. Total rules applied 104 place count 71 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 107 place count 68 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 110 place count 68 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 111 place count 68 transition count 126
Applied a total of 111 rules in 26 ms. Remains 68 /123 variables (removed 55) and now considering 126/231 (removed 105) transitions.
[2024-05-24 02:56:22] [INFO ] Flow matrix only has 124 transitions (discarded 2 similar events)
// Phase 1: matrix 124 rows 68 cols
[2024-05-24 02:56:22] [INFO ] Computed 8 invariants in 10 ms
[2024-05-24 02:56:22] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-24 02:56:22] [INFO ] Flow matrix only has 124 transitions (discarded 2 similar events)
[2024-05-24 02:56:22] [INFO ] Invariant cache hit.
[2024-05-24 02:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:22] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 125 sub problems to find dead transitions.
[2024-05-24 02:56:22] [INFO ] Flow matrix only has 124 transitions (discarded 2 similar events)
[2024-05-24 02:56:22] [INFO ] Invariant cache hit.
[2024-05-24 02:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 8 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 2 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:56:23] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 5 (OVERLAPS) 123/191 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:56:24] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 90 constraints, problems are : Problem set: 0 solved, 125 unsolved in 3714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 13/21 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 02:56:27] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-24 02:56:27] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-24 02:56:27] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 125 unsolved
[2024-05-24 02:56:27] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 7 (OVERLAPS) 123/191 variables, 68/93 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 125/218 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 10 (OVERLAPS) 1/192 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 12 (OVERLAPS) 0/192 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 125 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 219 constraints, problems are : Problem set: 0 solved, 125 unsolved in 5146 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 17/17 constraints]
After SMT, in 8950ms problems are : Problem set: 0 solved, 125 unsolved
Search for dead transitions found 0 dead transitions in 8964ms
Starting structural reductions in LTL mode, iteration 1 : 68/123 places, 126/231 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9307 ms. Remains : 68/123 places, 126/231 transitions.
Support contains 29 out of 68 places after structural reductions.
[2024-05-24 02:56:32] [INFO ] Flatten gal took : 30 ms
[2024-05-24 02:56:32] [INFO ] Flatten gal took : 12 ms
[2024-05-24 02:56:32] [INFO ] Input system was already deterministic with 126 transitions.
RANDOM walk for 40000 steps (3120 resets) in 1889 ms. (21 steps per ms) remains 9/24 properties
BEST_FIRST walk for 40004 steps (448 resets) in 124 ms. (320 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (444 resets) in 137 ms. (289 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (446 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (449 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (444 resets) in 93 ms. (425 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (462 resets) in 90 ms. (439 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (437 resets) in 67 ms. (588 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (455 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (445 resets) in 78 ms. (506 steps per ms) remains 9/9 properties
[2024-05-24 02:56:33] [INFO ] Flow matrix only has 124 transitions (discarded 2 similar events)
[2024-05-24 02:56:33] [INFO ] Invariant cache hit.
[2024-05-24 02:56:33] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp19 is UNSAT
At refinement iteration 1 (OVERLAPS) 33/45 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 23/68 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:56:33] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:56:33] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-24 02:56:33] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 123/191 variables, 68/79 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 1/192 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 80 constraints, problems are : Problem set: 1 solved, 8 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 35/45 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:56:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 23/68 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 123/191 variables, 68/80 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 8/88 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-24 02:56:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 1/89 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/192 variables, 1/90 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/192 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 90 constraints, problems are : Problem set: 1 solved, 8 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 68/68 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 748ms problems are : Problem set: 1 solved, 8 unsolved
Parikh walk visited 7 properties in 81 ms.
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 80 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 232 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 63 transition count 113
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 61 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 61 transition count 111
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 60 transition count 111
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 25 place count 44 transition count 78
Iterating global reduction 2 with 16 rules applied. Total rules applied 41 place count 44 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 44 transition count 77
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 48 place count 38 transition count 65
Iterating global reduction 3 with 6 rules applied. Total rules applied 54 place count 38 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 57 place count 38 transition count 62
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 59 place count 36 transition count 56
Iterating global reduction 4 with 2 rules applied. Total rules applied 61 place count 36 transition count 56
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 34 transition count 52
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 34 transition count 52
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 67 place count 34 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 33 transition count 49
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 79 place count 28 transition count 72
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 80 place count 28 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 81 place count 27 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 83 place count 27 transition count 127
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 87 place count 25 transition count 125
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 88 place count 24 transition count 94
Iterating global reduction 7 with 1 rules applied. Total rules applied 89 place count 24 transition count 94
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 90 place count 23 transition count 92
Iterating global reduction 7 with 1 rules applied. Total rules applied 91 place count 23 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 95 place count 23 transition count 88
Applied a total of 95 rules in 41 ms. Remains 23 /68 variables (removed 45) and now considering 88/126 (removed 38) transitions.
Running 72 sub problems to find dead transitions.
[2024-05-24 02:56:33] [INFO ] Flow matrix only has 68 transitions (discarded 20 similar events)
// Phase 1: matrix 68 rows 23 cols
[2024-05-24 02:56:33] [INFO ] Computed 7 invariants in 4 ms
[2024-05-24 02:56:33] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 2/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
Problem TDEAD31 is UNSAT
At refinement iteration 4 (OVERLAPS) 68/91 variables, 23/30 constraints. Problems are: Problem set: 1 solved, 71 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 12/42 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 42 constraints, problems are : Problem set: 3 solved, 69 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 2/22 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 3 (OVERLAPS) 1/23 variables, 6/7 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 68/91 variables, 23/30 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 12/42 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 69/111 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 69 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/111 constraints. Problems are: Problem set: 3 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 111 constraints, problems are : Problem set: 3 solved, 69 unsolved in 1069 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 69/72 constraints, Known Traps: 0/0 constraints]
After SMT, in 1755ms problems are : Problem set: 3 solved, 69 unsolved
Search for dead transitions found 3 dead transitions in 1756ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 3 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 23/68 places, 85/126 transitions.
Graph (complete) has 84 edges and 23 vertex of which 22 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 22 transition count 78
Applied a total of 8 rules in 14 ms. Remains 22 /23 variables (removed 1) and now considering 78/85 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1813 ms. Remains : 22/68 places, 78/126 transitions.
RANDOM walk for 1732 steps (271 resets) in 34 ms. (49 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 6 stabilizing places and 10 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((F(p1)&&p0)))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 75 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 49 transition count 92
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 49 transition count 92
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 33 place count 49 transition count 90
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 44 transition count 80
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 44 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 46 place count 44 transition count 77
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 43 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 43 transition count 74
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 42 transition count 72
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 42 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 42 transition count 71
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 63 place count 36 transition count 98
Applied a total of 63 rules in 24 ms. Remains 36 /68 variables (removed 32) and now considering 98/126 (removed 28) transitions.
[2024-05-24 02:56:36] [INFO ] Flow matrix only has 85 transitions (discarded 13 similar events)
// Phase 1: matrix 85 rows 36 cols
[2024-05-24 02:56:36] [INFO ] Computed 7 invariants in 7 ms
[2024-05-24 02:56:36] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 02:56:36] [INFO ] Flow matrix only has 85 transitions (discarded 13 similar events)
[2024-05-24 02:56:36] [INFO ] Invariant cache hit.
[2024-05-24 02:56:36] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 02:56:36] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-24 02:56:36] [INFO ] Redundant transitions in 2 ms returned []
Running 82 sub problems to find dead transitions.
[2024-05-24 02:56:36] [INFO ] Flow matrix only has 85 transitions (discarded 13 similar events)
[2024-05-24 02:56:36] [INFO ] Invariant cache hit.
[2024-05-24 02:56:36] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:56:36] [INFO ] Deduced a trap composed of 8 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:56:36] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:56:36] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:56:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:56:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:56:36] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 84/120 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/121 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 64 constraints, problems are : Problem set: 0 solved, 82 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 82 unsolved
[2024-05-24 02:56:37] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:56:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:56:37] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 84/120 variables, 36/52 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 82/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 149 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2356 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 9/9 constraints]
After SMT, in 3828ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 3829ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/68 places, 98/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3952 ms. Remains : 36/68 places, 98/126 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-04-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-00 finished in 4236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 79 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 47 transition count 88
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 47 transition count 88
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 37 place count 47 transition count 86
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 41 transition count 74
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 41 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 41 transition count 71
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 39 transition count 65
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 39 transition count 65
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 37 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 37 transition count 61
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 37 transition count 59
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 74 place count 31 transition count 84
Applied a total of 74 rules in 17 ms. Remains 31 /68 variables (removed 37) and now considering 84/126 (removed 42) transitions.
[2024-05-24 02:56:40] [INFO ] Flow matrix only has 70 transitions (discarded 14 similar events)
// Phase 1: matrix 70 rows 31 cols
[2024-05-24 02:56:40] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:56:40] [INFO ] Flow matrix only has 70 transitions (discarded 14 similar events)
[2024-05-24 02:56:40] [INFO ] Invariant cache hit.
[2024-05-24 02:56:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-24 02:56:40] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-24 02:56:40] [INFO ] Redundant transitions in 2 ms returned []
Running 68 sub problems to find dead transitions.
[2024-05-24 02:56:40] [INFO ] Flow matrix only has 70 transitions (discarded 14 similar events)
[2024-05-24 02:56:40] [INFO ] Invariant cache hit.
[2024-05-24 02:56:40] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 02:56:40] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 2 ms to minimize.
[2024-05-24 02:56:40] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:56:40] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-24 02:56:40] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 9 ms to minimize.
[2024-05-24 02:56:40] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 69/100 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (OVERLAPS) 1/101 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 0/101 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/101 variables, and 55 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 02:56:41] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 69/100 variables, 31/44 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 68/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 1/101 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (OVERLAPS) 0/101 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/101 variables, and 124 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 31/31 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 6/6 constraints]
After SMT, in 3054ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 3056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/68 places, 84/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3153 ms. Remains : 31/68 places, 84/126 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-01 finished in 3219 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(p1))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 78 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 46 transition count 87
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 46 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 37 place count 46 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 41 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 41 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 41 transition count 72
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 40 transition count 69
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 40 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 39 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 39 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 39 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 38 transition count 72
Applied a total of 57 rules in 18 ms. Remains 38 /68 variables (removed 30) and now considering 72/126 (removed 54) transitions.
[2024-05-24 02:56:43] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
// Phase 1: matrix 68 rows 38 cols
[2024-05-24 02:56:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 02:56:43] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-05-24 02:56:43] [INFO ] Invariant cache hit.
[2024-05-24 02:56:43] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 02:56:43] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 02:56:43] [INFO ] Redundant transitions in 1 ms returned []
Running 58 sub problems to find dead transitions.
[2024-05-24 02:56:43] [INFO ] Flow matrix only has 68 transitions (discarded 4 similar events)
[2024-05-24 02:56:43] [INFO ] Invariant cache hit.
[2024-05-24 02:56:43] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 02:56:43] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:56:43] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:56:43] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-24 02:56:43] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:56:43] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:56:44] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 67/105 variables, 38/51 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 58 constraints, problems are : Problem set: 0 solved, 58 unsolved in 833 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/38 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
[2024-05-24 02:56:45] [INFO ] Deduced a trap composed of 7 places in 512 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 67/105 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 58/117 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 117 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1330 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 38/38 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 7/7 constraints]
After SMT, in 2181ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2182ms
Starting structural reductions in SI_LTL mode, iteration 1 : 38/68 places, 72/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2291 ms. Remains : 38/68 places, 72/126 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-02 finished in 2346 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(F((G((p1||X(p2)))&&p0))))'
Support contains 4 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 53 transition count 96
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 53 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 53 transition count 95
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 35 place count 49 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 39 place count 49 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 41 place count 49 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 48 transition count 82
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 48 transition count 82
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 47 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 47 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 47 transition count 79
Applied a total of 46 rules in 5 ms. Remains 47 /68 variables (removed 21) and now considering 79/126 (removed 47) transitions.
[2024-05-24 02:56:45] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
// Phase 1: matrix 78 rows 47 cols
[2024-05-24 02:56:45] [INFO ] Computed 7 invariants in 3 ms
[2024-05-24 02:56:45] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 02:56:45] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:56:45] [INFO ] Invariant cache hit.
[2024-05-24 02:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:45] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2024-05-24 02:56:45] [INFO ] Flow matrix only has 78 transitions (discarded 1 similar events)
[2024-05-24 02:56:45] [INFO ] Invariant cache hit.
[2024-05-24 02:56:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:56:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:56:46] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 77/124 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 57 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-05-24 02:56:47] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:56:47] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 77/124 variables, 47/58 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 137 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1738 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 4/4 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 2930ms
Starting structural reductions in LTL mode, iteration 1 : 47/68 places, 79/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3024 ms. Remains : 47/68 places, 79/126 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-04
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-04 finished in 3245 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 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 80 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 46 transition count 86
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 46 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 37 place count 46 transition count 84
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 40 transition count 72
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 40 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 40 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 38 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 38 transition count 63
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 36 transition count 59
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 36 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 36 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 64 place count 35 transition count 61
Applied a total of 64 rules in 25 ms. Remains 35 /68 variables (removed 33) and now considering 61/126 (removed 65) transitions.
[2024-05-24 02:56:49] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
// Phase 1: matrix 56 rows 35 cols
[2024-05-24 02:56:49] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 02:56:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 02:56:49] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:56:49] [INFO ] Invariant cache hit.
[2024-05-24 02:56:49] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:56:49] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-24 02:56:49] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-24 02:56:49] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:56:49] [INFO ] Invariant cache hit.
[2024-05-24 02:56:49] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:56:49] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:56:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-24 02:56:49] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 5/35 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 55/90 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/91 variables, and 51 constraints, problems are : Problem set: 0 solved, 47 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:56:50] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:56:50] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 5/35 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 55/90 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 47/100 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/91 variables, and 100 constraints, problems are : Problem set: 0 solved, 47 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
After SMT, in 1487ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1488ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/68 places, 61/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1595 ms. Remains : 35/68 places, 61/126 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-05
Product exploration explored 100000 steps with 19 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 114 ms.
Computed a total of 9 stabilizing places and 12 stable transitions
Computed a total of 9 stabilizing places and 12 stable transitions
Detected a total of 9/35 stabilizing places and 12/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4150 resets) in 223 ms. (178 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (538 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13518 steps, run visited all 1 properties in 28 ms. (steps per millisecond=482 )
Probabilistic random walk after 13518 steps, saw 2696 distinct states, run finished after 31 ms. (steps per millisecond=436 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 105 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 35 /35 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-05-24 02:56:51] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:56:51] [INFO ] Invariant cache hit.
[2024-05-24 02:56:51] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:56:51] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:56:51] [INFO ] Invariant cache hit.
[2024-05-24 02:56:51] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:56:51] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-24 02:56:51] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-24 02:56:51] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:56:51] [INFO ] Invariant cache hit.
[2024-05-24 02:56:51] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:56:51] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:56:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-24 02:56:52] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 5/35 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 55/90 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/91 variables, and 51 constraints, problems are : Problem set: 0 solved, 47 unsolved in 623 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 2/30 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:56:52] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 5 ms to minimize.
[2024-05-24 02:56:52] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 5/35 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 55/90 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 47/100 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/91 variables, and 100 constraints, problems are : Problem set: 0 solved, 47 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
After SMT, in 1425ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1426ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1508 ms. Remains : 35/35 places, 61/61 transitions.
Computed a total of 9 stabilizing places and 12 stable transitions
Computed a total of 9 stabilizing places and 12 stable transitions
Detected a total of 9/35 stabilizing places and 12/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 92 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4159 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (555 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13518 steps, run visited all 1 properties in 18 ms. (steps per millisecond=751 )
Probabilistic random walk after 13518 steps, saw 2696 distinct states, run finished after 18 ms. (steps per millisecond=751 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 116 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 138 ms.
Product exploration explored 100000 steps with 8 reset in 75 ms.
Built C files in :
/tmp/ltsmin15441706429626181896
[2024-05-24 02:56:54] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-24 02:56:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:56:54] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-24 02:56:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:56:54] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-24 02:56:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:56:54] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15441706429626181896
Running compilation step : cd /tmp/ltsmin15441706429626181896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 473 ms.
Running link step : cd /tmp/ltsmin15441706429626181896;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15441706429626181896;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1727016802133488523.hoa' '--buchi-type=spotba'
LTSmin run took 245 ms.
FORMULA HealthRecord-PT-04-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLFireability-05 finished in 5804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 52 transition count 94
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 52 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 52 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 46 transition count 81
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 46 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 46 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 44 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 44 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 42 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 42 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 42 transition count 66
Applied a total of 58 rules in 9 ms. Remains 42 /68 variables (removed 26) and now considering 66/126 (removed 60) transitions.
[2024-05-24 02:56:54] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
// Phase 1: matrix 65 rows 42 cols
[2024-05-24 02:56:54] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:56:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:56:54] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:56:54] [INFO ] Invariant cache hit.
[2024-05-24 02:56:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-24 02:56:55] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:56:55] [INFO ] Invariant cache hit.
[2024-05-24 02:56:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:56:55] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:56:55] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-24 02:56:55] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 64/106 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 53 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:56:56] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:56:56] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 64/106 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 65/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 120 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1307 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 5/5 constraints]
After SMT, in 2338ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2339ms
Starting structural reductions in LTL mode, iteration 1 : 42/68 places, 66/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2430 ms. Remains : 42/68 places, 66/126 transitions.
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-06
Product exploration explored 100000 steps with 4 reset in 49 ms.
Product exploration explored 100000 steps with 12 reset in 44 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 306 steps (23 resets) in 5 ms. (51 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 42/42 places, 66/66 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-24 02:56:58] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:56:58] [INFO ] Invariant cache hit.
[2024-05-24 02:56:58] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:56:58] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:56:58] [INFO ] Invariant cache hit.
[2024-05-24 02:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:56:58] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-24 02:56:58] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:56:58] [INFO ] Invariant cache hit.
[2024-05-24 02:56:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:56:58] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:56:58] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:56:58] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 64/106 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 53 constraints, problems are : Problem set: 0 solved, 65 unsolved in 976 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:56:59] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:56:59] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 64/106 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 65/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 120 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1463 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 5/5 constraints]
After SMT, in 2457ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2458ms
Finished structural reductions in LTL mode , in 1 iterations and 2546 ms. Remains : 42/42 places, 66/66 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 628 steps (44 resets) in 6 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8 reset in 46 ms.
Entered a terminal (fully accepting) state of product in 26 steps with 1 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-06 finished in 6950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 79 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 46 transition count 87
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 46 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 37 place count 46 transition count 85
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 41 transition count 75
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 41 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 49 place count 41 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 39 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 39 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 37 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 37 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 37 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 36 transition count 66
Applied a total of 61 rules in 16 ms. Remains 36 /68 variables (removed 32) and now considering 66/126 (removed 60) transitions.
[2024-05-24 02:57:01] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
// Phase 1: matrix 62 rows 36 cols
[2024-05-24 02:57:01] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:57:01] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 02:57:01] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2024-05-24 02:57:01] [INFO ] Invariant cache hit.
[2024-05-24 02:57:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 02:57:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-24 02:57:01] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-05-24 02:57:01] [INFO ] Flow matrix only has 62 transitions (discarded 4 similar events)
[2024-05-24 02:57:01] [INFO ] Invariant cache hit.
[2024-05-24 02:57:01] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-24 02:57:02] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 61/97 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/97 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/98 variables, and 54 constraints, problems are : Problem set: 0 solved, 52 unsolved in 683 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 61/97 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 52/106 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/98 variables, and 106 constraints, problems are : Problem set: 0 solved, 52 unsolved in 648 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 5/5 constraints]
After SMT, in 1346ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 1347ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/68 places, 66/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1449 ms. Remains : 36/68 places, 66/126 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-07 finished in 1508 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 51 transition count 92
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 51 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 51 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 45 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 45 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 50 place count 45 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 43 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 43 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 41 transition count 66
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 41 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 60 place count 41 transition count 64
Applied a total of 60 rules in 7 ms. Remains 41 /68 variables (removed 27) and now considering 64/126 (removed 62) transitions.
[2024-05-24 02:57:03] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
// Phase 1: matrix 63 rows 41 cols
[2024-05-24 02:57:03] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:57:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 02:57:03] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-05-24 02:57:03] [INFO ] Invariant cache hit.
[2024-05-24 02:57:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:57:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-24 02:57:03] [INFO ] Flow matrix only has 63 transitions (discarded 1 similar events)
[2024-05-24 02:57:03] [INFO ] Invariant cache hit.
[2024-05-24 02:57:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:57:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:57:03] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:57:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (OVERLAPS) 62/103 variables, 41/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 1/104 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 52 constraints, problems are : Problem set: 0 solved, 63 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/41 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:57:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
[2024-05-24 02:57:04] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 62/103 variables, 41/53 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 63/116 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 117 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1379 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 41/41 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints]
After SMT, in 2339ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 2340ms
Starting structural reductions in LTL mode, iteration 1 : 41/68 places, 64/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2433 ms. Remains : 41/68 places, 64/126 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-08
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-08 finished in 2581 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((X(p0)&&(p1||X(X(p0))||G(p2))))))'
Support contains 1 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 53 transition count 96
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 53 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 53 transition count 95
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 48 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 48 transition count 85
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 48 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 47 transition count 80
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 47 transition count 80
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 46 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 46 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 46 transition count 77
Applied a total of 48 rules in 6 ms. Remains 46 /68 variables (removed 22) and now considering 77/126 (removed 49) transitions.
[2024-05-24 02:57:05] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
// Phase 1: matrix 76 rows 46 cols
[2024-05-24 02:57:05] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:57:06] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 02:57:06] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2024-05-24 02:57:06] [INFO ] Invariant cache hit.
[2024-05-24 02:57:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:57:06] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2024-05-24 02:57:06] [INFO ] Flow matrix only has 76 transitions (discarded 1 similar events)
[2024-05-24 02:57:06] [INFO ] Invariant cache hit.
[2024-05-24 02:57:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:57:06] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-24 02:57:06] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 75/121 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 56 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1195 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:57:07] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 75/121 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 76/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 133 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1618 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
After SMT, in 2829ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 2830ms
Starting structural reductions in LTL mode, iteration 1 : 46/68 places, 77/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2918 ms. Remains : 46/68 places, 77/126 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-09 finished in 3061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 77 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 47 transition count 90
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 47 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 35 place count 47 transition count 88
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 42 transition count 78
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 42 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 47 place count 42 transition count 76
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 40 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 40 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 38 transition count 66
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 38 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 38 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 37 transition count 70
Applied a total of 59 rules in 11 ms. Remains 37 /68 variables (removed 31) and now considering 70/126 (removed 56) transitions.
[2024-05-24 02:57:09] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
// Phase 1: matrix 66 rows 37 cols
[2024-05-24 02:57:09] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:57:09] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:57:09] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-24 02:57:09] [INFO ] Invariant cache hit.
[2024-05-24 02:57:09] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 02:57:09] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-24 02:57:09] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 02:57:09] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-24 02:57:09] [INFO ] Invariant cache hit.
[2024-05-24 02:57:09] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 02:57:09] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:57:09] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-24 02:57:09] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 65/102 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/103 variables, and 54 constraints, problems are : Problem set: 0 solved, 56 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 65/102 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 56/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/103 variables, and 110 constraints, problems are : Problem set: 0 solved, 56 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
After SMT, in 1298ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/68 places, 70/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1395 ms. Remains : 37/68 places, 70/126 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-10
Product exploration explored 100000 steps with 4 reset in 91 ms.
Product exploration explored 100000 steps with 1 reset in 92 ms.
Computed a total of 8 stabilizing places and 14 stable transitions
Computed a total of 8 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 1525 steps (159 resets) in 8 ms. (169 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 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 70/70 transitions.
Applied a total of 0 rules in 5 ms. Remains 37 /37 variables (removed 0) and now considering 70/70 (removed 0) transitions.
[2024-05-24 02:57:11] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-24 02:57:11] [INFO ] Invariant cache hit.
[2024-05-24 02:57:11] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:57:11] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-24 02:57:11] [INFO ] Invariant cache hit.
[2024-05-24 02:57:11] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 02:57:11] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 02:57:11] [INFO ] Redundant transitions in 1 ms returned []
Running 56 sub problems to find dead transitions.
[2024-05-24 02:57:11] [INFO ] Flow matrix only has 66 transitions (discarded 4 similar events)
[2024-05-24 02:57:11] [INFO ] Invariant cache hit.
[2024-05-24 02:57:11] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-05-24 02:57:11] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:57:11] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-24 02:57:11] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 65/102 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (OVERLAPS) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/103 variables, and 54 constraints, problems are : Problem set: 0 solved, 56 unsolved in 688 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 65/102 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 56/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/103 variables, and 110 constraints, problems are : Problem set: 0 solved, 56 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 3/3 constraints]
After SMT, in 1389ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1392ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1477 ms. Remains : 37/37 places, 70/70 transitions.
Computed a total of 8 stabilizing places and 14 stable transitions
Computed a total of 8 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
RANDOM walk for 606 steps (57 resets) in 4 ms. (121 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 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 56 ms.
Product exploration explored 100000 steps with 8 reset in 156 ms.
Built C files in :
/tmp/ltsmin4533815027688673541
[2024-05-24 02:57:13] [INFO ] Computing symmetric may disable matrix : 70 transitions.
[2024-05-24 02:57:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:57:13] [INFO ] Computing symmetric may enable matrix : 70 transitions.
[2024-05-24 02:57:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:57:13] [INFO ] Computing Do-Not-Accords matrix : 70 transitions.
[2024-05-24 02:57:13] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:57:13] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4533815027688673541
Running compilation step : cd /tmp/ltsmin4533815027688673541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin4533815027688673541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin4533815027688673541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12507695080872576037.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA HealthRecord-PT-04-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLFireability-10 finished in 4503 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(F(!p0)))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 51 transition count 92
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 51 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 51 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 46 transition count 81
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 46 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 46 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 44 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 44 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 42 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 42 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 42 transition count 66
Applied a total of 58 rules in 6 ms. Remains 42 /68 variables (removed 26) and now considering 66/126 (removed 60) transitions.
[2024-05-24 02:57:13] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
// Phase 1: matrix 65 rows 42 cols
[2024-05-24 02:57:13] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:57:13] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 02:57:13] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:57:13] [INFO ] Invariant cache hit.
[2024-05-24 02:57:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:57:13] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-24 02:57:13] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:57:13] [INFO ] Invariant cache hit.
[2024-05-24 02:57:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:57:13] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:57:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 64/106 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 52 constraints, problems are : Problem set: 0 solved, 65 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:57:14] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:57:14] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 64/106 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 65/118 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 1/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 11 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1505 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 2465ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2466ms
Starting structural reductions in LTL mode, iteration 1 : 42/68 places, 66/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2549 ms. Remains : 42/68 places, 66/126 transitions.
Stuttering acceptance computed with spot in 77 ms :[p0, p0]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 206 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-04-LTLFireability-12 finished in 3043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F((!p1 U (G(!p1)||(!p1&&G(p2))))))))'
Support contains 5 out of 68 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Graph (trivial) has 69 edges and 68 vertex of which 8 / 68 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 50 transition count 94
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 50 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 50 transition count 93
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 45 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 45 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 43 place count 45 transition count 80
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 45 place count 43 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 47 place count 43 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 49 place count 41 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 51 place count 41 transition count 70
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 41 transition count 68
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 65 place count 35 transition count 93
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 35 transition count 92
Applied a total of 66 rules in 25 ms. Remains 35 /68 variables (removed 33) and now considering 92/126 (removed 34) transitions.
[2024-05-24 02:57:16] [INFO ] Flow matrix only has 78 transitions (discarded 14 similar events)
// Phase 1: matrix 78 rows 35 cols
[2024-05-24 02:57:16] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:57:16] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 02:57:16] [INFO ] Flow matrix only has 78 transitions (discarded 14 similar events)
[2024-05-24 02:57:16] [INFO ] Invariant cache hit.
[2024-05-24 02:57:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 02:57:16] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-24 02:57:16] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-24 02:57:16] [INFO ] Flow matrix only has 78 transitions (discarded 14 similar events)
[2024-05-24 02:57:16] [INFO ] Invariant cache hit.
[2024-05-24 02:57:16] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:57:16] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-24 02:57:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-24 02:57:16] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/112 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 53 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1361 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:57:18] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:57:18] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/112 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 76/130 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 131 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1940 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3342ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3344ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/68 places, 92/126 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3445 ms. Remains : 35/68 places, 92/126 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND (NOT p2) p1)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-14
Product exploration explored 100000 steps with 6 reset in 50 ms.
Product exploration explored 100000 steps with 35 reset in 157 ms.
Computed a total of 18 stabilizing places and 41 stable transitions
Computed a total of 18 stabilizing places and 41 stable transitions
Detected a total of 18/35 stabilizing places and 41/92 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
Knowledge based reduction with 11 factoid took 335 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (6409 resets) in 94 ms. (421 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1)))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 883 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Support contains 5 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 92/92 transitions.
Applied a total of 0 rules in 6 ms. Remains 35 /35 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-24 02:57:22] [INFO ] Flow matrix only has 78 transitions (discarded 14 similar events)
[2024-05-24 02:57:22] [INFO ] Invariant cache hit.
[2024-05-24 02:57:22] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 02:57:22] [INFO ] Flow matrix only has 78 transitions (discarded 14 similar events)
[2024-05-24 02:57:22] [INFO ] Invariant cache hit.
[2024-05-24 02:57:22] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-24 02:57:22] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 02:57:22] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-05-24 02:57:22] [INFO ] Flow matrix only has 78 transitions (discarded 14 similar events)
[2024-05-24 02:57:22] [INFO ] Invariant cache hit.
[2024-05-24 02:57:22] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:57:22] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:57:22] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:57:22] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 77/112 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 53 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1383 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-05-24 02:57:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:57:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 77/112 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 76/130 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 131 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1804 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 5/5 constraints]
After SMT, in 3219ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 3220ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3318 ms. Remains : 35/35 places, 92/92 transitions.
Computed a total of 18 stabilizing places and 41 stable transitions
Computed a total of 18 stabilizing places and 41 stable transitions
Detected a total of 18/35 stabilizing places and 41/92 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 11 factoid took 387 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (6415 resets) in 114 ms. (347 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40003 steps (864 resets) in 225 ms. (177 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (831 resets) in 196 ms. (203 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (879 resets) in 23 ms. (1666 steps per ms) remains 3/3 properties
[2024-05-24 02:57:26] [INFO ] Flow matrix only has 78 transitions (discarded 14 similar events)
[2024-05-24 02:57:26] [INFO ] Invariant cache hit.
[2024-05-24 02:57:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 77/112 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/113 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 50 constraints, problems are : Problem set: 0 solved, 3 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 02:57:26] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 77/112 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 7/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/113 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/113 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 54 constraints, problems are : Problem set: 0 solved, 3 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 9 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=9 )
Parikh walk visited 3 properties in 13 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p1) p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F p1)]
Knowledge based reduction with 11 factoid took 784 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) p1), (NOT p0), p1, (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 8 reset in 60 ms.
Product exploration explored 100000 steps with 9 reset in 90 ms.
Built C files in :
/tmp/ltsmin3014269017143689418
[2024-05-24 02:57:27] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2024-05-24 02:57:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:57:27] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2024-05-24 02:57:27] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:57:27] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2024-05-24 02:57:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:57:27] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3014269017143689418
Running compilation step : cd /tmp/ltsmin3014269017143689418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 254 ms.
Running link step : cd /tmp/ltsmin3014269017143689418;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin3014269017143689418;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17582236226670025898.hoa' '--buchi-type=spotba'
LTSmin run took 119 ms.
FORMULA HealthRecord-PT-04-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-04-LTLFireability-14 finished in 11776 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(F((p0&&G(F(p1))))))'
Support contains 2 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 126/126 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 52 transition count 94
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 52 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 52 transition count 93
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 47 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 47 transition count 83
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 47 transition count 81
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 47 place count 45 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 45 transition count 75
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 43 transition count 71
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 43 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 43 transition count 69
Applied a total of 55 rules in 3 ms. Remains 43 /68 variables (removed 25) and now considering 69/126 (removed 57) transitions.
[2024-05-24 02:57:28] [INFO ] Flow matrix only has 68 transitions (discarded 1 similar events)
// Phase 1: matrix 68 rows 43 cols
[2024-05-24 02:57:28] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:57:28] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 02:57:28] [INFO ] Flow matrix only has 68 transitions (discarded 1 similar events)
[2024-05-24 02:57:28] [INFO ] Invariant cache hit.
[2024-05-24 02:57:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:57:28] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 68 sub problems to find dead transitions.
[2024-05-24 02:57:28] [INFO ] Flow matrix only has 68 transitions (discarded 1 similar events)
[2024-05-24 02:57:28] [INFO ] Invariant cache hit.
[2024-05-24 02:57:28] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 02:57:28] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:57:28] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (OVERLAPS) 67/110 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (OVERLAPS) 1/111 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 02:57:29] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/111 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 54 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 68 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 02:57:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 5 (OVERLAPS) 67/110 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 68/122 constraints. Problems are: Problem set: 0 solved, 68 unsolved
[2024-05-24 02:57:30] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 9 (OVERLAPS) 1/111 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 68 unsolved
At refinement iteration 11 (OVERLAPS) 0/111 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 68 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 124 constraints, problems are : Problem set: 0 solved, 68 unsolved in 1694 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 68/68 constraints, Known Traps: 5/5 constraints]
After SMT, in 3122ms problems are : Problem set: 0 solved, 68 unsolved
Search for dead transitions found 0 dead transitions in 3124ms
Starting structural reductions in LTL mode, iteration 1 : 43/68 places, 69/126 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3205 ms. Remains : 43/68 places, 69/126 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-04-LTLFireability-15
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-04-LTLFireability-15 finished in 3544 ms.
All properties solved by simple procedures.
Total runtime 69615 ms.

BK_STOP 1716519451935

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-04, 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 r180-tall-171640604100724"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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