Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 20:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 12 20:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 71K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716557994009

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 13:39:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 13:39:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 13:39:55] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2024-05-24 13:39:55] [INFO ] Transformed 160 places.
[2024-05-24 13:39:55] [INFO ] Transformed 340 transitions.
[2024-05-24 13:39:55] [INFO ] Found NUPN structural information;
[2024-05-24 13:39:55] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 85 transition count 171
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 85 transition count 171
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 155 place count 80 transition count 161
Iterating global reduction 0 with 5 rules applied. Total rules applied 160 place count 80 transition count 161
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 161 place count 79 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 162 place count 79 transition count 158
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 163 place count 78 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 164 place count 78 transition count 156
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 167 place count 78 transition count 153
Applied a total of 167 rules in 260 ms. Remains 78 /160 variables (removed 82) and now considering 153/312 (removed 159) transitions.
[2024-05-24 13:39:56] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
// Phase 1: matrix 150 rows 78 cols
[2024-05-24 13:39:56] [INFO ] Computed 9 invariants in 9 ms
[2024-05-24 13:39:56] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-24 13:39:56] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
[2024-05-24 13:39:56] [INFO ] Invariant cache hit.
[2024-05-24 13:39:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:39:56] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-24 13:39:56] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
[2024-05-24 13:39:56] [INFO ] Invariant cache hit.
[2024-05-24 13:39:56] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/160 places, 153/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 625 ms. Remains : 78/160 places, 153/312 transitions.
Support contains 31 out of 78 places after structural reductions.
[2024-05-24 13:39:56] [INFO ] Flatten gal took : 39 ms
[2024-05-24 13:39:56] [INFO ] Flatten gal took : 13 ms
[2024-05-24 13:39:56] [INFO ] Input system was already deterministic with 153 transitions.
Incomplete random walk after 10000 steps, including 731 resets, run finished after 436 ms. (steps per millisecond=22 ) properties (out of 29) seen :17
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 88 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-24 13:39:57] [INFO ] Flow matrix only has 150 transitions (discarded 3 similar events)
[2024-05-24 13:39:57] [INFO ] Invariant cache hit.
[2024-05-24 13:39:57] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 13:39:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-24 13:39:57] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-24 13:39:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:39:57] [INFO ] After 64ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-24 13:39:57] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 3 ms to minimize.
[2024-05-24 13:39:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2024-05-24 13:39:57] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 72 ms.
[2024-05-24 13:39:57] [INFO ] After 491ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 19 ms.
Support contains 14 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 65 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 292 edges and 74 vertex of which 73 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 73 transition count 139
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 71 transition count 137
Reduce places removed 1 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 2 with 3 rules applied. Total rules applied 11 place count 70 transition count 135
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 13 place count 69 transition count 134
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 13 place count 69 transition count 133
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 15 place count 68 transition count 133
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 28 place count 55 transition count 107
Iterating global reduction 4 with 13 rules applied. Total rules applied 41 place count 55 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 43 place count 55 transition count 105
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 46 place count 52 transition count 99
Iterating global reduction 5 with 3 rules applied. Total rules applied 49 place count 52 transition count 99
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 54 place count 52 transition count 94
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 62 place count 48 transition count 112
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 63 place count 48 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 64 place count 47 transition count 111
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 7 with 13 rules applied. Total rules applied 77 place count 47 transition count 111
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 7 with 11 rules applied. Total rules applied 88 place count 47 transition count 111
Applied a total of 88 rules in 36 ms. Remains 47 /78 variables (removed 31) and now considering 111/153 (removed 42) transitions.
[2024-05-24 13:39:58] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
// Phase 1: matrix 103 rows 47 cols
[2024-05-24 13:39:58] [INFO ] Computed 8 invariants in 7 ms
[2024-05-24 13:39:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 47/78 places, 111/153 transitions.
Incomplete random walk after 10000 steps, including 634 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 11) seen :7
Incomplete Best-First random walk after 10000 steps, including 119 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 130 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 114 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-24 13:39:58] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2024-05-24 13:39:58] [INFO ] Invariant cache hit.
[2024-05-24 13:39:58] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 13:39:58] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 2 ms returned sat
[2024-05-24 13:39:58] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 13:39:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-24 13:39:58] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 13:39:58] [INFO ] After 29ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 13:39:58] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 111/111 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 107
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 45 transition count 106
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 42 transition count 114
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 42 transition count 112
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 42 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 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 16 place count 41 transition count 110
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 41 transition count 110
Applied a total of 19 rules in 24 ms. Remains 41 /47 variables (removed 6) and now considering 110/111 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 41/47 places, 110/111 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 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 4 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Finished probabilistic random walk after 60642 steps, run visited all 3 properties in 150 ms. (steps per millisecond=404 )
Probabilistic random walk after 60642 steps, saw 12641 distinct states, run finished after 150 ms. (steps per millisecond=404 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HealthRecord-PT-12-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 9 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&G(p2)&&F(p3))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 76 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 55 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 55 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 55 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 51 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 51 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 51 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 57 place count 50 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 58 place count 50 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 49 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 49 transition count 86
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 67 place count 47 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 47 transition count 83
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 78 place count 42 transition count 105
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 42 transition count 103
Applied a total of 80 rules in 26 ms. Remains 42 /78 variables (removed 36) and now considering 103/153 (removed 50) transitions.
[2024-05-24 13:39:59] [INFO ] Flow matrix only has 88 transitions (discarded 15 similar events)
// Phase 1: matrix 88 rows 42 cols
[2024-05-24 13:39:59] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:39:59] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 13:39:59] [INFO ] Flow matrix only has 88 transitions (discarded 15 similar events)
[2024-05-24 13:39:59] [INFO ] Invariant cache hit.
[2024-05-24 13:39:59] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 13:39:59] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-24 13:39:59] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-24 13:39:59] [INFO ] Flow matrix only has 88 transitions (discarded 15 similar events)
[2024-05-24 13:39:59] [INFO ] Invariant cache hit.
[2024-05-24 13:39:59] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/78 places, 103/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 42/78 places, 103/153 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 354 ms :[(OR (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (NOT p2), (NOT p3)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 1}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 p2 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s21 1), p0:(EQ s33 1), p2:(EQ s21 0), p3:(AND (EQ s3 1) (EQ s7 1) (EQ s11 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-02 finished in 641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G((p1&&F(p2))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 89 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 55 transition count 112
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 55 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 40 place count 55 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 51 transition count 100
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 51 transition count 100
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 50 place count 51 transition count 98
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 52 place count 49 transition count 93
Iterating global reduction 2 with 2 rules applied. Total rules applied 54 place count 49 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 57 place count 49 transition count 90
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 48 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 48 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 62 place count 48 transition count 85
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 64 place count 47 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 65 place count 47 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 69 place count 45 transition count 99
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 72 place count 45 transition count 96
Applied a total of 72 rules in 26 ms. Remains 45 /78 variables (removed 33) and now considering 96/153 (removed 57) transitions.
[2024-05-24 13:39:59] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
// Phase 1: matrix 87 rows 45 cols
[2024-05-24 13:39:59] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:39:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 13:39:59] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2024-05-24 13:39:59] [INFO ] Invariant cache hit.
[2024-05-24 13:39:59] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 13:40:00] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2024-05-24 13:40:00] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2024-05-24 13:40:00] [INFO ] Invariant cache hit.
[2024-05-24 13:40:00] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/78 places, 96/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 45/78 places, 96/153 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s32 1), p0:(AND (EQ s14 1) (EQ s5 1)), p2:(EQ s39 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-03 finished in 436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 59 transition count 115
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 59 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 59 transition count 112
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 55 transition count 103
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 55 transition count 103
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 55 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 54 transition count 95
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 54 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 54 transition count 92
Applied a total of 60 rules in 8 ms. Remains 54 /78 variables (removed 24) and now considering 92/153 (removed 61) transitions.
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
// Phase 1: matrix 89 rows 54 cols
[2024-05-24 13:40:00] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:40:00] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:40:00] [INFO ] Invariant cache hit.
[2024-05-24 13:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:40:00] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 89 transitions (discarded 3 similar events)
[2024-05-24 13:40:00] [INFO ] Invariant cache hit.
[2024-05-24 13:40:00] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 54/78 places, 92/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 145 ms. Remains : 54/78 places, 92/153 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (EQ s30 1) (EQ s44 1)), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-05 finished in 295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 93 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 55 transition count 111
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 55 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 55 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 50 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 50 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 58 place count 50 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 48 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 48 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 48 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 47 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 47 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 47 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 45 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 45 transition count 75
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 87 place count 39 transition count 107
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 89 place count 39 transition count 105
Applied a total of 89 rules in 26 ms. Remains 39 /78 variables (removed 39) and now considering 105/153 (removed 48) transitions.
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 90 transitions (discarded 15 similar events)
// Phase 1: matrix 90 rows 39 cols
[2024-05-24 13:40:00] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:40:00] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 90 transitions (discarded 15 similar events)
[2024-05-24 13:40:00] [INFO ] Invariant cache hit.
[2024-05-24 13:40:00] [INFO ] State equation strengthened by 18 read => feed constraints.
[2024-05-24 13:40:00] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-24 13:40:00] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 90 transitions (discarded 15 similar events)
[2024-05-24 13:40:00] [INFO ] Invariant cache hit.
[2024-05-24 13:40:00] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/78 places, 105/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 39/78 places, 105/153 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-07 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 57 transition count 111
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 57 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 57 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 52 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 52 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 61 place count 52 transition count 91
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 50 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 50 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 50 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 49 transition count 81
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 49 transition count 81
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 49 transition count 78
Applied a total of 73 rules in 8 ms. Remains 49 /78 variables (removed 29) and now considering 78/153 (removed 75) transitions.
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 49 cols
[2024-05-24 13:40:00] [INFO ] Computed 9 invariants in 4 ms
[2024-05-24 13:40:00] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-24 13:40:00] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 13:40:00] [INFO ] Invariant cache hit.
[2024-05-24 13:40:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:40:01] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-05-24 13:40:01] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2024-05-24 13:40:01] [INFO ] Invariant cache hit.
[2024-05-24 13:40:01] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 49/78 places, 78/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 49/78 places, 78/153 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s16 1)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-08 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(p1))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 58 transition count 113
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 53 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 53 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 51 transition count 88
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 51 transition count 85
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 50 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 50 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 71 place count 50 transition count 80
Applied a total of 71 rules in 6 ms. Remains 50 /78 variables (removed 28) and now considering 80/153 (removed 73) transitions.
[2024-05-24 13:40:01] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
// Phase 1: matrix 77 rows 50 cols
[2024-05-24 13:40:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:40:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-24 13:40:01] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:40:01] [INFO ] Invariant cache hit.
[2024-05-24 13:40:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:40:01] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2024-05-24 13:40:01] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2024-05-24 13:40:01] [INFO ] Invariant cache hit.
[2024-05-24 13:40:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/78 places, 80/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 133 ms. Remains : 50/78 places, 80/153 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s13 1), p1:(EQ s40 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 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-10 finished in 222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X((G(p1)||G(!p2)))))'
Support contains 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 58 transition count 113
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 58 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 53 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 53 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 59 place count 53 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 52 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 52 transition count 91
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 52 transition count 89
Applied a total of 63 rules in 3 ms. Remains 52 /78 variables (removed 26) and now considering 89/153 (removed 64) transitions.
[2024-05-24 13:40:01] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2024-05-24 13:40:01] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:40:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-24 13:40:01] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:40:01] [INFO ] Invariant cache hit.
[2024-05-24 13:40:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:40:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-24 13:40:01] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:40:01] [INFO ] Invariant cache hit.
[2024-05-24 13:40:01] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/78 places, 89/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 52/78 places, 89/153 transitions.
Stuttering acceptance computed with spot in 367 ms :[true, (AND (NOT p0) p2 (NOT p1)), p2, (AND p2 (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (AND p2 (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 8}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND p0 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=1, aps=[p0:(EQ s11 0), p2:(EQ s17 1), p1:(OR (EQ s3 0) (EQ s7 0) (EQ s12 0) (EQ s41 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 210 ms.
Product exploration explored 100000 steps with 2 reset in 158 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 37 factoid took 507 ms. Reduced automaton from 9 states, 29 edges and 3 AP (stutter sensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 370 ms :[true, p2, (AND p2 (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 719 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 23) seen :7
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2024-05-24 13:40:03] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2024-05-24 13:40:03] [INFO ] Invariant cache hit.
[2024-05-24 13:40:03] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-24 13:40:03] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:40:03] [INFO ] After 70ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2024-05-24 13:40:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:40:03] [INFO ] After 63ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :13
[2024-05-24 13:40:03] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-24 13:40:03] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 14 ms.
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 183 edges and 48 vertex of which 33 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 33 transition count 52
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 23 place count 33 transition count 48
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 31 place count 29 transition count 48
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 34 place count 26 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 37 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 25 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 25 transition count 40
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 24 transition count 39
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 24 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 24 transition count 38
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 22 transition count 36
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 22 transition count 35
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 21 transition count 34
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 6 edges and 19 vertex of which 2 / 19 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 18 transition count 34
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 54 place count 18 transition count 31
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 54 place count 18 transition count 29
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 58 place count 16 transition count 29
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 62 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 63 place count 16 transition count 25
Applied a total of 63 rules in 8 ms. Remains 16 /52 variables (removed 36) and now considering 25/89 (removed 64) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 16/52 places, 25/89 transitions.
Incomplete random walk after 10000 steps, including 670 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 713 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 715 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 25 rows 16 cols
[2024-05-24 13:40:04] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 13:40:04] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:40:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-24 13:40:04] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:40:04] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 13:40:04] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 13 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 1 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1) p2))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND p1 p2)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p0) p2)), (F (NOT p1)), (F (AND p0 p1 p2)), (F p2), (F (NOT p0)), (F (AND p0 p2)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p1) p2)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1) p2)), (F (AND p0 (NOT p1))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 40 factoid took 4122 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 324 ms :[true, (AND p2 (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 318 ms :[true, (AND p2 (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Support contains 6 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 39 edges and 52 vertex of which 8 / 52 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 46 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 46 transition count 82
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 46 transition count 81
Applied a total of 4 rules in 7 ms. Remains 46 /52 variables (removed 6) and now considering 81/89 (removed 8) transitions.
[2024-05-24 13:40:08] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
// Phase 1: matrix 75 rows 46 cols
[2024-05-24 13:40:08] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:40:08] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-24 13:40:08] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2024-05-24 13:40:08] [INFO ] Invariant cache hit.
[2024-05-24 13:40:08] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-05-24 13:40:09] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-24 13:40:09] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2024-05-24 13:40:09] [INFO ] Invariant cache hit.
[2024-05-24 13:40:09] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/52 places, 81/89 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 46/52 places, 81/89 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (AND p0 p1 (NOT p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 p2))), (X (AND p0 (NOT p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 48 factoid took 814 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 310 ms :[true, p2, (NOT p1), (AND p2 (NOT p1)), (AND p2 (NOT p1) (NOT p0)), (AND p2 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 923 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 23) seen :12
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 111 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 106 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2024-05-24 13:40:10] [INFO ] Flow matrix only has 75 transitions (discarded 6 similar events)
[2024-05-24 13:40:10] [INFO ] Invariant cache hit.
[2024-05-24 13:40:10] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-24 13:40:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 13:40:10] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :8
[2024-05-24 13:40:10] [INFO ] After 105ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :8
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-24 13:40:10] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :8
Fused 11 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 81/81 transitions.
Graph (complete) has 162 edges and 46 vertex of which 32 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Drop transitions removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 32 transition count 51
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 24 place count 32 transition count 47
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 36 place count 24 transition count 47
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 11 edges and 24 vertex of which 3 / 24 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 43 place count 22 transition count 41
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 46 place count 22 transition count 38
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 46 place count 22 transition count 35
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 52 place count 19 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 3 with 2 rules applied. Total rules applied 54 place count 18 transition count 34
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 55 place count 17 transition count 33
Iterating global reduction 3 with 1 rules applied. Total rules applied 56 place count 17 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 57 place count 17 transition count 32
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 59 place count 16 transition count 31
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 60 place count 16 transition count 30
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 64 place count 16 transition count 26
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 65 place count 16 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 66 place count 16 transition count 25
Applied a total of 66 rules in 15 ms. Remains 16 /46 variables (removed 30) and now considering 25/81 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 16/46 places, 25/81 transitions.
Incomplete random walk after 10000 steps, including 694 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10000 steps, including 719 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 715 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 25 rows 16 cols
[2024-05-24 13:40:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 13:40:11] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 13:40:11] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-24 13:40:11] [INFO ] After 10ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 13:40:11] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 13:40:11] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 13 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (AND p0 p1 (NOT p2))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND p1 p2))), (X (AND p0 (NOT p2))), (X (AND p1 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 p1 (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND p0 p1))), true, (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p2)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) p2 (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (AND (NOT p0) (NOT p2))), (F (AND p2 p1)), (F (AND (NOT p0) p2)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 p2 p1)), (F (NOT (AND (NOT p2) p1))), (F (AND p0 p2 (NOT p1))), (F p2), (F (NOT p0)), (F (AND p0 p2)), (F (AND p2 (NOT p1))), (F (NOT (AND p0 (NOT p2)))), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT (AND p0 (NOT p2) p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 51 factoid took 6432 ms. Reduced automaton from 8 states, 27 edges and 3 AP (stutter insensitive) to 8 states, 27 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 323 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 387 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p1), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p0)), (AND (NOT p0) p2), (NOT p0), (AND (NOT p1) (NOT p0)), p2]
Product exploration explored 100000 steps with 1 reset in 144 ms.
Product exploration explored 100000 steps with 1 reset in 146 ms.
Built C files in :
/tmp/ltsmin13948277074321974286
[2024-05-24 13:40:19] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2024-05-24 13:40:19] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:40:19] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2024-05-24 13:40:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:40:19] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2024-05-24 13:40:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 13:40:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13948277074321974286
Running compilation step : cd /tmp/ltsmin13948277074321974286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 384 ms.
Running link step : cd /tmp/ltsmin13948277074321974286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin13948277074321974286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9063301202528081374.hoa' '--buchi-type=spotba'
LTSmin run took 1032 ms.
FORMULA HealthRecord-PT-12-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-11 finished in 19250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p0) U p1)||(p2 U p1)))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 82 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 53 transition count 108
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 53 transition count 108
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 44 place count 53 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 48 place count 49 transition count 96
Iterating global reduction 1 with 4 rules applied. Total rules applied 52 place count 49 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 49 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 48 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 48 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 47 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 47 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 47 transition count 85
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 66 place count 45 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 45 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 71 place count 43 transition count 100
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 74 place count 43 transition count 97
Applied a total of 74 rules in 9 ms. Remains 43 /78 variables (removed 35) and now considering 97/153 (removed 56) transitions.
[2024-05-24 13:40:20] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
// Phase 1: matrix 87 rows 43 cols
[2024-05-24 13:40:20] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:40:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-24 13:40:20] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2024-05-24 13:40:20] [INFO ] Invariant cache hit.
[2024-05-24 13:40:20] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-24 13:40:20] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-24 13:40:20] [INFO ] Redundant transitions in 40 ms returned []
[2024-05-24 13:40:20] [INFO ] Flow matrix only has 87 transitions (discarded 10 similar events)
[2024-05-24 13:40:20] [INFO ] Invariant cache hit.
[2024-05-24 13:40:20] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/78 places, 97/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 43/78 places, 97/153 transitions.
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p0) p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s41 1)), p0:(EQ s33 1), p2:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-12 finished in 587 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F((p1 U (p2||G(p1)))))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 57 transition count 111
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 57 transition count 111
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 46 place count 53 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 53 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 56 place count 53 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 52 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 52 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 52 transition count 91
Applied a total of 61 rules in 4 ms. Remains 52 /78 variables (removed 26) and now considering 91/153 (removed 62) transitions.
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
// Phase 1: matrix 88 rows 52 cols
[2024-05-24 13:40:21] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 13:40:21] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-24 13:40:21] [INFO ] Invariant cache hit.
[2024-05-24 13:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:40:21] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 88 transitions (discarded 3 similar events)
[2024-05-24 13:40:21] [INFO ] Invariant cache hit.
[2024-05-24 13:40:21] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 52/78 places, 91/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 52/78 places, 91/153 transitions.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s40 1), p2:(AND (NEQ s40 1) (EQ s37 1)), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-13 finished in 360 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(p1))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 58 transition count 113
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 58 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 58 transition count 110
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 47 place count 54 transition count 101
Iterating global reduction 1 with 4 rules applied. Total rules applied 51 place count 54 transition count 101
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 54 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 52 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 52 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 52 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 51 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 51 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 68 place count 51 transition count 83
Applied a total of 68 rules in 4 ms. Remains 51 /78 variables (removed 27) and now considering 83/153 (removed 70) transitions.
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
// Phase 1: matrix 80 rows 51 cols
[2024-05-24 13:40:21] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 13:40:21] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 13:40:21] [INFO ] Invariant cache hit.
[2024-05-24 13:40:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 13:40:21] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2024-05-24 13:40:21] [INFO ] Invariant cache hit.
[2024-05-24 13:40:21] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/78 places, 83/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 51/78 places, 83/153 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s30 1), p1:(EQ s11 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-14 finished in 346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(G(p1))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 153/153 transitions.
Graph (trivial) has 93 edges and 78 vertex of which 8 / 78 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 54 transition count 110
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 54 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 42 place count 54 transition count 107
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 50 transition count 98
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 50 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 50 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 48 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 48 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 48 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 47 transition count 85
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 47 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 65 place count 47 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 69 place count 45 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 45 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 43 transition count 95
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 77 place count 43 transition count 92
Applied a total of 77 rules in 20 ms. Remains 43 /78 variables (removed 35) and now considering 92/153 (removed 61) transitions.
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
// Phase 1: matrix 83 rows 43 cols
[2024-05-24 13:40:21] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 13:40:21] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-24 13:40:21] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-05-24 13:40:21] [INFO ] Invariant cache hit.
[2024-05-24 13:40:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-24 13:40:22] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-24 13:40:22] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 13:40:22] [INFO ] Flow matrix only has 83 transitions (discarded 9 similar events)
[2024-05-24 13:40:22] [INFO ] Invariant cache hit.
[2024-05-24 13:40:22] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/78 places, 92/153 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 195 ms. Remains : 43/78 places, 92/153 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s13 1), p1:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-15 finished in 320 ms.
All properties solved by simple procedures.
Total runtime 26744 ms.

BK_STOP 1716558023424

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is HealthRecord-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-tall-171640625700493"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;