Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r197-smll-167840344100324.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is HealthRecord-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344100324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 18:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 17:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Feb 26 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 26 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 71K Mar 5 18:22 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-12-LTLFireability-00
FORMULA_NAME HealthRecord-PT-12-LTLFireability-01
FORMULA_NAME HealthRecord-PT-12-LTLFireability-02
FORMULA_NAME HealthRecord-PT-12-LTLFireability-03
FORMULA_NAME HealthRecord-PT-12-LTLFireability-04
FORMULA_NAME HealthRecord-PT-12-LTLFireability-05
FORMULA_NAME HealthRecord-PT-12-LTLFireability-06
FORMULA_NAME HealthRecord-PT-12-LTLFireability-07
FORMULA_NAME HealthRecord-PT-12-LTLFireability-08
FORMULA_NAME HealthRecord-PT-12-LTLFireability-09
FORMULA_NAME HealthRecord-PT-12-LTLFireability-10
FORMULA_NAME HealthRecord-PT-12-LTLFireability-11
FORMULA_NAME HealthRecord-PT-12-LTLFireability-12
FORMULA_NAME HealthRecord-PT-12-LTLFireability-13
FORMULA_NAME HealthRecord-PT-12-LTLFireability-14
FORMULA_NAME HealthRecord-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678513706927

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 05:48:30] [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]
[2023-03-11 05:48:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 05:48:30] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2023-03-11 05:48:30] [INFO ] Transformed 160 places.
[2023-03-11 05:48:30] [INFO ] Transformed 340 transitions.
[2023-03-11 05:48:30] [INFO ] Found NUPN structural information;
[2023-03-11 05:48:30] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 282 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 80 transition count 160
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 80 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 165 place count 75 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 170 place count 75 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 175 place count 75 transition count 145
Applied a total of 175 rules in 52 ms. Remains 75 /160 variables (removed 85) and now considering 145/312 (removed 167) transitions.
[2023-03-11 05:48:31] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
// Phase 1: matrix 141 rows 75 cols
[2023-03-11 05:48:31] [INFO ] Computed 10 place invariants in 16 ms
[2023-03-11 05:48:31] [INFO ] Implicit Places using invariants in 315 ms returned []
[2023-03-11 05:48:31] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
[2023-03-11 05:48:31] [INFO ] Invariant cache hit.
[2023-03-11 05:48:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:31] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 588 ms to find 0 implicit places.
[2023-03-11 05:48:31] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
[2023-03-11 05:48:31] [INFO ] Invariant cache hit.
[2023-03-11 05:48:31] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 75/160 places, 145/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 907 ms. Remains : 75/160 places, 145/312 transitions.
Support contains 28 out of 75 places after structural reductions.
[2023-03-11 05:48:32] [INFO ] Flatten gal took : 77 ms
[2023-03-11 05:48:32] [INFO ] Flatten gal took : 33 ms
[2023-03-11 05:48:32] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 27 out of 75 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 720 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 25) seen :12
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 89 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 88 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-11 05:48:33] [INFO ] Flow matrix only has 141 transitions (discarded 4 similar events)
[2023-03-11 05:48:33] [INFO ] Invariant cache hit.
[2023-03-11 05:48:33] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 05:48:33] [INFO ] [Real]Absence check using 2 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 05:48:34] [INFO ] After 89ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-11 05:48:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:34] [INFO ] After 10ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 05:48:34] [INFO ] After 254ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 05:48:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-11 05:48:34] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 05:48:34] [INFO ] After 173ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2023-03-11 05:48:34] [INFO ] After 93ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :11
[2023-03-11 05:48:34] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 6 ms to minimize.
[2023-03-11 05:48:34] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2023-03-11 05:48:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-11 05:48:34] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2023-03-11 05:48:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2023-03-11 05:48:34] [INFO ] After 474ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :11
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-11 05:48:34] [INFO ] After 891ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :11
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 73 ms.
Support contains 15 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 59 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 6 ms
Free SCC test removed 4 places
Drop transitions removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 303 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 2 place count 70 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 69 transition count 131
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 14 place count 59 transition count 112
Iterating global reduction 0 with 10 rules applied. Total rules applied 24 place count 59 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 59 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 57 transition count 106
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 57 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 57 transition count 104
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 55 transition count 102
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 44 place count 51 transition count 121
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 51 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 50 transition count 120
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 61 place count 50 transition count 120
Applied a total of 61 rules in 80 ms. Remains 50 /75 variables (removed 25) and now considering 120/145 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 50/75 places, 120/145 transitions.
Incomplete random walk after 10000 steps, including 634 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10000 steps, including 118 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 116 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 05:48:35] [INFO ] Flow matrix only has 111 transitions (discarded 9 similar events)
// Phase 1: matrix 111 rows 50 cols
[2023-03-11 05:48:35] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-11 05:48:35] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 05:48:35] [INFO ] After 82ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2023-03-11 05:48:35] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-11 05:48:35] [INFO ] After 29ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:48:35] [INFO ] After 173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 05:48:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 05:48:36] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 05:48:36] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 05:48:36] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 2 ms to minimize.
[2023-03-11 05:48:36] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2023-03-11 05:48:36] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2023-03-11 05:48:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 171 ms
[2023-03-11 05:48:36] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2023-03-11 05:48:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-11 05:48:36] [INFO ] After 285ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-11 05:48:36] [INFO ] After 436ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 120/120 transitions.
Graph (complete) has 244 edges and 50 vertex of which 49 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 45 transition count 112
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 45 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 10 place count 45 transition count 111
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 44 transition count 121
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 44 transition count 118
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 18 place count 41 transition count 118
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 41 transition count 118
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 39 transition count 112
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 39 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 38 transition count 110
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 38 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 38 transition count 106
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 35 place count 38 transition count 104
Applied a total of 35 rules in 63 ms. Remains 38 /50 variables (removed 12) and now considering 104/120 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 38/50 places, 104/120 transitions.
Finished random walk after 1911 steps, including 130 resets, run visited all 3 properties in 28 ms. (steps per millisecond=68 )
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 6 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F((!p0&&X((!p0 U (p1||G(!p0)))))))||(!p1&&F((!p0&&X((!p0 U (p1||G(!p0)))))))))))'
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 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 37 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 53 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 53 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 52 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 52 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 51 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 51 transition count 86
Applied a total of 58 rules in 17 ms. Remains 51 /75 variables (removed 24) and now considering 86/145 (removed 59) transitions.
[2023-03-11 05:48:36] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 51 cols
[2023-03-11 05:48:36] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 05:48:36] [INFO ] Implicit Places using invariants in 80 ms returned []
[2023-03-11 05:48:36] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 05:48:36] [INFO ] Invariant cache hit.
[2023-03-11 05:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:37] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-11 05:48:37] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 05:48:37] [INFO ] Invariant cache hit.
[2023-03-11 05:48:37] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/75 places, 86/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 51/75 places, 86/145 transitions.
Stuttering acceptance computed with spot in 459 ms :[p0, p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s26 1) (EQ s49 1)), p0:(AND (EQ s33 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 489 ms.
Product exploration explored 100000 steps with 2 reset in 295 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 374 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 715 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:48:39] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 05:48:39] [INFO ] Invariant cache hit.
[2023-03-11 05:48:39] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 05:48:39] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:48:39] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 05:48:39] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:48:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:39] [INFO ] After 33ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:48:39] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2023-03-11 05:48:39] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2023-03-11 05:48:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 113 ms
[2023-03-11 05:48:39] [INFO ] After 171ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-11 05:48:39] [INFO ] After 305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 86/86 transitions.
Graph (trivial) has 41 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 181 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 43 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 43 transition count 69
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 11 place count 42 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 37 transition count 105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 37 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 37 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 34 transition count 101
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 34 transition count 99
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 43 place count 34 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 34 transition count 99
Applied a total of 44 rules in 40 ms. Remains 34 /51 variables (removed 17) and now considering 99/86 (removed -13) transitions.
[2023-03-11 05:48:39] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
// Phase 1: matrix 86 rows 34 cols
[2023-03-11 05:48:39] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 05:48:39] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 34/51 places, 99/86 transitions.
Incomplete random walk after 10000 steps, including 702 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Finished Best-First random walk after 5143 steps, including 66 resets, run visited all 2 properties in 22 ms. (steps per millisecond=233 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 410 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 154 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 86/86 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-11 05:48:40] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 51 cols
[2023-03-11 05:48:40] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 05:48:40] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-11 05:48:40] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 05:48:40] [INFO ] Invariant cache hit.
[2023-03-11 05:48:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:40] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-11 05:48:40] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 05:48:40] [INFO ] Invariant cache hit.
[2023-03-11 05:48:40] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 51/51 places, 86/86 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 273 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Incomplete random walk after 10000 steps, including 718 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 05:48:41] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2023-03-11 05:48:41] [INFO ] Invariant cache hit.
[2023-03-11 05:48:41] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-11 05:48:41] [INFO ] After 118ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:48:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 05:48:41] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:48:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:41] [INFO ] After 15ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 05:48:41] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 0 ms to minimize.
[2023-03-11 05:48:41] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 2 ms to minimize.
[2023-03-11 05:48:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2023-03-11 05:48:41] [INFO ] After 163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-11 05:48:41] [INFO ] After 298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 86/86 transitions.
Graph (trivial) has 41 edges and 51 vertex of which 8 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 181 edges and 47 vertex of which 46 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 73
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 71
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 9 place count 43 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 9 place count 43 transition count 69
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 11 place count 42 transition count 69
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 21 place count 37 transition count 105
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 22 place count 37 transition count 104
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 25 place count 37 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 34 transition count 101
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 34 transition count 99
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 43 place count 34 transition count 99
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 44 place count 34 transition count 99
Applied a total of 44 rules in 44 ms. Remains 34 /51 variables (removed 17) and now considering 99/86 (removed -13) transitions.
[2023-03-11 05:48:42] [INFO ] Flow matrix only has 86 transitions (discarded 13 similar events)
// Phase 1: matrix 86 rows 34 cols
[2023-03-11 05:48:42] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 05:48:42] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 34/51 places, 99/86 transitions.
Finished random walk after 2945 steps, including 199 resets, run visited all 2 properties in 41 ms. (steps per millisecond=71 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 386 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 143 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Stuttering acceptance computed with spot in 158 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), p0]
Product exploration explored 100000 steps with 5 reset in 138 ms.
Product exploration explored 100000 steps with 0 reset in 160 ms.
Built C files in :
/tmp/ltsmin3851071909201116665
[2023-03-11 05:48:43] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3851071909201116665
Running compilation step : cd /tmp/ltsmin3851071909201116665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin3851071909201116665;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin3851071909201116665;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16594851970756178771.hoa' '--buchi-type=spotba'
LTSmin run took 423 ms.
FORMULA HealthRecord-PT-12-LTLFireability-00 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-00 finished in 7996 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((G(p1) U p2)&&p0))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 59 transition count 113
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 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 33 place count 59 transition count 112
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 54 transition count 101
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 54 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 48 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 52 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 55 place count 52 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 51 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 51 transition count 86
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 59 place count 51 transition count 84
Applied a total of 59 rules in 13 ms. Remains 51 /75 variables (removed 24) and now considering 84/145 (removed 61) transitions.
[2023-03-11 05:48:44] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 51 cols
[2023-03-11 05:48:44] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 05:48:44] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-11 05:48:44] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-11 05:48:44] [INFO ] Invariant cache hit.
[2023-03-11 05:48:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:44] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-11 05:48:44] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2023-03-11 05:48:45] [INFO ] Invariant cache hit.
[2023-03-11 05:48:45] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/75 places, 84/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 51/75 places, 84/145 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s8 0) (EQ s3 0)), p2:(EQ s8 1), p1:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-02 finished in 631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 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 37 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 53 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 53 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 53 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 51 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 51 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 55 place count 51 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 56 place count 50 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 57 place count 50 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 60 place count 50 transition count 83
Applied a total of 60 rules in 14 ms. Remains 50 /75 variables (removed 25) and now considering 83/145 (removed 62) transitions.
[2023-03-11 05:48:45] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 50 cols
[2023-03-11 05:48:45] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:48:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 05:48:45] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 05:48:45] [INFO ] Invariant cache hit.
[2023-03-11 05:48:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:45] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 05:48:45] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2023-03-11 05:48:45] [INFO ] Invariant cache hit.
[2023-03-11 05:48:45] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 83/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 307 ms. Remains : 50/75 places, 83/145 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s29 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][false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-03 finished in 473 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 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 35 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 53 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 51 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 51 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 58 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 50 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 50 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 63 place count 50 transition count 80
Applied a total of 63 rules in 11 ms. Remains 50 /75 variables (removed 25) and now considering 80/145 (removed 65) transitions.
[2023-03-11 05:48:45] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2023-03-11 05:48:45] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:48:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-11 05:48:45] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 05:48:45] [INFO ] Invariant cache hit.
[2023-03-11 05:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:46] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-11 05:48:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 05:48:46] [INFO ] Invariant cache hit.
[2023-03-11 05:48:46] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 80/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 50/75 places, 80/145 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s19 0), p0:(EQ s26 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-07 finished in 450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 57 transition count 109
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 57 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 37 place count 57 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 53 transition count 99
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 53 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 51 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 51 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 58 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 50 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 50 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 63 place count 50 transition count 80
Applied a total of 63 rules in 9 ms. Remains 50 /75 variables (removed 25) and now considering 80/145 (removed 65) transitions.
[2023-03-11 05:48:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2023-03-11 05:48:46] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:48:46] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 05:48:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 05:48:46] [INFO ] Invariant cache hit.
[2023-03-11 05:48:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:46] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-11 05:48:46] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2023-03-11 05:48:46] [INFO ] Invariant cache hit.
[2023-03-11 05:48:46] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 80/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 50/75 places, 80/145 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s39 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][false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-08 finished in 422 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 88 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 101
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 51 transition count 99
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 46 transition count 88
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 46 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 46 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 44 transition count 77
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 44 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 44 transition count 74
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 43 transition count 72
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 43 transition count 72
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 43 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 73 place count 41 transition count 83
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 41 transition count 82
Applied a total of 74 rules in 43 ms. Remains 41 /75 variables (removed 34) and now considering 82/145 (removed 63) transitions.
[2023-03-11 05:48:46] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
// Phase 1: matrix 73 rows 41 cols
[2023-03-11 05:48:46] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 05:48:46] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 05:48:46] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 05:48:46] [INFO ] Invariant cache hit.
[2023-03-11 05:48:46] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:48:46] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2023-03-11 05:48:46] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-11 05:48:46] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 05:48:46] [INFO ] Invariant cache hit.
[2023-03-11 05:48:47] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/75 places, 82/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 41/75 places, 82/145 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 412 ms.
Product exploration explored 100000 steps with 4 reset in 299 ms.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Detected a total of 12/41 stabilizing places and 25/82 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 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 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 955 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1663 steps, run visited all 1 properties in 19 ms. (steps per millisecond=87 )
Probabilistic random walk after 1663 steps, saw 603 distinct states, run finished after 19 ms. (steps per millisecond=87 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 187 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 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 82/82 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-11 05:48:48] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 05:48:48] [INFO ] Invariant cache hit.
[2023-03-11 05:48:48] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 05:48:48] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 05:48:48] [INFO ] Invariant cache hit.
[2023-03-11 05:48:48] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:48:48] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-11 05:48:48] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 05:48:48] [INFO ] Flow matrix only has 73 transitions (discarded 9 similar events)
[2023-03-11 05:48:48] [INFO ] Invariant cache hit.
[2023-03-11 05:48:48] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 41/41 places, 82/82 transitions.
Computed a total of 12 stabilizing places and 25 stable transitions
Computed a total of 12 stabilizing places and 25 stable transitions
Detected a total of 12/41 stabilizing places and 25/82 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 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 36 ms :[(NOT p0)]
Finished random walk after 8333 steps, including 797 resets, run visited all 1 properties in 20 ms. (steps per millisecond=416 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1 reset in 107 ms.
Product exploration explored 100000 steps with 1 reset in 113 ms.
Built C files in :
/tmp/ltsmin6573440644397287887
[2023-03-11 05:48:49] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2023-03-11 05:48:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:48:49] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2023-03-11 05:48:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:48:49] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2023-03-11 05:48:49] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:48:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6573440644397287887
Running compilation step : cd /tmp/ltsmin6573440644397287887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 410 ms.
Running link step : cd /tmp/ltsmin6573440644397287887;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin6573440644397287887;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11990528163074441206.hoa' '--buchi-type=spotba'
LTSmin run took 120 ms.
FORMULA HealthRecord-PT-12-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-09 finished in 3480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))&&F(p2)))'
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 58 transition count 111
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 53 transition count 100
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 53 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 50 place count 53 transition count 94
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 51 transition count 89
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 51 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 51 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 50 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 50 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 50 transition count 81
Applied a total of 62 rules in 8 ms. Remains 50 /75 variables (removed 25) and now considering 81/145 (removed 64) transitions.
[2023-03-11 05:48:50] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
// Phase 1: matrix 78 rows 50 cols
[2023-03-11 05:48:50] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:48:50] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 05:48:50] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-11 05:48:50] [INFO ] Invariant cache hit.
[2023-03-11 05:48:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:50] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-11 05:48:50] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2023-03-11 05:48:50] [INFO ] Invariant cache hit.
[2023-03-11 05:48:50] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/75 places, 81/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 50/75 places, 81/145 transitions.
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s3 1), p2:(AND (EQ s12 1) (EQ s48 1)), p1:(AND (EQ s34 1) (EQ s38 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-10 finished in 512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||G(p2)))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 59 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 59 transition count 114
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 59 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 55 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 55 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 53 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 53 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 52 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 55 place count 52 transition count 89
Applied a total of 55 rules in 6 ms. Remains 52 /75 variables (removed 23) and now considering 89/145 (removed 56) transitions.
[2023-03-11 05:48:50] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 05:48:50] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 05:48:50] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 05:48:50] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 05:48:50] [INFO ] Invariant cache hit.
[2023-03-11 05:48:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:50] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 05:48:50] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 05:48:50] [INFO ] Invariant cache hit.
[2023-03-11 05:48:51] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/75 places, 89/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 284 ms. Remains : 52/75 places, 89/145 transitions.
Stuttering acceptance computed with spot in 344 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(EQ s11 0), p2:(NEQ s17 1), p1:(OR (EQ s3 0) (EQ s7 0) (EQ s12 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 162 ms.
Product exploration explored 100000 steps with 3 reset in 144 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 37 factoid took 2032 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter sensitive) to 9 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 390 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 721 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 91 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 05:48:54] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 05:48:54] [INFO ] Invariant cache hit.
[2023-03-11 05:48:54] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 05:48:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 05:48:55] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2023-03-11 05:48:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:55] [INFO ] After 51ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :8
[2023-03-11 05:48:55] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-11 05:48:55] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 30 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 183 edges and 48 vertex of which 33 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 33 transition count 52
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 23 place count 33 transition count 48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 29 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 26 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 25 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 25 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 24 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 24 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 24 transition count 38
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 46 place count 22 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 21 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 18 transition count 34
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 18 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 54 place count 18 transition count 29
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 16 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 16 transition count 25
Applied a total of 63 rules in 20 ms. Remains 16 /52 variables (removed 36) and now considering 25/89 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 16/52 places, 25/89 transitions.
Incomplete random walk after 10000 steps, including 716 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 714 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 25 rows 16 cols
[2023-03-11 05:48:55] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 05:48:55] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 05:48:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 05:48:55] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 05:48:55] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 05:48:55] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 16/16 places, 25/25 transitions.
Incomplete random walk after 10000 steps, including 745 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 906 steps, run visited all 2 properties in 11 ms. (steps per millisecond=82 )
Probabilistic random walk after 906 steps, saw 274 distinct states, run finished after 11 ms. (steps per millisecond=82 ) properties seen :2
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (AND p0 p1 p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p1 p2)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), true, (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X (AND p0 p1 p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p2 (NOT p0))), (F (AND (NOT p2) (NOT p0))), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p1)), (F (NOT (AND p0 p1))), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND p2 p1))), (F (NOT p2)), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT (AND p2 p0 p1))), (F (AND (NOT p2) p0 p1)), (F (NOT (AND p2 p0))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 40 factoid took 2564 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 454 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 449 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2023-03-11 05:48:59] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 05:48:59] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 05:48:59] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 05:48:59] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 05:48:59] [INFO ] Invariant cache hit.
[2023-03-11 05:48:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:48:59] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-11 05:48:59] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 05:48:59] [INFO ] Invariant cache hit.
[2023-03-11 05:48:59] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 52/52 places, 89/89 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0)))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 1608 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 444 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 732 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-11 05:49:02] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 05:49:02] [INFO ] Invariant cache hit.
[2023-03-11 05:49:02] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-11 05:49:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 05:49:02] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-11 05:49:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:49:02] [INFO ] After 59ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-11 05:49:02] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-11 05:49:02] [INFO ] After 390ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 183 edges and 48 vertex of which 33 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 33 transition count 52
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 23 place count 33 transition count 48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 29 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 26 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 25 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 25 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 24 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 24 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 24 transition count 38
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 46 place count 22 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 21 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 18 transition count 34
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 18 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 54 place count 18 transition count 29
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 16 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 16 transition count 25
Applied a total of 63 rules in 27 ms. Remains 16 /52 variables (removed 36) and now considering 25/89 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 16/52 places, 25/89 transitions.
Incomplete random walk after 10000 steps, including 710 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 16 cols
[2023-03-11 05:49:02] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 05:49:02] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 05:49:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 05:49:02] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 05:49:02] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 05:49:02] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16/16 places, 25/25 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 16 transition count 24
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 15 transition count 23
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 15 transition count 23
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 15 transition count 22
Applied a total of 4 rules in 4 ms. Remains 15 /16 variables (removed 1) and now considering 22/25 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 15/16 places, 22/25 transitions.
Incomplete random walk after 10000 steps, including 634 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 110 steps, run visited all 1 properties in 4 ms. (steps per millisecond=27 )
Probabilistic random walk after 110 steps, saw 77 distinct states, run finished after 5 ms. (steps per millisecond=22 ) properties seen :1
Knowledge obtained : [(AND p2 p1 p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 p0 p1)), (X (NOT (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 p0 p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND (NOT p0) (NOT p2))), (F (AND p0 (NOT p2))), (F (AND p1 (NOT p2))), (F (AND (NOT p1) p2)), (F (NOT (AND p1 p0 p2))), (F (NOT p0)), (F (AND p1 p0 (NOT p2))), (F (NOT (AND p1 p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (NOT (AND p0 p2)))]
Knowledge based reduction with 20 factoid took 2000 ms. Reduced automaton from 9 states, 25 edges and 3 AP (stutter sensitive) to 9 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 466 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 553 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 443 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 0 reset in 226 ms.
Applying partial POR strategy [true, false, true, true, true, true, true, false, false]
Stuttering acceptance computed with spot in 457 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 83
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 83
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 47 transition count 82
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 47 transition count 108
Deduced a syphon composed of 4 places in 1 ms
Applied a total of 8 rules in 12 ms. Remains 47 /52 variables (removed 5) and now considering 108/89 (removed -19) transitions.
[2023-03-11 05:49:07] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-11 05:49:07] [INFO ] Flow matrix only has 94 transitions (discarded 14 similar events)
// Phase 1: matrix 94 rows 47 cols
[2023-03-11 05:49:07] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:49:07] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/52 places, 108/89 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 47/52 places, 108/89 transitions.
Built C files in :
/tmp/ltsmin2699218414048780802
[2023-03-11 05:49:07] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2699218414048780802
Running compilation step : cd /tmp/ltsmin2699218414048780802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 388 ms.
Running link step : cd /tmp/ltsmin2699218414048780802;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2699218414048780802;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14610448177144703220.hoa' '--buchi-type=spotba'
LTSmin run took 7495 ms.
FORMULA HealthRecord-PT-12-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-11 finished in 24777 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)))&&F(p2))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 83 edges and 75 vertex of which 6 / 75 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 53 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 53 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 39 place count 53 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 49 transition count 95
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 49 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 53 place count 49 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 48 transition count 86
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 47 transition count 84
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 47 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 45 transition count 96
Applied a total of 64 rules in 9 ms. Remains 45 /75 variables (removed 30) and now considering 96/145 (removed 49) transitions.
[2023-03-11 05:49:15] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
// Phase 1: matrix 88 rows 45 cols
[2023-03-11 05:49:15] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-11 05:49:15] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 05:49:15] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2023-03-11 05:49:15] [INFO ] Invariant cache hit.
[2023-03-11 05:49:15] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 05:49:15] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-11 05:49:15] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-11 05:49:15] [INFO ] Flow matrix only has 88 transitions (discarded 8 similar events)
[2023-03-11 05:49:15] [INFO ] Invariant cache hit.
[2023-03-11 05:49:15] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/75 places, 96/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 246 ms. Remains : 45/75 places, 96/145 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s13 1), p2:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-12 finished in 392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((p0 U p1)&&X((p2 U X(!p1)))))))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 58 transition count 111
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 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 35 place count 58 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 54 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 54 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 54 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 53 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 53 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 54 place count 53 transition count 90
Applied a total of 54 rules in 6 ms. Remains 53 /75 variables (removed 22) and now considering 90/145 (removed 55) transitions.
[2023-03-11 05:49:15] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
// Phase 1: matrix 87 rows 53 cols
[2023-03-11 05:49:15] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:49:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 05:49:16] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2023-03-11 05:49:16] [INFO ] Invariant cache hit.
[2023-03-11 05:49:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 05:49:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-11 05:49:16] [INFO ] Flow matrix only has 87 transitions (discarded 3 similar events)
[2023-03-11 05:49:16] [INFO ] Invariant cache hit.
[2023-03-11 05:49:16] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/75 places, 90/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 53/75 places, 90/145 transitions.
Stuttering acceptance computed with spot in 333 ms :[true, true, (NOT p1), p1, p1, p1]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(OR p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(OR p1 p0 p2), acceptance={0} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 3}], [{ cond=p1, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s3 1), p0:(EQ s4 1), p2:(EQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-13 finished in 604 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 83 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 51 transition count 100
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 47 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 47 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 47 transition count 86
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 46 transition count 83
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 46 transition count 83
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 45 transition count 81
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 45 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 45 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 43 transition count 97
Applied a total of 66 rules in 12 ms. Remains 43 /75 variables (removed 32) and now considering 97/145 (removed 48) transitions.
[2023-03-11 05:49:16] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
// Phase 1: matrix 88 rows 43 cols
[2023-03-11 05:49:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:49:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-11 05:49:16] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 05:49:16] [INFO ] Invariant cache hit.
[2023-03-11 05:49:16] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 05:49:16] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2023-03-11 05:49:16] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-11 05:49:16] [INFO ] Flow matrix only has 88 transitions (discarded 9 similar events)
[2023-03-11 05:49:16] [INFO ] Invariant cache hit.
[2023-03-11 05:49:16] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/75 places, 97/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 43/75 places, 97/145 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s30 1) (EQ s33 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-14 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 145/145 transitions.
Graph (trivial) has 87 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 41 place count 51 transition count 100
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 46 transition count 89
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 46 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 57 place count 46 transition count 83
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 44 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 44 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 44 transition count 75
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 43 transition count 73
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 43 transition count 73
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 43 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 73 place count 41 transition count 84
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 41 transition count 83
Applied a total of 74 rules in 19 ms. Remains 41 /75 variables (removed 34) and now considering 83/145 (removed 62) transitions.
[2023-03-11 05:49:16] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
// Phase 1: matrix 75 rows 41 cols
[2023-03-11 05:49:16] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 05:49:16] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-11 05:49:16] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 05:49:16] [INFO ] Invariant cache hit.
[2023-03-11 05:49:16] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:49:17] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-11 05:49:17] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 05:49:17] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 05:49:17] [INFO ] Invariant cache hit.
[2023-03-11 05:49:17] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/75 places, 83/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 340 ms. Remains : 41/75 places, 83/145 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-15 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:(EQ s18 0)], 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 0 reset in 51 ms.
Product exploration explored 100000 steps with 0 reset in 60 ms.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 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 64 ms :[(NOT p0), (NOT p0)]
Finished random walk after 676 steps, including 64 resets, run visited all 1 properties in 3 ms. (steps per millisecond=225 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 83/83 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-11 05:49:17] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 05:49:17] [INFO ] Invariant cache hit.
[2023-03-11 05:49:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2023-03-11 05:49:17] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 05:49:17] [INFO ] Invariant cache hit.
[2023-03-11 05:49:17] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-11 05:49:18] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2023-03-11 05:49:18] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 05:49:18] [INFO ] Flow matrix only has 75 transitions (discarded 8 similar events)
[2023-03-11 05:49:18] [INFO ] Invariant cache hit.
[2023-03-11 05:49:18] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 41/41 places, 83/83 transitions.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 158 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 99 ms :[(NOT p0), (NOT p0)]
Finished random walk after 258 steps, including 23 resets, run visited all 1 properties in 2 ms. (steps per millisecond=129 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 179 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 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 84 ms.
Product exploration explored 100000 steps with 1 reset in 100 ms.
Built C files in :
/tmp/ltsmin6913256266074876106
[2023-03-11 05:49:19] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2023-03-11 05:49:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:49:19] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2023-03-11 05:49:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:49:19] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2023-03-11 05:49:19] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 05:49:19] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6913256266074876106
Running compilation step : cd /tmp/ltsmin6913256266074876106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 395 ms.
Running link step : cd /tmp/ltsmin6913256266074876106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin6913256266074876106;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9682581594605323376.hoa' '--buchi-type=spotba'
LTSmin run took 169 ms.
FORMULA HealthRecord-PT-12-LTLFireability-15 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-15 finished in 2943 ms.
All properties solved by simple procedures.
Total runtime 49471 ms.

BK_STOP 1678513760955

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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