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.r199-smll-167840345800348.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 lolaxred
Input is HealthRecord-PT-15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345800348
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.4K Feb 26 17:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 17:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 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 73K 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-15-LTLFireability-00
FORMULA_NAME HealthRecord-PT-15-LTLFireability-01
FORMULA_NAME HealthRecord-PT-15-LTLFireability-02
FORMULA_NAME HealthRecord-PT-15-LTLFireability-03
FORMULA_NAME HealthRecord-PT-15-LTLFireability-04
FORMULA_NAME HealthRecord-PT-15-LTLFireability-05
FORMULA_NAME HealthRecord-PT-15-LTLFireability-06
FORMULA_NAME HealthRecord-PT-15-LTLFireability-07
FORMULA_NAME HealthRecord-PT-15-LTLFireability-08
FORMULA_NAME HealthRecord-PT-15-LTLFireability-09
FORMULA_NAME HealthRecord-PT-15-LTLFireability-10
FORMULA_NAME HealthRecord-PT-15-LTLFireability-11
FORMULA_NAME HealthRecord-PT-15-LTLFireability-12
FORMULA_NAME HealthRecord-PT-15-LTLFireability-13
FORMULA_NAME HealthRecord-PT-15-LTLFireability-14
FORMULA_NAME HealthRecord-PT-15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678521088062

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 07:51:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 07:51:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 07:51:32] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2023-03-11 07:51:32] [INFO ] Transformed 163 places.
[2023-03-11 07:51:32] [INFO ] Transformed 348 transitions.
[2023-03-11 07:51:32] [INFO ] Found NUPN structural information;
[2023-03-11 07:51:32] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 306 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 2 formulas.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
FORMULA HealthRecord-PT-15-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 82 transition count 163
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 82 transition count 163
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 170 place count 74 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 178 place count 74 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 182 place count 74 transition count 143
Applied a total of 182 rules in 51 ms. Remains 74 /163 variables (removed 89) and now considering 143/319 (removed 176) transitions.
[2023-03-11 07:51:32] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
// Phase 1: matrix 137 rows 74 cols
[2023-03-11 07:51:32] [INFO ] Computed 12 place invariants in 14 ms
[2023-03-11 07:51:33] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-11 07:51:33] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
[2023-03-11 07:51:33] [INFO ] Invariant cache hit.
[2023-03-11 07:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:33] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2023-03-11 07:51:33] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
[2023-03-11 07:51:33] [INFO ] Invariant cache hit.
[2023-03-11 07:51:33] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 74/163 places, 143/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 955 ms. Remains : 74/163 places, 143/319 transitions.
Support contains 34 out of 74 places after structural reductions.
[2023-03-11 07:51:33] [INFO ] Flatten gal took : 103 ms
[2023-03-11 07:51:34] [INFO ] Flatten gal took : 40 ms
[2023-03-11 07:51:34] [INFO ] Input system was already deterministic with 143 transitions.
Support contains 32 out of 74 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 916 resets, run finished after 945 ms. (steps per millisecond=10 ) properties (out of 29) seen :14
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 12 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 12 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 11 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-11 07:51:35] [INFO ] Flow matrix only has 137 transitions (discarded 6 similar events)
[2023-03-11 07:51:35] [INFO ] Invariant cache hit.
[2023-03-11 07:51:35] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-11 07:51:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-03-11 07:51:35] [INFO ] [Nat]Absence check using 4 positive and 8 generalized place invariants in 8 ms returned sat
[2023-03-11 07:51:35] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-11 07:51:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:35] [INFO ] After 149ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :14
[2023-03-11 07:51:36] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 7 ms to minimize.
[2023-03-11 07:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-11 07:51:36] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2023-03-11 07:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-11 07:51:36] [INFO ] After 502ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 108 ms.
[2023-03-11 07:51:36] [INFO ] After 1041ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 16 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 143/143 transitions.
Graph (trivial) has 57 edges and 74 vertex of which 4 / 74 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (complete) has 316 edges and 72 vertex of which 70 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 8 place count 64 transition count 120
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 64 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 62 transition count 115
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 62 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 61 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 61 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 61 transition count 111
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 1 with 4 rules applied. Total rules applied 26 place count 59 transition count 109
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 38 place count 53 transition count 148
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 53 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 53 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 48 place count 51 transition count 140
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 51 transition count 140
Applied a total of 60 rules in 53 ms. Remains 51 /74 variables (removed 23) and now considering 140/143 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 51/74 places, 140/143 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 475 ms. (steps per millisecond=21 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10000 steps, including 113 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 12 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 144 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 07:51:37] [INFO ] Flow matrix only has 126 transitions (discarded 14 similar events)
// Phase 1: matrix 126 rows 51 cols
[2023-03-11 07:51:37] [INFO ] Computed 10 place invariants in 3 ms
[2023-03-11 07:51:37] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:51:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-11 07:51:37] [INFO ] [Nat]Absence check using 2 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 07:51:37] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:51:37] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-11 07:51:37] [INFO ] After 26ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:51:37] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-11 07:51:37] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 140/140 transitions.
Graph (trivial) has 22 edges and 51 vertex of which 2 / 51 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 252 edges and 50 vertex of which 48 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 5 place count 45 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 45 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 45 transition count 132
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 1 with 4 rules applied. Total rules applied 13 place count 43 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 42 transition count 130
Free-agglomeration rule applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 42 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 40 transition count 128
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 40 transition count 126
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 35 place count 40 transition count 126
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 38 place count 40 transition count 126
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 39 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 39 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 39 transition count 119
Applied a total of 45 rules in 79 ms. Remains 39 /51 variables (removed 12) and now considering 119/140 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 39/51 places, 119/140 transitions.
Incomplete random walk after 10000 steps, including 767 resets, run finished after 220 ms. (steps per millisecond=45 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 145 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :1
Running SMT prover for 2 properties.
[2023-03-11 07:51:38] [INFO ] Flow matrix only has 99 transitions (discarded 20 similar events)
// Phase 1: matrix 99 rows 39 cols
[2023-03-11 07:51:38] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-11 07:51:38] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 07:51:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 07:51:38] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 07:51:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-11 07:51:38] [INFO ] After 24ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 07:51:38] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2023-03-11 07:51:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-11 07:51:38] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 07:51:38] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 39/39 places, 119/119 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 37 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 37 transition count 113
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 36 transition count 111
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 36 transition count 111
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 11 place count 36 transition count 106
Applied a total of 11 rules in 46 ms. Remains 36 /39 variables (removed 3) and now considering 106/119 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 36/39 places, 106/119 transitions.
Incomplete random walk after 10000 steps, including 773 resets, run finished after 198 ms. (steps per millisecond=50 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 152 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:51:38] [INFO ] Flow matrix only has 88 transitions (discarded 18 similar events)
// Phase 1: matrix 88 rows 36 cols
[2023-03-11 07:51:38] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 07:51:38] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:51:38] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 07:51:38] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 07:51:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-11 07:51:38] [INFO ] After 14ms SMT Verify possible using 22 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 07:51:38] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 07:51:38] [INFO ] After 131ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 106/106 transitions.
Graph (complete) has 141 edges and 36 vertex of which 28 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 28 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 25 transition count 79
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 25 transition count 79
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 29 place count 25 transition count 71
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 24 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 24 transition count 67
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 23 transition count 66
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 23 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 23 transition count 63
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 3 with 4 rules applied. Total rules applied 40 place count 21 transition count 61
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 21 transition count 59
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 51 place count 21 transition count 59
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 59 place count 21 transition count 51
Applied a total of 59 rules in 35 ms. Remains 21 /36 variables (removed 15) and now considering 51/106 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 21/36 places, 51/106 transitions.
Incomplete random walk after 10000 steps, including 954 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Finished Best-First random walk after 1237 steps, including 23 resets, run visited all 1 properties in 3 ms. (steps per millisecond=412 )
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA HealthRecord-PT-15-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 8 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(p0))||(p1 U (p2||G(p1)))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 57 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 57 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 57 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 54 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 54 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 52 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 52 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 55 place count 52 transition count 89
Applied a total of 55 rules in 12 ms. Remains 52 /74 variables (removed 22) and now considering 89/143 (removed 54) transitions.
[2023-03-11 07:51:39] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 07:51:39] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:51:39] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 07:51:39] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:51:39] [INFO ] Invariant cache hit.
[2023-03-11 07:51:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:39] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-11 07:51:39] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:51:39] [INFO ] Invariant cache hit.
[2023-03-11 07:51:40] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/74 places, 89/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 328 ms. Remains : 52/74 places, 89/143 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s41 0), p2:(AND (NEQ s4 1) (EQ s5 1) (EQ s50 1)), p1:(AND (EQ s5 1) (EQ s50 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]]
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Product exploration explored 100000 steps with 50000 reset in 498 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p0), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 187 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-00 finished in 2093 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 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Graph (trivial) has 84 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 1 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 52 transition count 105
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 52 transition count 105
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 43 place count 52 transition count 99
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 48 transition count 88
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 48 transition count 88
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 45 transition count 82
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 45 transition count 82
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 66 place count 45 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
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 70 place count 43 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 43 transition count 86
Applied a total of 71 rules in 35 ms. Remains 43 /74 variables (removed 31) and now considering 86/143 (removed 57) transitions.
[2023-03-11 07:51:41] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
// Phase 1: matrix 78 rows 43 cols
[2023-03-11 07:51:41] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:51:41] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-11 07:51:41] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:41] [INFO ] Invariant cache hit.
[2023-03-11 07:51:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:51:41] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-11 07:51:42] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-11 07:51:42] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:42] [INFO ] Invariant cache hit.
[2023-03-11 07:51:42] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/74 places, 86/143 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 405 ms. Remains : 43/74 places, 86/143 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s11 0)], 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 12 reset in 436 ms.
Product exploration explored 100000 steps with 0 reset in 190 ms.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Detected a total of 11/43 stabilizing places and 25/86 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 225 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 51 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1045 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2191 steps, run visited all 1 properties in 24 ms. (steps per millisecond=91 )
Probabilistic random walk after 2191 steps, saw 781 distinct states, run finished after 34 ms. (steps per millisecond=64 ) 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 259 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 69 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 86/86 transitions.
Applied a total of 0 rules in 19 ms. Remains 43 /43 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-11 07:51:43] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:43] [INFO ] Invariant cache hit.
[2023-03-11 07:51:43] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-11 07:51:43] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:43] [INFO ] Invariant cache hit.
[2023-03-11 07:51:43] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:51:43] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-11 07:51:43] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-11 07:51:43] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:43] [INFO ] Invariant cache hit.
[2023-03-11 07:51:43] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 43/43 places, 86/86 transitions.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Detected a total of 11/43 stabilizing places and 25/86 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 221 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 48 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1045 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 2191 steps, run visited all 1 properties in 19 ms. (steps per millisecond=115 )
Probabilistic random walk after 2191 steps, saw 781 distinct states, run finished after 19 ms. (steps per millisecond=115 ) 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 241 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 528 ms.
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 86/86 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 86/86 (removed 0) transitions.
[2023-03-11 07:51:45] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:45] [INFO ] Invariant cache hit.
[2023-03-11 07:51:45] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-11 07:51:45] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:45] [INFO ] Invariant cache hit.
[2023-03-11 07:51:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:51:45] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-11 07:51:45] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-11 07:51:45] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2023-03-11 07:51:45] [INFO ] Invariant cache hit.
[2023-03-11 07:51:45] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 43/43 places, 86/86 transitions.
Treatment of property HealthRecord-PT-15-LTLFireability-02 finished in 4007 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)||G((p1&&F(p0)))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Graph (trivial) has 72 edges and 74 vertex of which 6 / 74 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 52 transition count 106
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 52 transition count 106
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 42 place count 52 transition count 101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 48 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 53 place count 45 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 56 place count 45 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 45 transition count 75
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 2 with 4 rules applied. Total rules applied 69 place count 43 transition count 89
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 43 transition count 88
Applied a total of 70 rules in 18 ms. Remains 43 /74 variables (removed 31) and now considering 88/143 (removed 55) transitions.
[2023-03-11 07:51:45] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
// Phase 1: matrix 81 rows 43 cols
[2023-03-11 07:51:45] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:45] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 07:51:45] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2023-03-11 07:51:45] [INFO ] Invariant cache hit.
[2023-03-11 07:51:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:51:45] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-11 07:51:45] [INFO ] Redundant transitions in 34 ms returned []
[2023-03-11 07:51:45] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2023-03-11 07:51:45] [INFO ] Invariant cache hit.
[2023-03-11 07:51:46] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/74 places, 88/143 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 43/74 places, 88/143 transitions.
Stuttering acceptance computed with spot in 268 ms :[(NOT p0), true, (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s9 0), p1:(OR (EQ s6 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 1 reset in 181 ms.
Product exploration explored 100000 steps with 3 reset in 499 ms.
Computed a total of 8 stabilizing places and 19 stable transitions
Computed a total of 8 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 809 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 5 states, 12 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 231 ms :[(NOT p0), true, (NOT p0), (NOT p0), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1053 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 126 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 124 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 07:51:48] [INFO ] Flow matrix only has 81 transitions (discarded 7 similar events)
[2023-03-11 07:51:48] [INFO ] Invariant cache hit.
[2023-03-11 07:51:48] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 07:51:48] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2023-03-11 07:51:48] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 07:51:48] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-11 07:51:48] [INFO ] After 38ms SMT Verify possible using 14 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 07:51:48] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-11 07:51:48] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 43/43 places, 88/88 transitions.
Graph (complete) has 152 edges and 43 vertex of which 30 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 30 transition count 62
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 22 place count 30 transition count 56
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 40 place count 18 transition count 56
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 54 place count 18 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 56 place count 16 transition count 42
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 56 place count 16 transition count 41
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 58 place count 15 transition count 41
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 14 transition count 40
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 14 transition count 40
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 13 transition count 36
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 13 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 13 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 12 transition count 34
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 68 place count 12 transition count 31
Applied a total of 68 rules in 17 ms. Remains 12 /43 variables (removed 31) and now considering 31/88 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 12/43 places, 31/88 transitions.
Finished random walk after 1548 steps, including 130 resets, run visited all 3 properties in 9 ms. (steps per millisecond=172 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) p1)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 14 factoid took 502 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-03 finished in 3613 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(p0)||(p1 U (p2||G(p1)))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Graph (trivial) has 79 edges and 74 vertex of which 6 / 74 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 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 53 transition count 108
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 53 transition count 108
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 40 place count 53 transition count 103
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 50 transition count 95
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 50 transition count 95
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 48 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 48 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 48 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
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 60 place count 46 transition count 104
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 46 transition count 103
Applied a total of 61 rules in 31 ms. Remains 46 /74 variables (removed 28) and now considering 103/143 (removed 40) transitions.
[2023-03-11 07:51:49] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
// Phase 1: matrix 95 rows 46 cols
[2023-03-11 07:51:49] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-11 07:51:49] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-11 07:51:49] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:49] [INFO ] Invariant cache hit.
[2023-03-11 07:51:49] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-11 07:51:49] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-11 07:51:49] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-11 07:51:49] [INFO ] Flow matrix only has 95 transitions (discarded 8 similar events)
[2023-03-11 07:51:49] [INFO ] Invariant cache hit.
[2023-03-11 07:51:49] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/74 places, 103/143 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 371 ms. Remains : 46/74 places, 103/143 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s2 1), p2:(AND (NEQ s36 1) (EQ s15 1)), p1:(EQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-06 finished in 495 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 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 56 transition count 110
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 56 transition count 110
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 56 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 52 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 52 transition count 94
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 49 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 49 transition count 88
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 49 transition count 79
Applied a total of 64 rules in 9 ms. Remains 49 /74 variables (removed 25) and now considering 79/143 (removed 64) transitions.
[2023-03-11 07:51:49] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2023-03-11 07:51:49] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:49] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 07:51:49] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:51:49] [INFO ] Invariant cache hit.
[2023-03-11 07:51:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:50] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 07:51:50] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2023-03-11 07:51:50] [INFO ] Invariant cache hit.
[2023-03-11 07:51:50] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/74 places, 79/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 49/74 places, 79/143 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-07 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 s33 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 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-07 finished in 491 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 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 57 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 57 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 57 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 53 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 53 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 50 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 50 transition count 90
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 61 place count 50 transition count 82
Applied a total of 61 rules in 9 ms. Remains 50 /74 variables (removed 24) and now considering 82/143 (removed 61) transitions.
[2023-03-11 07:51:50] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
// Phase 1: matrix 79 rows 50 cols
[2023-03-11 07:51:50] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-11 07:51:50] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-11 07:51:50] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2023-03-11 07:51:50] [INFO ] Invariant cache hit.
[2023-03-11 07:51:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:50] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 07:51:50] [INFO ] Flow matrix only has 79 transitions (discarded 3 similar events)
[2023-03-11 07:51:50] [INFO ] Invariant cache hit.
[2023-03-11 07:51:50] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/74 places, 82/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 50/74 places, 82/143 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-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 s4 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 11 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-08 finished in 442 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 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 58 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 55 transition count 101
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 53 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 53 transition count 97
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 53 transition count 91
Applied a total of 53 rules in 7 ms. Remains 53 /74 variables (removed 21) and now considering 91/143 (removed 52) transitions.
[2023-03-11 07:51:50] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 53 cols
[2023-03-11 07:51:50] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:51:50] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2023-03-11 07:51:50] [INFO ] Invariant cache hit.
[2023-03-11 07:51:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:50] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-11 07:51:50] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2023-03-11 07:51:50] [INFO ] Invariant cache hit.
[2023-03-11 07:51:51] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/74 places, 91/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 340 ms. Remains : 53/74 places, 91/143 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s19 1) (EQ s8 0))], 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]]
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-09 finished in 958 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((X((X(p1) U p2))||F(p3)||p0)))'
Support contains 5 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 114
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 37 place count 58 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 54 transition count 98
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 54 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 52 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 52 transition count 94
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 52 transition count 88
Applied a total of 55 rules in 7 ms. Remains 52 /74 variables (removed 22) and now considering 88/143 (removed 55) transitions.
[2023-03-11 07:51:51] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 52 cols
[2023-03-11 07:51:51] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 07:51:51] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 07:51:51] [INFO ] Invariant cache hit.
[2023-03-11 07:51:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:51] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-11 07:51:51] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 07:51:51] [INFO ] Invariant cache hit.
[2023-03-11 07:51:52] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/74 places, 88/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 52/74 places, 88/143 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s15 0) (EQ s50 0) (EQ s24 1)), p3:(EQ s47 0), p2:(NEQ s24 1), p1:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 219 ms.
Product exploration explored 100000 steps with 4 reset in 213 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p3 p2 (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 4 states, 6 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p3)]
Incomplete random walk after 10000 steps, including 921 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 119 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 1018481 steps, run timeout after 3001 ms. (steps per millisecond=339 ) properties seen :{}
Probabilistic random walk after 1018481 steps, saw 117538 distinct states, run finished after 3003 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-11 07:51:56] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2023-03-11 07:51:56] [INFO ] Invariant cache hit.
[2023-03-11 07:51:56] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 07:51:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:51:57] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-11 07:51:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:57] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2023-03-11 07:51:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2023-03-11 07:51:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 39 ms
[2023-03-11 07:51:57] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-11 07:51:57] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 88/88 transitions.
Graph (trivial) has 42 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 183 edges and 49 vertex of which 48 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 76
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 46 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 45 transition count 74
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -34
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 21 place count 39 transition count 108
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 39 transition count 107
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 39 transition count 103
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 30 place count 35 transition count 103
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 32 place count 35 transition count 101
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 43 place count 35 transition count 101
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 52 place count 35 transition count 101
Applied a total of 52 rules in 19 ms. Remains 35 /52 variables (removed 17) and now considering 101/88 (removed -13) transitions.
[2023-03-11 07:51:57] [INFO ] Flow matrix only has 83 transitions (discarded 18 similar events)
// Phase 1: matrix 83 rows 35 cols
[2023-03-11 07:51:57] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 07:51:57] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 35/52 places, 101/88 transitions.
Incomplete random walk after 10000 steps, including 778 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 149 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Finished probabilistic random walk after 4099 steps, run visited all 3 properties in 28 ms. (steps per millisecond=146 )
Probabilistic random walk after 4099 steps, saw 1219 distinct states, run finished after 28 ms. (steps per millisecond=146 ) properties seen :3
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p3 p2 (NOT p1)), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1)))), (G (NOT (AND (NOT p3) (NOT p0)))), (G (NOT (AND p1 (NOT p2) (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p3) (NOT p0))))
Knowledge based reduction with 6 factoid took 285 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-10 finished in 6307 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))||(p0&&(p2 U X(G(p3))))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Graph (trivial) has 75 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 54 transition count 109
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 54 transition count 109
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 41 place count 54 transition count 103
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 50 transition count 92
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 50 transition count 92
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 47 transition count 86
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 47 transition count 86
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 47 transition count 78
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 75 place count 41 transition count 111
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 41 transition count 110
Applied a total of 76 rules in 15 ms. Remains 41 /74 variables (removed 33) and now considering 110/143 (removed 33) transitions.
[2023-03-11 07:51:58] [INFO ] Flow matrix only has 93 transitions (discarded 17 similar events)
// Phase 1: matrix 93 rows 41 cols
[2023-03-11 07:51:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:58] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-11 07:51:58] [INFO ] Flow matrix only has 93 transitions (discarded 17 similar events)
[2023-03-11 07:51:58] [INFO ] Invariant cache hit.
[2023-03-11 07:51:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 07:51:58] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-11 07:51:58] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-11 07:51:58] [INFO ] Flow matrix only has 93 transitions (discarded 17 similar events)
[2023-03-11 07:51:58] [INFO ] Invariant cache hit.
[2023-03-11 07:51:58] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/74 places, 110/143 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 316 ms. Remains : 41/74 places, 110/143 transitions.
Stuttering acceptance computed with spot in 471 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=1 dest: 4}, { cond=(AND p0 p1 p2), acceptance={1} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={1} source=2 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=2 dest: 5}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={1} source=2 dest: 5}], [{ cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), acceptance={0, 1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2 p3) (AND (NOT p1) p2 p3)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p1) p2 (NOT p3))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 (NOT p2) p3), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={1} source=3 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={1} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p1) (NOT p2) p3)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=4 dest: 3}, { cond=(OR (AND (NOT p0) p1 p3) (AND p1 (NOT p2) p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1 (NOT p2) (NOT p3)), acceptance={1} source=4 dest: 4}, { cond=(AND p0 p1 p2 p3), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1 p2 (NOT p3)), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={1} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={1} source=5 dest: 4}, { cond=(AND p1 p2 p3), acceptance={} source=5 dest: 5}, { cond=(AND p1 p2 (NOT p3)), acceptance={1} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=6 dest: 4}, { cond=(AND p0 p1 p2), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s6 1), p1:(OR (EQ s5 0) (EQ s39 0)), p2:(AND (EQ s5 1) (EQ s39 1)), p3:(EQ s21 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-11 finished in 816 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((G(p0) U (p1||X(X(F((p1||X((G(p0) U (p1&&G(p0))))))))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 57 transition count 112
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 57 transition count 112
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 57 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 54 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 54 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 52 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 52 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 55 place count 52 transition count 89
Applied a total of 55 rules in 3 ms. Remains 52 /74 variables (removed 22) and now considering 89/143 (removed 54) transitions.
[2023-03-11 07:51:58] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2023-03-11 07:51:58] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:58] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 07:51:58] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:51:58] [INFO ] Invariant cache hit.
[2023-03-11 07:51:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:51:59] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-11 07:51:59] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2023-03-11 07:51:59] [INFO ] Invariant cache hit.
[2023-03-11 07:51:59] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/74 places, 89/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 52/74 places, 89/143 transitions.
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 4}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(EQ s4 1), p0:(EQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-12 finished in 643 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||(p1 U G(p0)))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Graph (trivial) has 83 edges and 74 vertex of which 6 / 74 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.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 53 transition count 107
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 53 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 43 place count 53 transition count 101
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 49 transition count 90
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 49 transition count 90
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 46 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 46 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 66 place count 46 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 78 place count 40 transition count 108
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 40 transition count 107
Applied a total of 79 rules in 22 ms. Remains 40 /74 variables (removed 34) and now considering 107/143 (removed 36) transitions.
[2023-03-11 07:51:59] [INFO ] Flow matrix only has 90 transitions (discarded 17 similar events)
// Phase 1: matrix 90 rows 40 cols
[2023-03-11 07:51:59] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:51:59] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-11 07:51:59] [INFO ] Flow matrix only has 90 transitions (discarded 17 similar events)
[2023-03-11 07:51:59] [INFO ] Invariant cache hit.
[2023-03-11 07:51:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-11 07:51:59] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-11 07:51:59] [INFO ] Redundant transitions in 37 ms returned []
[2023-03-11 07:51:59] [INFO ] Flow matrix only has 90 transitions (discarded 17 similar events)
[2023-03-11 07:51:59] [INFO ] Invariant cache hit.
[2023-03-11 07:51:59] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/74 places, 107/143 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 313 ms. Remains : 40/74 places, 107/143 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s0 1), p1:(EQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-13 finished in 489 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((G(p0)&&X(X(G((p1||G(p2))))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 32 place count 59 transition count 113
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 56 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 56 transition count 104
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 41 place count 53 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 44 place count 53 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 53 place count 53 transition count 89
Applied a total of 53 rules in 7 ms. Remains 53 /74 variables (removed 21) and now considering 89/143 (removed 54) transitions.
[2023-03-11 07:51:59] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
// Phase 1: matrix 85 rows 53 cols
[2023-03-11 07:51:59] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 07:52:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-11 07:52:00] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2023-03-11 07:52:00] [INFO ] Invariant cache hit.
[2023-03-11 07:52:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 07:52:00] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2023-03-11 07:52:00] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2023-03-11 07:52:00] [INFO ] Invariant cache hit.
[2023-03-11 07:52:00] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 53/74 places, 89/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 300 ms. Remains : 53/74 places, 89/143 transitions.
Stuttering acceptance computed with spot in 348 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=1, aps=[p0:(EQ s31 1), p1:(EQ s17 0), p2:(OR (EQ s36 0) (EQ s40 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLFireability-14 finished in 675 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(F(p0))||G(p1))))'
Support contains 3 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 143/143 transitions.
Graph (trivial) has 73 edges and 74 vertex of which 6 / 74 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 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 51 transition count 104
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 45 place count 51 transition count 98
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 47 transition count 87
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 47 transition count 87
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 45 transition count 83
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 45 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 45 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 67 place count 43 transition count 93
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 43 transition count 92
Applied a total of 68 rules in 37 ms. Remains 43 /74 variables (removed 31) and now considering 92/143 (removed 51) transitions.
[2023-03-11 07:52:00] [INFO ] Flow matrix only has 84 transitions (discarded 8 similar events)
// Phase 1: matrix 84 rows 43 cols
[2023-03-11 07:52:00] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-11 07:52:00] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 07:52:00] [INFO ] Flow matrix only has 84 transitions (discarded 8 similar events)
[2023-03-11 07:52:00] [INFO ] Invariant cache hit.
[2023-03-11 07:52:00] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-11 07:52:00] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-11 07:52:00] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-11 07:52:00] [INFO ] Flow matrix only has 84 transitions (discarded 8 similar events)
[2023-03-11 07:52:00] [INFO ] Invariant cache hit.
[2023-03-11 07:52:01] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/74 places, 92/143 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 43/74 places, 92/143 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-15-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s34 0), p0:(OR (EQ s6 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 20 reset in 98 ms.
Product exploration explored 100000 steps with 5 reset in 521 ms.
Computed a total of 10 stabilizing places and 27 stable transitions
Computed a total of 10 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 293 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1024 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 07:52:02] [INFO ] Flow matrix only has 84 transitions (discarded 8 similar events)
[2023-03-11 07:52:02] [INFO ] Invariant cache hit.
[2023-03-11 07:52:02] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 07:52:02] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-11 07:52:02] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-15-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-15-LTLFireability-15 finished in 2007 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)))'
[2023-03-11 07:52:03] [INFO ] Flatten gal took : 22 ms
[2023-03-11 07:52:03] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-11 07:52:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 143 transitions and 468 arcs took 4 ms.
Total runtime 31138 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HealthRecord-PT-15
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

FORMULA HealthRecord-PT-15-LTLFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678521124401

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 HealthRecord-PT-15-LTLFireability-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HealthRecord-PT-15-LTLFireability-02
lola: result : false
lola: markings : 348
lola: fired transitions : 550
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HealthRecord-PT-15-LTLFireability-02: LTL false LTL model checker


Time elapsed: 0 secs. Pages in use: 1

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-15"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is HealthRecord-PT-15, 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 r199-smll-167840345800348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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