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-171640604000708.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-02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604000708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 20:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 20:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 20:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 20:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:47 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 47K 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-02-LTLFireability-00
FORMULA_NAME HealthRecord-PT-02-LTLFireability-01
FORMULA_NAME HealthRecord-PT-02-LTLFireability-02
FORMULA_NAME HealthRecord-PT-02-LTLFireability-03
FORMULA_NAME HealthRecord-PT-02-LTLFireability-04
FORMULA_NAME HealthRecord-PT-02-LTLFireability-05
FORMULA_NAME HealthRecord-PT-02-LTLFireability-06
FORMULA_NAME HealthRecord-PT-02-LTLFireability-07
FORMULA_NAME HealthRecord-PT-02-LTLFireability-08
FORMULA_NAME HealthRecord-PT-02-LTLFireability-09
FORMULA_NAME HealthRecord-PT-02-LTLFireability-10
FORMULA_NAME HealthRecord-PT-02-LTLFireability-11
FORMULA_NAME HealthRecord-PT-02-LTLFireability-12
FORMULA_NAME HealthRecord-PT-02-LTLFireability-13
FORMULA_NAME HealthRecord-PT-02-LTLFireability-14
FORMULA_NAME HealthRecord-PT-02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716519160184

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-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 02:52:41] [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:52:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 02:52:41] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2024-05-24 02:52:41] [INFO ] Transformed 119 places.
[2024-05-24 02:52:41] [INFO ] Transformed 225 transitions.
[2024-05-24 02:52:41] [INFO ] Found NUPN structural information;
[2024-05-24 02:52:41] [INFO ] Parsed PT model containing 119 places and 225 transitions and 577 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 6 transitions
Reduce redundant transitions removed 6 transitions.
Support contains 40 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 219/219 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 77 transition count 141
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 77 transition count 141
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 87 place count 74 transition count 135
Iterating global reduction 0 with 3 rules applied. Total rules applied 90 place count 74 transition count 135
Applied a total of 90 rules in 29 ms. Remains 74 /119 variables (removed 45) and now considering 135/219 (removed 84) transitions.
[2024-05-24 02:52:41] [INFO ] Flow matrix only has 133 transitions (discarded 2 similar events)
// Phase 1: matrix 133 rows 74 cols
[2024-05-24 02:52:41] [INFO ] Computed 8 invariants in 12 ms
[2024-05-24 02:52:41] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-24 02:52:41] [INFO ] Flow matrix only has 133 transitions (discarded 2 similar events)
[2024-05-24 02:52:41] [INFO ] Invariant cache hit.
[2024-05-24 02:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:41] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-24 02:52:41] [INFO ] Flow matrix only has 133 transitions (discarded 2 similar events)
[2024-05-24 02:52:41] [INFO ] Invariant cache hit.
[2024-05-24 02:52:41] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 8 ms to minimize.
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-24 02:52:42] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 02:52:43] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 02:52:44] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2024-05-24 02:52:44] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 132/206 variables, 74/98 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 02:52:45] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 3 ms to minimize.
[2024-05-24 02:52:45] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 1/207 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
[2024-05-24 02:52:46] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/207 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 14 (OVERLAPS) 0/207 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 102 constraints, problems are : Problem set: 0 solved, 134 unsolved in 6285 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 19/27 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 132/206 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 8 (OVERLAPS) 1/207 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 10 (OVERLAPS) 0/207 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 236 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4833 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 19/19 constraints]
After SMT, in 11195ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 11212ms
Starting structural reductions in LTL mode, iteration 1 : 74/119 places, 135/219 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11553 ms. Remains : 74/119 places, 135/219 transitions.
Support contains 40 out of 74 places after structural reductions.
[2024-05-24 02:52:53] [INFO ] Flatten gal took : 29 ms
[2024-05-24 02:52:53] [INFO ] Flatten gal took : 13 ms
[2024-05-24 02:52:53] [INFO ] Input system was already deterministic with 135 transitions.
RANDOM walk for 40000 steps (2370 resets) in 1893 ms. (21 steps per ms) remains 12/35 properties
BEST_FIRST walk for 40004 steps (356 resets) in 131 ms. (303 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (380 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (351 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (365 resets) in 86 ms. (459 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (360 resets) in 109 ms. (363 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (366 resets) in 71 ms. (555 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (363 resets) in 60 ms. (655 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (359 resets) in 94 ms. (421 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (366 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (393 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (363 resets) in 41 ms. (952 steps per ms) remains 10/10 properties
[2024-05-24 02:52:54] [INFO ] Flow matrix only has 133 transitions (discarded 2 similar events)
[2024-05-24 02:52:54] [INFO ] Invariant cache hit.
[2024-05-24 02:52:54] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 24/74 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 132/206 variables, 74/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/207 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/207 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 207/207 variables, and 91 constraints, problems are : Problem set: 0 solved, 10 unsolved in 560 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 39/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 24/74 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 132/206 variables, 74/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:52:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 1/207 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/207 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/207 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 207/207 variables, and 109 constraints, problems are : Problem set: 0 solved, 10 unsolved in 714 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 16/16 constraints]
After SMT, in 1284ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 8 different solutions.
Finished Parikh walk after 5153 steps, including 178 resets, run visited all 1 properties in 10 ms. (steps per millisecond=515 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 10 properties in 76 ms.
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' '!((X(G(p0))||G(p1)))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 54 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 54 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 49 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 49 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 54 place count 49 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 56 place count 47 transition count 76
Iterating global reduction 2 with 2 rules applied. Total rules applied 58 place count 47 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 46 transition count 74
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 46 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 46 transition count 73
Applied a total of 61 rules in 8 ms. Remains 46 /74 variables (removed 28) and now considering 73/135 (removed 62) transitions.
[2024-05-24 02:52:56] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
// Phase 1: matrix 72 rows 46 cols
[2024-05-24 02:52:56] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:52:56] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:52:56] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:52:56] [INFO ] Invariant cache hit.
[2024-05-24 02:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:52:56] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-24 02:52:56] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:52:56] [INFO ] Invariant cache hit.
[2024-05-24 02:52:56] [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, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:56] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:52:56] [INFO ] Deduced a trap composed of 6 places in 27 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, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 71/117 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:57] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-24 02:52:57] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/118 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 58 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:52:58] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:52:58] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 71/117 variables, 46/59 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 72/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/118 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 132 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1579 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 6/6 constraints]
After SMT, in 3112ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 3115ms
Starting structural reductions in LTL mode, iteration 1 : 46/74 places, 73/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3200 ms. Remains : 46/74 places, 73/135 transitions.
Stuttering acceptance computed with spot in 306 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-00
Product exploration explored 100000 steps with 2 reset in 149 ms.
Product exploration explored 100000 steps with 17 reset in 106 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 : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 105 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p1)]
RANDOM walk for 19289 steps (1135 resets) in 121 ms. (158 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be false thanks to negative knowledge :(F (NOT p1))
Knowledge based reduction with 13 factoid took 136 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-02-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-02-LTLFireability-00 finished in 4177 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(p0) U (p1||X(X(F((p2||G(F(p3)))))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 56 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 56 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 56 transition count 98
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 50 transition count 86
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 50 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 52 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 48 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 48 transition count 78
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 46 transition count 74
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 46 transition count 74
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 46 transition count 72
Applied a total of 62 rules in 9 ms. Remains 46 /74 variables (removed 28) and now considering 72/135 (removed 63) transitions.
[2024-05-24 02:53:00] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
// Phase 1: matrix 71 rows 46 cols
[2024-05-24 02:53:00] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:53:00] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:53:00] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
[2024-05-24 02:53:00] [INFO ] Invariant cache hit.
[2024-05-24 02:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:00] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 71 sub problems to find dead transitions.
[2024-05-24 02:53:00] [INFO ] Flow matrix only has 71 transitions (discarded 1 similar events)
[2024-05-24 02:53:00] [INFO ] Invariant cache hit.
[2024-05-24 02:53:00] [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, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:53:00] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:53:01] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-24 02:53:01] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:53:01] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (OVERLAPS) 70/116 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (OVERLAPS) 1/117 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/117 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 58 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1117 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
[2024-05-24 02:53:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 70/116 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 71/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 1/117 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/117 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 10 (OVERLAPS) 0/117 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 130 constraints, problems are : Problem set: 0 solved, 71 unsolved in 1476 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 5/5 constraints]
After SMT, in 2614ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 2617ms
Starting structural reductions in LTL mode, iteration 1 : 46/74 places, 72/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2704 ms. Remains : 46/74 places, 72/135 transitions.
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) (NOT p3) (NOT p1) p0), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-01
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-01 finished in 3113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((p1||G(F(p2)))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 54 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 54 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 48 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 48 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 48 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 45 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 45 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 42 transition count 65
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 42 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 42 transition count 62
Applied a total of 71 rules in 9 ms. Remains 42 /74 variables (removed 32) and now considering 62/135 (removed 73) transitions.
[2024-05-24 02:53:03] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
// Phase 1: matrix 61 rows 42 cols
[2024-05-24 02:53:03] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:53:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:53:03] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
[2024-05-24 02:53:03] [INFO ] Invariant cache hit.
[2024-05-24 02:53:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-24 02:53:03] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
[2024-05-24 02:53:03] [INFO ] Invariant cache hit.
[2024-05-24 02:53:03] [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, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 02:53:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-24 02:53:04] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:53:04] [INFO ] Deduced a trap composed of 5 places in 17 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, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 60/102 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 53 constraints, problems are : Problem set: 0 solved, 61 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 02:53:04] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 60/102 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 61/114 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 115 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
After SMT, in 2194ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2195ms
Starting structural reductions in LTL mode, iteration 1 : 42/74 places, 62/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2281 ms. Remains : 42/74 places, 62/135 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-02
Product exploration explored 100000 steps with 50000 reset in 204 ms.
Product exploration explored 100000 steps with 50000 reset in 141 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 : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 27 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-02-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-02-LTLFireability-02 finished in 2875 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((G(p0)||X(X(F((p1&&G(p2)))))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 55 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 55 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 55 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 50 transition count 87
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 50 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 51 place count 50 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 48 transition count 79
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 48 transition count 79
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 46 transition count 75
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 46 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 46 transition count 73
Applied a total of 61 rules in 11 ms. Remains 46 /74 variables (removed 28) and now considering 73/135 (removed 62) transitions.
[2024-05-24 02:53:06] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
// Phase 1: matrix 72 rows 46 cols
[2024-05-24 02:53:06] [INFO ] Computed 7 invariants in 3 ms
[2024-05-24 02:53:06] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 02:53:06] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:53:06] [INFO ] Invariant cache hit.
[2024-05-24 02:53:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:06] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Running 72 sub problems to find dead transitions.
[2024-05-24 02:53:06] [INFO ] Flow matrix only has 72 transitions (discarded 1 similar events)
[2024-05-24 02:53:06] [INFO ] Invariant cache hit.
[2024-05-24 02:53: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, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:53:06] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 2 ms to minimize.
[2024-05-24 02:53:07] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-24 02:53:07] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (OVERLAPS) 71/117 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (OVERLAPS) 1/118 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/118 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Real declared 118/118 variables, and 57 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 72 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 72 unsolved
[2024-05-24 02:53:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:53:08] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 5 (OVERLAPS) 71/117 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 72/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 1/118 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
At refinement iteration 10 (OVERLAPS) 0/118 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 118/118 variables, and 131 constraints, problems are : Problem set: 0 solved, 72 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 72/72 constraints, Known Traps: 5/5 constraints]
After SMT, in 2708ms problems are : Problem set: 0 solved, 72 unsolved
Search for dead transitions found 0 dead transitions in 2711ms
Starting structural reductions in LTL mode, iteration 1 : 46/74 places, 73/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2801 ms. Remains : 46/74 places, 73/135 transitions.
Stuttering acceptance computed with spot in 358 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2), false, false]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-03
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-03 finished in 3186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 54 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 54 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 49 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 49 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 49 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 46 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 46 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 44 transition count 70
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 44 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 65 place count 44 transition count 68
Applied a total of 65 rules in 12 ms. Remains 44 /74 variables (removed 30) and now considering 68/135 (removed 67) transitions.
[2024-05-24 02:53:09] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
// Phase 1: matrix 67 rows 44 cols
[2024-05-24 02:53:09] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:53:09] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:53:09] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
[2024-05-24 02:53:09] [INFO ] Invariant cache hit.
[2024-05-24 02:53:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:09] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2024-05-24 02:53:09] [INFO ] Flow matrix only has 67 transitions (discarded 1 similar events)
[2024-05-24 02:53:09] [INFO ] Invariant cache hit.
[2024-05-24 02:53:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 02:53:10] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-24 02:53:10] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 02:53:10] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 66/110 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 1/111 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 55 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 67 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 67 unsolved
[2024-05-24 02:53:11] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 5 (OVERLAPS) 66/110 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 67/122 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (OVERLAPS) 1/111 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 10 (OVERLAPS) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 123 constraints, problems are : Problem set: 0 solved, 67 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 4/4 constraints]
After SMT, in 2572ms problems are : Problem set: 0 solved, 67 unsolved
Search for dead transitions found 0 dead transitions in 2573ms
Starting structural reductions in LTL mode, iteration 1 : 44/74 places, 68/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2655 ms. Remains : 44/74 places, 68/135 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-04 finished in 2806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&G(p2))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 55 transition count 98
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 55 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 52 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 52 transition count 88
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 51 transition count 85
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 50 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 50 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 50 transition count 82
Applied a total of 53 rules in 4 ms. Remains 50 /74 variables (removed 24) and now considering 82/135 (removed 53) transitions.
[2024-05-24 02:53:12] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
// Phase 1: matrix 81 rows 50 cols
[2024-05-24 02:53:12] [INFO ] Computed 7 invariants in 4 ms
[2024-05-24 02:53:12] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 02:53:12] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2024-05-24 02:53:12] [INFO ] Invariant cache hit.
[2024-05-24 02:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:12] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-05-24 02:53:12] [INFO ] Flow matrix only has 81 transitions (discarded 1 similar events)
[2024-05-24 02:53:12] [INFO ] Invariant cache hit.
[2024-05-24 02:53:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 02:53:12] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:53:12] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:53:13] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/131 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 131/131 variables, and 61 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 02:53:14] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-24 02:53:14] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 80/130 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 81/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/131 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/131 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 131/131 variables, and 144 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 5/5 constraints]
After SMT, in 3292ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 3293ms
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 82/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3375 ms. Remains : 50/74 places, 82/135 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-05 finished in 3531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 54 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 54 transition count 94
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 49 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 49 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 53 place count 49 transition count 83
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 46 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 46 transition count 74
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 43 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 43 transition count 68
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 43 transition count 65
Applied a total of 68 rules in 8 ms. Remains 43 /74 variables (removed 31) and now considering 65/135 (removed 70) transitions.
[2024-05-24 02:53:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 43 cols
[2024-05-24 02:53:16] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:53:16] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:53:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
[2024-05-24 02:53:16] [INFO ] Invariant cache hit.
[2024-05-24 02:53:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:16] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-24 02:53:16] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
[2024-05-24 02:53:16] [INFO ] Invariant cache hit.
[2024-05-24 02:53:16] [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, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:53:16] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 02:53:16] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-24 02:53:16] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 63/106 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 1/107 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/107 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 107/107 variables, and 54 constraints, problems are : Problem set: 0 solved, 64 unsolved in 923 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 64 unsolved
[2024-05-24 02:53:17] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 63/106 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 64/118 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 1/107 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 107/107 variables, and 119 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 4/4 constraints]
After SMT, in 2192ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2192ms
Starting structural reductions in LTL mode, iteration 1 : 43/74 places, 65/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2264 ms. Remains : 43/74 places, 65/135 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-06
Product exploration explored 100000 steps with 2 reset in 74 ms.
Product exploration explored 100000 steps with 7 reset in 70 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, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0)]
RANDOM walk for 30689 steps (1799 resets) in 67 ms. (451 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-02-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-02-LTLFireability-06 finished in 2767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||(F(p1)&&(p2 U (p3||G(p2))))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Graph (trivial) has 82 edges and 74 vertex of which 12 / 74 are part of one of the 6 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 50 transition count 95
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 50 transition count 95
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 50 transition count 93
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 42 place count 45 transition count 83
Iterating global reduction 1 with 5 rules applied. Total rules applied 47 place count 45 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 49 place count 45 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 52 place count 42 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 42 transition count 72
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 39 transition count 66
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 39 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 39 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 38 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 38 transition count 60
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 37 transition count 59
Applied a total of 69 rules in 27 ms. Remains 37 /74 variables (removed 37) and now considering 59/135 (removed 76) transitions.
[2024-05-24 02:53:18] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
// Phase 1: matrix 53 rows 37 cols
[2024-05-24 02:53:18] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:53:18] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 02:53:18] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-05-24 02:53:18] [INFO ] Invariant cache hit.
[2024-05-24 02:53:18] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-24 02:53:18] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-24 02:53:18] [INFO ] Flow matrix only has 53 transitions (discarded 6 similar events)
[2024-05-24 02:53:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-24 02:53:19] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-24 02:53:19] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-24 02:53:19] [INFO ] Deduced a trap composed of 14 places in 23 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, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 52/89 variables, 37/47 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/89 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 89/90 variables, and 47 constraints, problems are : Problem set: 0 solved, 45 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (OVERLAPS) 7/37 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 45 unsolved
[2024-05-24 02:53:19] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 52/89 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 45/93 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/89 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 89/90 variables, and 93 constraints, problems are : Problem set: 0 solved, 45 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1157ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/74 places, 59/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1265 ms. Remains : 37/74 places, 59/135 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-07
Stuttering criterion allowed to conclude after 82 steps with 7 reset in 1 ms.
FORMULA HealthRecord-PT-02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-07 finished in 1467 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' '!((!p0 U ((p0 U X(X(p0)))||F(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 54 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 54 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 48 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 48 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 56 place count 48 transition count 80
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 45 transition count 71
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 45 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 65 place count 42 transition count 65
Iterating global reduction 2 with 3 rules applied. Total rules applied 68 place count 42 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 42 transition count 62
Applied a total of 71 rules in 9 ms. Remains 42 /74 variables (removed 32) and now considering 62/135 (removed 73) transitions.
[2024-05-24 02:53:20] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
// Phase 1: matrix 61 rows 42 cols
[2024-05-24 02:53:20] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:53:20] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 02:53:20] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
[2024-05-24 02:53:20] [INFO ] Invariant cache hit.
[2024-05-24 02:53:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:20] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-24 02:53:20] [INFO ] Flow matrix only has 61 transitions (discarded 1 similar events)
[2024-05-24 02:53:20] [INFO ] Invariant cache hit.
[2024-05-24 02:53:20] [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, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 02:53:20] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-24 02:53:20] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:53:20] [INFO ] Deduced a trap composed of 13 places in 23 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, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 60/102 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 1/103 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 02:53:21] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 54 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1177 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 61 unsolved
[2024-05-24 02:53:21] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 60/102 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 61/115 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 116 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1139 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 5/5 constraints]
After SMT, in 2326ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 2328ms
Starting structural reductions in LTL mode, iteration 1 : 42/74 places, 62/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2414 ms. Remains : 42/74 places, 62/135 transitions.
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-08
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-08 finished in 2734 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(p0)||(p0&&F((p1||G(p2))))))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 56 transition count 99
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 56 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 56 transition count 97
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 50 transition count 85
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 50 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 52 place count 50 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 48 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 48 transition count 77
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 46 transition count 73
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 46 transition count 73
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 46 transition count 71
Applied a total of 62 rules in 4 ms. Remains 46 /74 variables (removed 28) and now considering 71/135 (removed 64) transitions.
[2024-05-24 02:53:23] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
// Phase 1: matrix 69 rows 46 cols
[2024-05-24 02:53:23] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 02:53:23] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:53:23] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
[2024-05-24 02:53:23] [INFO ] Invariant cache hit.
[2024-05-24 02:53:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:23] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-24 02:53:23] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
[2024-05-24 02:53:23] [INFO ] Invariant cache hit.
[2024-05-24 02:53:23] [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, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 02:53:23] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-24 02:53:23] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 02:53:23] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 02:53:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 68/114 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 59 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1255 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 68/114 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 70/128 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 129 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1252 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
After SMT, in 2520ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2521ms
Starting structural reductions in LTL mode, iteration 1 : 46/74 places, 71/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2601 ms. Remains : 46/74 places, 71/135 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-09
Product exploration explored 100000 steps with 25 reset in 92 ms.
Product exploration explored 100000 steps with 9 reset in 200 ms.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Detected a total of 3/46 stabilizing places and 4/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT 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 p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2))))]
Knowledge based reduction with 10 factoid took 422 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (2339 resets) in 156 ms. (254 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (354 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
[2024-05-24 02:53:26] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
[2024-05-24 02:53:26] [INFO ] Invariant cache hit.
[2024-05-24 02:53:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-24 02:53:26] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-24 02:53:26] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-24 02:53:26] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Real declared 46/115 variables, and 11 constraints, problems are : Problem set: 1 solved, 0 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/46 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 96ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2)))), (G (OR p0 p1 (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (NOT p0)), (F (NOT (AND p0 (NOT p1) (NOT p2)))), (F p1), (F (NOT (OR (NOT p0) p1 (NOT p2)))), (F p2), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 11 factoid took 713 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 46 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 71/71 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2024-05-24 02:53:27] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
[2024-05-24 02:53:27] [INFO ] Invariant cache hit.
[2024-05-24 02:53:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 02:53:27] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
[2024-05-24 02:53:27] [INFO ] Invariant cache hit.
[2024-05-24 02:53:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:27] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 70 sub problems to find dead transitions.
[2024-05-24 02:53:27] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
[2024-05-24 02:53:27] [INFO ] Invariant cache hit.
[2024-05-24 02:53:27] [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, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 02:53:28] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:53:28] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-24 02:53:28] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-24 02:53:28] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 68/114 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 59 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1215 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 68/114 variables, 46/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 70/128 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 1/115 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/115 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 129 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1274 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
After SMT, in 2511ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 2511ms
Finished structural reductions in LTL mode , in 1 iterations and 2613 ms. Remains : 46/46 places, 71/71 transitions.
Computed a total of 3 stabilizing places and 4 stable transitions
Computed a total of 3 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2380 resets) in 76 ms. (519 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (361 resets) in 69 ms. (571 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (364 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
[2024-05-24 02:53:30] [INFO ] Flow matrix only has 69 transitions (discarded 2 similar events)
[2024-05-24 02:53:30] [INFO ] Invariant cache hit.
[2024-05-24 02:53:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 02:53:30] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 68/114 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/115 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/115 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 115/115 variables, and 56 constraints, problems are : Problem set: 0 solved, 2 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 19/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 68/114 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/115 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/115 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 115/115 variables, and 58 constraints, problems are : Problem set: 0 solved, 2 unsolved in 71 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 16 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 3 reset in 54 ms.
Product exploration explored 100000 steps with 6 reset in 73 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 71/71 transitions.
Graph (trivial) has 45 edges and 46 vertex of which 12 / 46 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 38 transition count 61
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 38 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 38 transition count 60
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 38 transition count 97
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 38 transition count 95
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 13 rules in 16 ms. Remains 38 /46 variables (removed 8) and now considering 95/71 (removed -24) transitions.
[2024-05-24 02:53:31] [INFO ] Redundant transitions in 3 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-24 02:53:31] [INFO ] Flow matrix only has 84 transitions (discarded 11 similar events)
// Phase 1: matrix 84 rows 38 cols
[2024-05-24 02:53:31] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 02:53:31] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 9 places in 17 ms of which 0 ms to minimize.
[2024-05-24 02:53:32] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 8/16 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 83/121 variables, 38/54 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 13/67 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/67 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/68 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/68 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/68 constraints. Problems are: Problem set: 10 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 68 constraints, problems are : Problem set: 10 solved, 69 unsolved in 1244 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 10 solved, 69 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 1 (OVERLAPS) 3/35 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/5 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 8/13 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 5 (OVERLAPS) 3/38 variables, 3/16 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 7 (OVERLAPS) 83/121 variables, 38/54 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 13/67 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 69/136 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/136 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 11 (OVERLAPS) 1/122 variables, 1/137 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/122 variables, 0/137 constraints. Problems are: Problem set: 10 solved, 69 unsolved
At refinement iteration 13 (OVERLAPS) 0/122 variables, 0/137 constraints. Problems are: Problem set: 10 solved, 69 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 137 constraints, problems are : Problem set: 10 solved, 69 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 38/38 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 69/79 constraints, Known Traps: 8/8 constraints]
After SMT, in 3020ms problems are : Problem set: 10 solved, 69 unsolved
Search for dead transitions found 10 dead transitions in 3022ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 38/46 places, 85/71 transitions.
Graph (complete) has 142 edges and 38 vertex of which 33 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 33 /38 variables (removed 5) and now considering 85/85 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/46 places, 85/71 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3079 ms. Remains : 33/46 places, 85/71 transitions.
Built C files in :
/tmp/ltsmin6551748382270533258
[2024-05-24 02:53:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6551748382270533258
Running compilation step : cd /tmp/ltsmin6551748382270533258;'/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 287 ms.
Running link step : cd /tmp/ltsmin6551748382270533258;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin6551748382270533258;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9747938708063709901.hoa' '--buchi-type=spotba'
LTSmin run took 482 ms.
FORMULA HealthRecord-PT-02-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-02-LTLFireability-09 finished in 12707 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((X(p1)||p0)))&&F(p2))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 54 transition count 96
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 54 transition count 94
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 48 transition count 82
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 48 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 48 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 45 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 45 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 43 transition count 68
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 43 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 67 place count 43 transition count 66
Applied a total of 67 rules in 3 ms. Remains 43 /74 variables (removed 31) and now considering 66/135 (removed 69) transitions.
[2024-05-24 02:53:35] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
// Phase 1: matrix 65 rows 43 cols
[2024-05-24 02:53:35] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:53:35] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:53:35] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:53:35] [INFO ] Invariant cache hit.
[2024-05-24 02:53:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:35] [INFO ] Implicit Places using invariants and state equation in 34 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:53:35] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:53:35] [INFO ] Invariant cache hit.
[2024-05-24 02:53:35] [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, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:53:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-24 02:53:36] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-24 02:53:36] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (OVERLAPS) 64/107 variables, 43/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/107 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (OVERLAPS) 1/108 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/108 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/108 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 54 constraints, problems are : Problem set: 0 solved, 65 unsolved in 965 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 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/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-24 02:53:36] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 64/107 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 65/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 1/108 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 120 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
After SMT, in 2208ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 2210ms
Starting structural reductions in LTL mode, iteration 1 : 43/74 places, 66/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2290 ms. Remains : 43/74 places, 66/135 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-10
Product exploration explored 100000 steps with 6 reset in 61 ms.
Product exploration explored 100000 steps with 1 reset in 56 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 : [(AND p2 p0 p1), (X p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2357 resets) in 99 ms. (400 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (365 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-24 02:53:38] [INFO ] Flow matrix only has 65 transitions (discarded 1 similar events)
[2024-05-24 02:53:38] [INFO ] Invariant cache hit.
[2024-05-24 02:53:38] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/43 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 64/107 variables, 43/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/108 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 51 constraints, problems are : Problem set: 0 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 28/108 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/43 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (NOT p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 200 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 66/66 transitions.
Graph (trivial) has 39 edges and 43 vertex of which 12 / 43 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 35 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 35 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 35 transition count 56
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 1 with 2 rules applied. Total rules applied 6 place count 34 transition count 61
Applied a total of 6 rules in 10 ms. Remains 34 /43 variables (removed 9) and now considering 61/66 (removed 5) transitions.
[2024-05-24 02:53:39] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
// Phase 1: matrix 55 rows 34 cols
[2024-05-24 02:53:39] [INFO ] Computed 7 invariants in 4 ms
[2024-05-24 02:53:39] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 02:53:39] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-05-24 02:53:39] [INFO ] Invariant cache hit.
[2024-05-24 02:53:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 02:53:39] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-24 02:53:39] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-24 02:53:39] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-05-24 02:53:39] [INFO ] Invariant cache hit.
[2024-05-24 02:53:39] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:53:39] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-05-24 02:53:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-24 02:53:39] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 54/88 variables, 34/44 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 50 constraints, problems are : Problem set: 0 solved, 47 unsolved in 536 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 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/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:53:40] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-24 02:53:40] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 54/88 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 47/99 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 99 constraints, problems are : Problem set: 0 solved, 47 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
After SMT, in 1232ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1234ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/43 places, 61/66 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1314 ms. Remains : 34/43 places, 61/66 transitions.
Computed a total of 10 stabilizing places and 9 stable transitions
Computed a total of 10 stabilizing places and 9 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 159 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (4178 resets) in 177 ms. (224 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (677 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
[2024-05-24 02:53:41] [INFO ] Flow matrix only has 55 transitions (discarded 6 similar events)
[2024-05-24 02:53:41] [INFO ] Invariant cache hit.
[2024-05-24 02:53:41] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 12/34 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/88 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 47 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Int declared 22/89 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 2/7 constraints, State Equation: 0/34 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p0 p2), (X (OR p1 p0)), (X (NOT (AND p1 (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1)), (G (OR p0 p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2))]
Knowledge based reduction with 17 factoid took 272 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 84 ms.
Product exploration explored 100000 steps with 1 reset in 70 ms.
Built C files in :
/tmp/ltsmin17704595843574919458
[2024-05-24 02:53:41] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-05-24 02:53:41] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:53:41] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-05-24 02:53:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:53:42] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-05-24 02:53:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 02:53:42] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17704595843574919458
Running compilation step : cd /tmp/ltsmin17704595843574919458;'/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 153 ms.
Running link step : cd /tmp/ltsmin17704595843574919458;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin17704595843574919458;'/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/stateBased8608648710834934175.hoa' '--buchi-type=spotba'
LTSmin run took 363 ms.
FORMULA HealthRecord-PT-02-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-02-LTLFireability-10 finished in 6769 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 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Graph (trivial) has 91 edges and 74 vertex of which 10 / 74 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 48 transition count 90
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 48 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 43 place count 48 transition count 88
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 42 transition count 76
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 42 transition count 76
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 42 transition count 73
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 40 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 64 place count 38 transition count 63
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 38 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 68 place count 38 transition count 61
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 3 with 2 rules applied. Total rules applied 70 place count 37 transition count 60
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 72 place count 36 transition count 66
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 73 place count 36 transition count 65
Applied a total of 73 rules in 14 ms. Remains 36 /74 variables (removed 38) and now considering 65/135 (removed 70) transitions.
[2024-05-24 02:53:42] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
// Phase 1: matrix 60 rows 36 cols
[2024-05-24 02:53:42] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:53:42] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:53:42] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2024-05-24 02:53:42] [INFO ] Invariant cache hit.
[2024-05-24 02:53:42] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 02:53:42] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-24 02:53:42] [INFO ] Redundant transitions in 1 ms returned []
Running 51 sub problems to find dead transitions.
[2024-05-24 02:53:42] [INFO ] Flow matrix only has 60 transitions (discarded 5 similar events)
[2024-05-24 02:53:42] [INFO ] Invariant cache hit.
[2024-05-24 02:53:42] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
[2024-05-24 02:53:42] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-24 02:53:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-24 02:53:42] [INFO ] Deduced a trap composed of 15 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 59/95 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (OVERLAPS) 0/95 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 95/96 variables, and 53 constraints, problems are : Problem set: 0 solved, 51 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 59/95 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 9 (OVERLAPS) 0/95 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 95/96 variables, and 104 constraints, problems are : Problem set: 0 solved, 51 unsolved in 586 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 3/3 constraints]
After SMT, in 1167ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 1168ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/74 places, 65/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1258 ms. Remains : 36/74 places, 65/135 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-11 finished in 1301 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))&&(!p1 U (p2||G(!p1)))))'
Support contains 10 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Graph (trivial) has 39 edges and 74 vertex of which 12 / 74 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 49 transition count 93
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 49 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 39 place count 49 transition count 91
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 43 transition count 79
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 43 transition count 79
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 43 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 40 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 40 transition count 68
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 37 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 37 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 37 transition count 59
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 3 with 2 rules applied. Total rules applied 70 place count 36 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 36 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 35 transition count 55
Applied a total of 73 rules in 9 ms. Remains 35 /74 variables (removed 39) and now considering 55/135 (removed 80) transitions.
[2024-05-24 02:53:43] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
// Phase 1: matrix 49 rows 35 cols
[2024-05-24 02:53:43] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:53:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 02:53:43] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-05-24 02:53:43] [INFO ] Invariant cache hit.
[2024-05-24 02:53:43] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-24 02:53:43] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-24 02:53:43] [INFO ] Flow matrix only has 49 transitions (discarded 6 similar events)
[2024-05-24 02:53:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-24 02:53:44] [INFO ] Deduced a trap composed of 5 places in 12 ms of which 1 ms to minimize.
[2024-05-24 02:53:44] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-24 02:53:44] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 48/83 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/83 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 83/84 variables, and 45 constraints, problems are : Problem set: 0 solved, 41 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 48/83 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 41/86 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 0/83 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 83/84 variables, and 86 constraints, problems are : Problem set: 0 solved, 41 unsolved in 459 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 3/3 constraints]
After SMT, in 926ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 927ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/74 places, 55/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 995 ms. Remains : 35/74 places, 55/135 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-12
Stuttering criterion allowed to conclude after 49 steps with 3 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-12 finished in 1120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||(F(p1) U p2))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 56 transition count 100
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 56 transition count 100
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 41 place count 51 transition count 90
Iterating global reduction 0 with 5 rules applied. Total rules applied 46 place count 51 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 48 place count 51 transition count 88
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 49 transition count 82
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 49 transition count 82
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 47 transition count 78
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 47 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 58 place count 47 transition count 76
Applied a total of 58 rules in 2 ms. Remains 47 /74 variables (removed 27) and now considering 76/135 (removed 59) transitions.
[2024-05-24 02:53:44] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 47 cols
[2024-05-24 02:53:44] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:53:45] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 02:53:45] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:53:45] [INFO ] Invariant cache hit.
[2024-05-24 02:53:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:45] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-24 02:53:45] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:53:45] [INFO ] Invariant cache hit.
[2024-05-24 02:53: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, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 02:53:45] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 02:53:45] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-24 02:53:45] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 74/121 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1239 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 02:53:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-24 02:53:46] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 75/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 135 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1671 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints]
After SMT, in 2923ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2925ms
Starting structural reductions in LTL mode, iteration 1 : 47/74 places, 76/135 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3006 ms. Remains : 47/74 places, 76/135 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-13
Product exploration explored 100000 steps with 3 reset in 59 ms.
Product exploration explored 100000 steps with 0 reset in 58 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 : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (2346 resets) in 148 ms. (268 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40003 steps (354 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (354 resets) in 31 ms. (1250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (377 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (359 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
[2024-05-24 02:53:48] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:53:48] [INFO ] Invariant cache hit.
[2024-05-24 02:53:48] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/47 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/122 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 55 constraints, problems are : Problem set: 0 solved, 4 unsolved in 67 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 02:53:48] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/47 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 74/121 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 60 constraints, problems are : Problem set: 0 solved, 4 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 222ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 51 steps, including 2 resets, run visited all 4 properties in 3 ms. (steps per millisecond=17 )
Parikh walk visited 4 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p1) p0))), (F (NOT (OR p1 p2 p0))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 13 factoid took 521 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 208 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-24 02:53:50] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:53:50] [INFO ] Invariant cache hit.
[2024-05-24 02:53:50] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 02:53:50] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:53:50] [INFO ] Invariant cache hit.
[2024-05-24 02:53:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 02:53:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-24 02:53:50] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:53:50] [INFO ] Invariant cache hit.
[2024-05-24 02:53:50] [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, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 02:53:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-24 02:53:50] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 02:53:50] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 74/121 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
[2024-05-24 02:53:51] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-24 02:53:51] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 75/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 135 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1628 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints]
After SMT, in 2806ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2807ms
Finished structural reductions in LTL mode , in 1 iterations and 2887 ms. Remains : 47/47 places, 76/76 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 : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 109 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
RANDOM walk for 40000 steps (2326 resets) in 180 ms. (220 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (368 resets) in 42 ms. (930 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (360 resets) in 35 ms. (1111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (363 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (362 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
[2024-05-24 02:53:53] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2024-05-24 02:53:53] [INFO ] Invariant cache hit.
[2024-05-24 02:53:53] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/47 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/122 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/122 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 55 constraints, problems are : Problem set: 0 solved, 4 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-24 02:53:53] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/47 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 74/121 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/122 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/122 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 60 constraints, problems are : Problem set: 0 solved, 4 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 194ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 27 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p2) p0))), (X (X (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p2 p1))), (F p2), (F (NOT (OR p0 p2))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p2) (NOT p1)))), (F p1)]
Knowledge based reduction with 10 factoid took 479 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 218 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 248 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 4 reset in 48 ms.
Product exploration explored 100000 steps with 8 reset in 62 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p2)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 76/76 transitions.
Graph (trivial) has 44 edges and 47 vertex of which 12 / 47 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 40 transition count 68
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 40 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 40 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 40 transition count 106
Deduced a syphon composed of 5 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 40 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 5 ms. Remains 40 /47 variables (removed 7) and now considering 104/76 (removed -28) transitions.
[2024-05-24 02:53:55] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-05-24 02:53:55] [INFO ] Flow matrix only has 94 transitions (discarded 10 similar events)
// Phase 1: matrix 94 rows 40 cols
[2024-05-24 02:53:55] [INFO ] Computed 7 invariants in 1 ms
[2024-05-24 02:53:55] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-05-24 02:53:55] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-24 02:53:55] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-24 02:53:55] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
[2024-05-24 02:53:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-05-24 02:53:55] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-24 02:53:55] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:53:55] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 7/14 constraints. Problems are: Problem set: 6 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 6 solved, 82 unsolved
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
At refinement iteration 4 (OVERLAPS) 93/133 variables, 40/54 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 15/69 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/69 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 7 (OVERLAPS) 1/134 variables, 1/70 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 0/70 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 9 (OVERLAPS) 0/134 variables, 0/70 constraints. Problems are: Problem set: 10 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 70 constraints, problems are : Problem set: 10 solved, 78 unsolved in 1657 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 10 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 6/40 variables, 7/7 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 7/14 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 93/133 variables, 40/54 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 15/69 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 78/147 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/147 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/148 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/148 constraints. Problems are: Problem set: 10 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/148 constraints. Problems are: Problem set: 10 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 148 constraints, problems are : Problem set: 10 solved, 78 unsolved in 1931 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 40/40 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 78/88 constraints, Known Traps: 7/7 constraints]
After SMT, in 3626ms problems are : Problem set: 10 solved, 78 unsolved
Search for dead transitions found 10 dead transitions in 3626ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/47 places, 94/76 transitions.
Graph (complete) has 145 edges and 40 vertex of which 35 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 35 /40 variables (removed 5) and now considering 94/94 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 35/47 places, 94/76 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3644 ms. Remains : 35/47 places, 94/76 transitions.
Built C files in :
/tmp/ltsmin13986010639550236585
[2024-05-24 02:53:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13986010639550236585
Running compilation step : cd /tmp/ltsmin13986010639550236585;'/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 156 ms.
Running link step : cd /tmp/ltsmin13986010639550236585;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin13986010639550236585;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14644442020886004392.hoa' '--buchi-type=spotba'
LTSmin run took 1071 ms.
FORMULA HealthRecord-PT-02-LTLFireability-13 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-02-LTLFireability-13 finished in 15150 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&&F(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Graph (trivial) has 85 edges and 74 vertex of which 12 / 74 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 50 transition count 95
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 50 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 36 place count 50 transition count 94
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 43 transition count 80
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 43 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 53 place count 43 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 40 transition count 68
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 40 transition count 68
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 37 transition count 62
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 37 transition count 62
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 37 transition count 59
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 3 with 2 rules applied. Total rules applied 70 place count 36 transition count 58
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 72 place count 35 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 35 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 34 transition count 60
Applied a total of 75 rules in 7 ms. Remains 34 /74 variables (removed 40) and now considering 60/135 (removed 75) transitions.
[2024-05-24 02:54:00] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
// Phase 1: matrix 54 rows 34 cols
[2024-05-24 02:54:00] [INFO ] Computed 7 invariants in 2 ms
[2024-05-24 02:54:00] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 02:54:00] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-05-24 02:54:00] [INFO ] Invariant cache hit.
[2024-05-24 02:54:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 02:54:00] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-24 02:54:00] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-24 02:54:00] [INFO ] Flow matrix only has 54 transitions (discarded 6 similar events)
[2024-05-24 02:54:00] [INFO ] Invariant cache hit.
[2024-05-24 02:54:00] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 53/87 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/87 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/88 variables, and 51 constraints, problems are : Problem set: 0 solved, 46 unsolved in 517 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 7/34 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 13 places in 17 ms of which 0 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-24 02:54:00] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 53/87 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 6/55 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 46/101 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/87 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/88 variables, and 101 constraints, problems are : Problem set: 0 solved, 46 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 8/8 constraints]
After SMT, in 1243ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1244ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/74 places, 60/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1322 ms. Remains : 34/74 places, 60/135 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-14 finished in 1407 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 U p1)||G((p2 U X((F(p0) U p1)))))))'
Support contains 1 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 135/135 transitions.
Graph (trivial) has 88 edges and 74 vertex of which 8 / 74 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 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 51 transition count 95
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 51 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 39 place count 51 transition count 93
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 45 transition count 81
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 45 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 53 place count 45 transition count 79
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 42 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 42 transition count 70
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 39 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 39 transition count 64
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 39 transition count 61
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 3 with 2 rules applied. Total rules applied 70 place count 38 transition count 60
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 72 place count 37 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 37 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 36 transition count 61
Applied a total of 75 rules in 11 ms. Remains 36 /74 variables (removed 38) and now considering 61/135 (removed 74) transitions.
[2024-05-24 02:54:01] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
// Phase 1: matrix 56 rows 36 cols
[2024-05-24 02:54:01] [INFO ] Computed 7 invariants in 0 ms
[2024-05-24 02:54:01] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-24 02:54:01] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:54:01] [INFO ] Invariant cache hit.
[2024-05-24 02:54:01] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 02:54:01] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-05-24 02:54:01] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-24 02:54:01] [INFO ] Flow matrix only has 56 transitions (discarded 5 similar events)
[2024-05-24 02:54:01] [INFO ] Invariant cache hit.
[2024-05-24 02:54:01] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 3 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-24 02:54:01] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 55/91 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/92 variables, and 54 constraints, problems are : Problem set: 0 solved, 47 unsolved in 635 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 55/91 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 5/54 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 47/101 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/92 variables, and 101 constraints, problems are : Problem set: 0 solved, 47 unsolved in 539 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 6/6 constraints]
After SMT, in 1184ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1184ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/74 places, 61/135 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1268 ms. Remains : 36/74 places, 61/135 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Running random walk in product with property : HealthRecord-PT-02-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-02-LTLFireability-15 finished in 1325 ms.
All properties solved by simple procedures.
Total runtime 81579 ms.

BK_STOP 1716519242907

--------------------
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-02"
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-02, 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-171640604000708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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