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.r197-tall-171640625700488.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 gold2023
Input is HealthRecord-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625700488
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 12 20:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 20:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 70K 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-11-LTLFireability-00
FORMULA_NAME HealthRecord-PT-11-LTLFireability-01
FORMULA_NAME HealthRecord-PT-11-LTLFireability-02
FORMULA_NAME HealthRecord-PT-11-LTLFireability-03
FORMULA_NAME HealthRecord-PT-11-LTLFireability-04
FORMULA_NAME HealthRecord-PT-11-LTLFireability-05
FORMULA_NAME HealthRecord-PT-11-LTLFireability-06
FORMULA_NAME HealthRecord-PT-11-LTLFireability-07
FORMULA_NAME HealthRecord-PT-11-LTLFireability-08
FORMULA_NAME HealthRecord-PT-11-LTLFireability-09
FORMULA_NAME HealthRecord-PT-11-LTLFireability-10
FORMULA_NAME HealthRecord-PT-11-LTLFireability-11
FORMULA_NAME HealthRecord-PT-11-LTLFireability-12
FORMULA_NAME HealthRecord-PT-11-LTLFireability-13
FORMULA_NAME HealthRecord-PT-11-LTLFireability-14
FORMULA_NAME HealthRecord-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716557839574

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 13:37:21] [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 13:37:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:37:21] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-24 13:37:21] [INFO ] Transformed 159 places.
[2024-05-24 13:37:21] [INFO ] Transformed 334 transitions.
[2024-05-24 13:37:21] [INFO ] Found NUPN structural information;
[2024-05-24 13:37:21] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-11-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-11-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 81 transition count 159
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 81 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 162 place count 75 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 168 place count 75 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 170 place count 75 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 74 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 74 transition count 142
Applied a total of 172 rules in 39 ms. Remains 74 /159 variables (removed 85) and now considering 142/307 (removed 165) transitions.
[2024-05-24 13:37:21] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
// Phase 1: matrix 138 rows 74 cols
[2024-05-24 13:37:21] [INFO ] Computed 10 invariants in 17 ms
[2024-05-24 13:37:21] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-24 13:37:21] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2024-05-24 13:37:21] [INFO ] Invariant cache hit.
[2024-05-24 13:37:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:21] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-24 13:37:21] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2024-05-24 13:37:21] [INFO ] Invariant cache hit.
[2024-05-24 13:37:22] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/159 places, 142/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 74/159 places, 142/307 transitions.
Support contains 26 out of 74 places after structural reductions.
[2024-05-24 13:37:22] [INFO ] Flatten gal took : 33 ms
[2024-05-24 13:37:22] [INFO ] Flatten gal took : 19 ms
[2024-05-24 13:37:22] [INFO ] Input system was already deterministic with 142 transitions.
Incomplete random walk after 10000 steps, including 675 resets, run finished after 542 ms. (steps per millisecond=18 ) properties (out of 24) seen :10
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-24 13:37:23] [INFO ] Flow matrix only has 138 transitions (discarded 4 similar events)
[2024-05-24 13:37:23] [INFO ] Invariant cache hit.
[2024-05-24 13:37:23] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 13:37:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-24 13:37:23] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 4 ms returned sat
[2024-05-24 13:37:23] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-24 13:37:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:23] [INFO ] After 69ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-24 13:37:24] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 93 ms.
[2024-05-24 13:37:24] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 23 ms.
Support contains 14 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 142/142 transitions.
Graph (trivial) has 61 edges and 74 vertex of which 10 / 74 are part of one of the 5 SCC in 2 ms
Free SCC test removed 5 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 281 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 125
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 66 transition count 122
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 65 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 11 place count 65 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 16 place count 62 transition count 119
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 21 place count 57 transition count 109
Iterating global reduction 3 with 5 rules applied. Total rules applied 26 place count 57 transition count 109
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 55 transition count 105
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 55 transition count 105
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 35 place count 55 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 39 place count 53 transition count 98
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 47 place count 49 transition count 121
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 49 transition count 120
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 4 with 14 rules applied. Total rules applied 62 place count 49 transition count 120
Applied a total of 62 rules in 62 ms. Remains 49 /74 variables (removed 25) and now considering 120/142 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 49/74 places, 120/142 transitions.
Incomplete random walk after 10000 steps, including 1556 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 11) seen :5
Incomplete Best-First random walk after 10001 steps, including 245 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 250 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 241 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 255 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 245 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-24 13:37:24] [INFO ] Flow matrix only has 114 transitions (discarded 6 similar events)
// Phase 1: matrix 114 rows 49 cols
[2024-05-24 13:37:24] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 13:37:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 13:37:24] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 13:37:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 13:37:24] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 13:37:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 13:37:25] [INFO ] After 58ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 13:37:25] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 13:37:25] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 120/120 transitions.
Graph (complete) has 224 edges and 49 vertex of which 38 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 38 transition count 96
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 32 transition count 80
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 32 transition count 80
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 46 place count 32 transition count 70
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 31 transition count 68
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 31 transition count 68
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 29 transition count 66
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 29 transition count 66
Applied a total of 53 rules in 10 ms. Remains 29 /49 variables (removed 20) and now considering 66/120 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 29/49 places, 66/120 transitions.
Incomplete random walk after 10000 steps, including 1856 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 332 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 322 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 324 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 66 rows 29 cols
[2024-05-24 13:37:25] [INFO ] Computed 0 invariants in 2 ms
[2024-05-24 13:37:25] [INFO ] After 101ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:37:25] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:37:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-24 13:37:25] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:37:25] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 13:37:25] [INFO ] After 97ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
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 1 ms.
FORMULA HealthRecord-PT-11-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 8 stabilizing places and 12 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 54 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 54 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 50 place count 54 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 52 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 52 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 52 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 51 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 51 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 51 transition count 79
Applied a total of 62 rules in 7 ms. Remains 51 /74 variables (removed 23) and now considering 79/142 (removed 63) transitions.
[2024-05-24 13:37:25] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 51 cols
[2024-05-24 13:37:25] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:37:26] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 13:37:26] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:37:26] [INFO ] Invariant cache hit.
[2024-05-24 13:37:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:26] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-24 13:37:26] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2024-05-24 13:37:26] [INFO ] Invariant cache hit.
[2024-05-24 13:37:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/74 places, 79/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 51/74 places, 79/142 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s20 1), p1:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 6 ms.
FORMULA HealthRecord-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-11-LTLFireability-01 finished in 573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&G((p1||G((p2||F(p3))))))))'
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 56 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 56 transition count 106
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 43 place count 56 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 55 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 55 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 54 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 54 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 50 place count 54 transition count 92
Applied a total of 50 rules in 22 ms. Remains 54 /74 variables (removed 20) and now considering 92/142 (removed 50) transitions.
[2024-05-24 13:37:26] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-24 13:37:26] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:37:26] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-24 13:37:26] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:37:26] [INFO ] Invariant cache hit.
[2024-05-24 13:37:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:26] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-24 13:37:26] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:37:26] [INFO ] Invariant cache hit.
[2024-05-24 13:37:26] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 92/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 54/74 places, 92/142 transitions.
Stuttering acceptance computed with spot in 986 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={0, 1} source=2 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=2 dest: 6}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={0} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}, { cond=p1, acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 1} source=5 dest: 2}, { cond=(OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={1} source=5 dest: 6}, { cond=(OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0))), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=6 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={1} source=6 dest: 10}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=7 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=7 dest: 6}, { cond=(OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), acceptance={0} source=7 dest: 7}], [{ cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(NOT p1), acceptance={} source=9 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 7}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 1} source=10 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={0, 1} source=10 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={1} source=10 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={0} source=10 dest: 7}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={1} source=10 dest: 10}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=11 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={1} source=11 dest: 6}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=11 dest: 7}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p1:(EQ s39 0), p2:(NEQ s4 1), p3:(NEQ s24 1), p0:(OR (EQ s5 0) (EQ s9 0) (EQ s13 0) (EQ s50 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18 reset in 292 ms.
Product exploration explored 100000 steps with 3 reset in 94 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 303 ms. Reduced automaton from 12 states, 50 edges and 4 AP (stutter sensitive) to 11 states, 43 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 676 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 663 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :3
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2024-05-24 13:37:29] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:37:29] [INFO ] Invariant cache hit.
[2024-05-24 13:37:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:37:29] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-24 13:37:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 14 ms returned sat
[2024-05-24 13:37:29] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :6
[2024-05-24 13:37:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:29] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :6
[2024-05-24 13:37:29] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :6
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-24 13:37:29] [INFO ] After 239ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :6
Fused 9 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 92/92 transitions.
Graph (trivial) has 41 edges and 54 vertex of which 10 / 54 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 187 edges and 49 vertex of which 33 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 33 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 22 place count 33 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 30 transition count 50
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 28 transition count 46
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 28 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 26 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 25 transition count 43
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 9 edges and 23 vertex of which 2 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 22 transition count 43
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 22 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 22 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 19 transition count 37
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 19 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 19 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 18 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 18 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 18 transition count 31
Applied a total of 57 rules in 19 ms. Remains 18 /54 variables (removed 36) and now considering 31/92 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 18/54 places, 31/92 transitions.
Incomplete random walk after 10000 steps, including 1546 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1111 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1114 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 31 rows 18 cols
[2024-05-24 13:37:29] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 13:37:29] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 13:37:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:37:29] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 13:37:29] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 13:37:30] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 7 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 18/18 places, 31/31 transitions.
Incomplete random walk after 10000 steps, including 1542 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 1109 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 1112 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :0
Finished probabilistic random walk after 1312 steps, run visited all 4 properties in 10 ms. (steps per millisecond=131 )
Probabilistic random walk after 1312 steps, saw 344 distinct states, run finished after 10 ms. (steps per millisecond=131 ) properties seen :4
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p3 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X p1), (X (NOT (AND p1 (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p1) p2 (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND p2 (NOT p3) (NOT p0)))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (G (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (G (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (NOT p1)), (F (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) p2 (NOT p3))), (F (OR (AND p1 (NOT p3)) (AND p2 (NOT p3)))), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 26 factoid took 567 ms. Reduced automaton from 11 states, 43 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 420 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 92/92 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-24 13:37:31] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-24 13:37:31] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:37:31] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-24 13:37:31] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:37:31] [INFO ] Invariant cache hit.
[2024-05-24 13:37:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:31] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-24 13:37:31] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:37:31] [INFO ] Invariant cache hit.
[2024-05-24 13:37:31] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 54/54 places, 92/92 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p2 p3 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 174 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Incomplete random walk after 10000 steps, including 670 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 96 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 13:37:32] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:37:32] [INFO ] Invariant cache hit.
[2024-05-24 13:37:32] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:37:32] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 13:37:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 13:37:32] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 13:37:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:32] [INFO ] After 16ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 13:37:33] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-24 13:37:33] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 92/92 transitions.
Graph (trivial) has 41 edges and 54 vertex of which 10 / 54 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 187 edges and 49 vertex of which 33 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 33 transition count 53
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 22 place count 33 transition count 50
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 28 place count 30 transition count 50
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 28 transition count 46
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 28 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 26 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 25 transition count 43
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 9 edges and 23 vertex of which 2 / 23 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 22 transition count 43
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 43 place count 22 transition count 40
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 43 place count 22 transition count 37
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 49 place count 19 transition count 37
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 19 transition count 33
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 54 place count 19 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 55 place count 18 transition count 32
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 18 transition count 32
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 18 transition count 31
Applied a total of 57 rules in 10 ms. Remains 18 /54 variables (removed 36) and now considering 31/92 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 18/54 places, 31/92 transitions.
Incomplete random walk after 10000 steps, including 1583 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 1108 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 31 rows 18 cols
[2024-05-24 13:37:33] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 13:37:33] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:37:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-24 13:37:33] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:37:33] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 13:37:33] [INFO ] After 143ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 1 properties in 2 ms.
Support contains 7 out of 18 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 18/18 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 18/18 places, 31/31 transitions.
Incomplete random walk after 10000 steps, including 1530 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1000 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1112 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 1312 steps, run visited all 2 properties in 5 ms. (steps per millisecond=262 )
Probabilistic random walk after 1312 steps, saw 344 distinct states, run finished after 5 ms. (steps per millisecond=262 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p3 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p3))), (F (NOT p1)), (F (AND p1 p2 (NOT p3))), (F (AND (NOT p3) (NOT p0))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) p2 (NOT p3))), (F (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))))]
Knowledge based reduction with 8 factoid took 432 ms. Reduced automaton from 10 states, 34 edges and 4 AP (stutter sensitive) to 10 states, 34 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 432 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 421 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 405 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 4 reset in 97 ms.
Product exploration explored 100000 steps with 2 reset in 94 ms.
Built C files in :
/tmp/ltsmin1520267536566500093
[2024-05-24 13:37:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1520267536566500093
Running compilation step : cd /tmp/ltsmin1520267536566500093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 234 ms.
Running link step : cd /tmp/ltsmin1520267536566500093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1520267536566500093;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5396064375215661959.hoa' '--buchi-type=spotba'
LTSmin run took 2077 ms.
FORMULA HealthRecord-PT-11-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLFireability-02 finished in 11459 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Graph (trivial) has 85 edges and 74 vertex of which 10 / 74 are part of one of the 5 SCC in 1 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 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 54 transition count 109
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 54 transition count 109
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 30 place count 54 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 50 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 50 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 44 place count 50 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 48 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 48 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 48 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 47 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 47 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 56 place count 47 transition count 80
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 4 with 2 rules applied. Total rules applied 58 place count 46 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 46 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 63 place count 44 transition count 94
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 67 place count 44 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 69 place count 42 transition count 88
Applied a total of 69 rules in 42 ms. Remains 42 /74 variables (removed 32) and now considering 88/142 (removed 54) transitions.
[2024-05-24 13:37:38] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
// Phase 1: matrix 78 rows 42 cols
[2024-05-24 13:37:38] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:37:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 13:37:38] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-24 13:37:38] [INFO ] Invariant cache hit.
[2024-05-24 13:37:38] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 13:37:38] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 13:37:38] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-24 13:37:38] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-24 13:37:38] [INFO ] Invariant cache hit.
[2024-05-24 13:37:38] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/74 places, 88/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 42/74 places, 88/142 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12 reset in 185 ms.
Product exploration explored 100000 steps with 4 reset in 161 ms.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1048 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 139 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5775 steps, run visited all 1 properties in 11 ms. (steps per millisecond=525 )
Probabilistic random walk after 5775 steps, saw 1377 distinct states, run finished after 11 ms. (steps per millisecond=525 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 42 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 42/42 places, 88/88 transitions.
Applied a total of 0 rules in 6 ms. Remains 42 /42 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-24 13:37:39] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-24 13:37:39] [INFO ] Invariant cache hit.
[2024-05-24 13:37:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-24 13:37:39] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-24 13:37:39] [INFO ] Invariant cache hit.
[2024-05-24 13:37:39] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 13:37:39] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-24 13:37:39] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 13:37:39] [INFO ] Flow matrix only has 78 transitions (discarded 10 similar events)
[2024-05-24 13:37:39] [INFO ] Invariant cache hit.
[2024-05-24 13:37:39] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 42/42 places, 88/88 transitions.
Computed a total of 14 stabilizing places and 29 stable transitions
Computed a total of 14 stabilizing places and 29 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1052 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5775 steps, run visited all 1 properties in 64 ms. (steps per millisecond=90 )
Probabilistic random walk after 5775 steps, saw 1377 distinct states, run finished after 64 ms. (steps per millisecond=90 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 119 ms.
Built C files in :
/tmp/ltsmin17004008528682975135
[2024-05-24 13:37:40] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-24 13:37:40] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:37:40] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-24 13:37:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:37:40] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-24 13:37:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:37:40] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17004008528682975135
Running compilation step : cd /tmp/ltsmin17004008528682975135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin17004008528682975135;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin17004008528682975135;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8249809137516907629.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
FORMULA HealthRecord-PT-11-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLFireability-04 finished in 2503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Graph (trivial) has 83 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.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 56 transition count 112
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 56 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 56 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 52 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 52 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 42 place count 52 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 44 place count 50 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 46 place count 50 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 49 place count 50 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 50 place count 49 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 49 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 49 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 47 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 59 place count 47 transition count 80
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 71 place count 41 transition count 113
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 85 place count 41 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 89 place count 39 transition count 116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 90 place count 39 transition count 115
Applied a total of 90 rules in 33 ms. Remains 39 /74 variables (removed 35) and now considering 115/142 (removed 27) transitions.
[2024-05-24 13:37:40] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
// Phase 1: matrix 98 rows 39 cols
[2024-05-24 13:37:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:37:40] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 13:37:40] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-24 13:37:40] [INFO ] Invariant cache hit.
[2024-05-24 13:37:40] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 13:37:40] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-24 13:37:40] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 13:37:40] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-24 13:37:40] [INFO ] Invariant cache hit.
[2024-05-24 13:37:40] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/74 places, 115/142 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 212 ms. Remains : 39/74 places, 115/142 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s25 1), p1:(NEQ s27 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11 reset in 51 ms.
Product exploration explored 100000 steps with 82 reset in 42 ms.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Detected a total of 24/39 stabilizing places and 65/115 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 163 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p1)]
Finished random walk after 2299 steps, including 371 resets, run visited all 1 properties in 9 ms. (steps per millisecond=255 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p0), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Support contains 1 out of 39 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 : 39/39 places, 115/115 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 115/115 (removed 0) transitions.
[2024-05-24 13:37:41] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-24 13:37:41] [INFO ] Invariant cache hit.
[2024-05-24 13:37:41] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-24 13:37:41] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-24 13:37:41] [INFO ] Invariant cache hit.
[2024-05-24 13:37:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-24 13:37:41] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2024-05-24 13:37:41] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 13:37:41] [INFO ] Flow matrix only has 98 transitions (discarded 17 similar events)
[2024-05-24 13:37:41] [INFO ] Invariant cache hit.
[2024-05-24 13:37:41] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 39/39 places, 115/115 transitions.
Computed a total of 24 stabilizing places and 65 stable transitions
Computed a total of 24 stabilizing places and 65 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p1)]
Finished random walk after 9826 steps, including 1563 resets, run visited all 1 properties in 21 ms. (steps per millisecond=467 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1 reset in 40 ms.
Product exploration explored 100000 steps with 5 reset in 79 ms.
Built C files in :
/tmp/ltsmin6444611821204047932
[2024-05-24 13:37:42] [INFO ] Computing symmetric may disable matrix : 115 transitions.
[2024-05-24 13:37:42] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:37:42] [INFO ] Computing symmetric may enable matrix : 115 transitions.
[2024-05-24 13:37:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:37:42] [INFO ] Computing Do-Not-Accords matrix : 115 transitions.
[2024-05-24 13:37:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:37:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6444611821204047932
Running compilation step : cd /tmp/ltsmin6444611821204047932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 220 ms.
Running link step : cd /tmp/ltsmin6444611821204047932;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6444611821204047932;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11343471699034085353.hoa' '--buchi-type=spotba'
LTSmin run took 191 ms.
FORMULA HealthRecord-PT-11-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLFireability-06 finished in 2103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)||(p2 U p3)))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 60 transition count 115
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 60 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 60 transition count 114
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 56 transition count 106
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 56 transition count 106
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 45 place count 56 transition count 98
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 55 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 55 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 54 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 52 place count 54 transition count 90
Applied a total of 52 rules in 6 ms. Remains 54 /74 variables (removed 20) and now considering 90/142 (removed 52) transitions.
[2024-05-24 13:37:42] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 54 cols
[2024-05-24 13:37:42] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:37:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-24 13:37:42] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 13:37:42] [INFO ] Invariant cache hit.
[2024-05-24 13:37:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:42] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 13:37:42] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2024-05-24 13:37:42] [INFO ] Invariant cache hit.
[2024-05-24 13:37:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/74 places, 90/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 54/74 places, 90/142 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(EQ s13 1), p0:(EQ s4 0), p3:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) (NOT p3)))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 131 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-10 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||G(p1)))||(p2 U p3)))'
Support contains 7 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 111
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 53 transition count 99
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 52 place count 53 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 51 transition count 85
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 51 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 51 transition count 82
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 50 transition count 80
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 50 transition count 80
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 50 transition count 77
Applied a total of 64 rules in 8 ms. Remains 50 /74 variables (removed 24) and now considering 77/142 (removed 65) transitions.
[2024-05-24 13:37:43] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
// Phase 1: matrix 74 rows 50 cols
[2024-05-24 13:37:43] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:37:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:37:43] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 13:37:43] [INFO ] Invariant cache hit.
[2024-05-24 13:37:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:43] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 86 ms to find 0 implicit places.
[2024-05-24 13:37:43] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2024-05-24 13:37:43] [INFO ] Invariant cache hit.
[2024-05-24 13:37:43] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 77/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 50/74 places, 77/142 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (OR (EQ s4 0) (EQ s8 0) (EQ s12 0) (EQ s46 0)) (OR (EQ s34 0) (EQ s47 0))), p3:(AND (EQ s34 1) (EQ s40 1)), p2:(AND (EQ s4 1) (EQ s8 1) (EQ s12 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 117 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-11 finished in 757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(X(X(F(p1))))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 54 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 54 transition count 101
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 50 place count 54 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 53 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 53 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 53 transition count 87
Applied a total of 55 rules in 8 ms. Remains 53 /74 variables (removed 21) and now considering 87/142 (removed 55) transitions.
[2024-05-24 13:37:43] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
// Phase 1: matrix 84 rows 53 cols
[2024-05-24 13:37:43] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:37:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 13:37:44] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 13:37:44] [INFO ] Invariant cache hit.
[2024-05-24 13:37:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:44] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-24 13:37:44] [INFO ] Flow matrix only has 84 transitions (discarded 3 similar events)
[2024-05-24 13:37:44] [INFO ] Invariant cache hit.
[2024-05-24 13:37:44] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/74 places, 87/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 53/74 places, 87/142 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(EQ s8 0), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 103 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-11-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-11-LTLFireability-12 finished in 594 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((F(!p1)&&(!p0||X(p2))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 142/142 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 61 transition count 117
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 61 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 61 transition count 116
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 59 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 59 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 34 place count 59 transition count 108
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 35 place count 58 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 36 place count 58 transition count 106
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 39 place count 58 transition count 103
Applied a total of 39 rules in 8 ms. Remains 58 /74 variables (removed 16) and now considering 103/142 (removed 39) transitions.
[2024-05-24 13:37:44] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
// Phase 1: matrix 100 rows 58 cols
[2024-05-24 13:37:44] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 13:37:44] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-24 13:37:44] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 13:37:44] [INFO ] Invariant cache hit.
[2024-05-24 13:37:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:44] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-05-24 13:37:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 13:37:45] [INFO ] Invariant cache hit.
[2024-05-24 13:37:45] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/74 places, 103/142 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 507 ms. Remains : 58/74 places, 103/142 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (NOT p2), true]
Running random walk in product with property : HealthRecord-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s38 1), p1:(OR (EQ s45 1) (EQ s29 1)), p2:(NEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 35 reset in 62 ms.
Product exploration explored 100000 steps with 37 reset in 60 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/58 stabilizing places and 6/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 13 factoid took 234 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Incomplete random walk after 10000 steps, including 677 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:37:45] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 13:37:45] [INFO ] Invariant cache hit.
[2024-05-24 13:37:45] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:37:45] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:37:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:37:45] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:37:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:46] [INFO ] After 22ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:37:46] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 13:37:46] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 103/103 transitions.
Graph (trivial) has 53 edges and 58 vertex of which 10 / 58 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 202 edges and 53 vertex of which 37 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 37 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 27 place count 37 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 39 place count 31 transition count 53
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 27 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 27 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 26 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 26 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 25 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 25 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 23 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 23 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 22 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 21 transition count 38
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 21 transition count 34
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 65 place count 20 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 19 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 19 transition count 32
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 18 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 18 transition count 28
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 18 transition count 27
Applied a total of 74 rules in 17 ms. Remains 18 /58 variables (removed 40) and now considering 27/103 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 18/58 places, 27/103 transitions.
Finished random walk after 35 steps, including 3 resets, run visited all 2 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p0), (X (NOT p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p2)), (F p0)]
Knowledge based reduction with 13 factoid took 369 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 147 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 58/58 places, 103/103 transitions.
Applied a total of 0 rules in 0 ms. Remains 58 /58 variables (removed 0) and now considering 103/103 (removed 0) transitions.
[2024-05-24 13:37:46] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 13:37:46] [INFO ] Invariant cache hit.
[2024-05-24 13:37:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-24 13:37:46] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 13:37:46] [INFO ] Invariant cache hit.
[2024-05-24 13:37:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-24 13:37:46] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 13:37:46] [INFO ] Invariant cache hit.
[2024-05-24 13:37:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 151 ms. Remains : 58/58 places, 103/103 transitions.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Detected a total of 5/58 stabilizing places and 6/103 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (NOT p1)), true, (X (X p2)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 157 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Incomplete random walk after 10000 steps, including 675 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 90 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-24 13:37:47] [INFO ] Flow matrix only has 100 transitions (discarded 3 similar events)
[2024-05-24 13:37:47] [INFO ] Invariant cache hit.
[2024-05-24 13:37:47] [INFO ] [Real]Absence check using 9 positive place invariants in 80 ms returned sat
[2024-05-24 13:37:47] [INFO ] After 397ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:37:47] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:37:47] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:37:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:37:47] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 13:37:47] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 13:37:47] [INFO ] After 147ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 103/103 transitions.
Graph (trivial) has 53 edges and 58 vertex of which 10 / 58 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 202 edges and 53 vertex of which 37 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.0 ms
Discarding 16 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 37 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 27 place count 37 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 39 place count 31 transition count 53
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 27 transition count 45
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 27 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 26 transition count 44
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 26 transition count 44
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 25 transition count 43
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 25 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 25 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 23 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 23 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 22 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 21 transition count 38
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 63 place count 21 transition count 34
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 65 place count 20 transition count 33
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 19 transition count 32
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 19 transition count 32
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 70 place count 19 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 19 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 18 transition count 28
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 18 transition count 28
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 74 place count 18 transition count 27
Applied a total of 74 rules in 29 ms. Remains 18 /58 variables (removed 40) and now considering 27/103 (removed 76) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 18/58 places, 27/103 transitions.
Finished random walk after 53 steps, including 10 resets, run visited all 2 properties in 1 ms. (steps per millisecond=53 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X p0), (X (NOT p1)), true, (X (X p2)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p2)), (F p0)]
Knowledge based reduction with 7 factoid took 276 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 140 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Stuttering acceptance computed with spot in 145 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Product exploration explored 100000 steps with 7 reset in 71 ms.
Product exploration explored 100000 steps with 25 reset in 64 ms.
Applying partial POR strategy [false, true, false, true, true]
Stuttering acceptance computed with spot in 221 ms :[(OR p1 (AND p0 (NOT p2))), p1, (OR p1 (AND p0 (NOT p2))), (NOT p2), true]
Support contains 4 out of 58 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 58/58 places, 103/103 transitions.
Graph (trivial) has 51 edges and 58 vertex of which 10 / 58 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 52 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 52 transition count 95
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 52 transition count 141
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 52 transition count 140
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 22 ms. Remains 52 /58 variables (removed 6) and now considering 140/103 (removed -37) transitions.
[2024-05-24 13:37:49] [INFO ] Redundant transitions in 127 ms returned []
[2024-05-24 13:37:49] [INFO ] Flow matrix only has 126 transitions (discarded 14 similar events)
// Phase 1: matrix 126 rows 52 cols
[2024-05-24 13:37:49] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:37:49] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/58 places, 140/103 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 257 ms. Remains : 52/58 places, 140/103 transitions.
Built C files in :
/tmp/ltsmin2662092532772002838
[2024-05-24 13:37:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2662092532772002838
Running compilation step : cd /tmp/ltsmin2662092532772002838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 164 ms.
Running link step : cd /tmp/ltsmin2662092532772002838;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2662092532772002838;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17162958377763713244.hoa' '--buchi-type=spotba'
LTSmin run took 8875 ms.
FORMULA HealthRecord-PT-11-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-11-LTLFireability-14 finished in 13805 ms.
All properties solved by simple procedures.
Total runtime 37053 ms.

BK_STOP 1716557879437

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-11"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is HealthRecord-PT-11, 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 r197-tall-171640625700488"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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