Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 316K
-rw-r--r-- 1 mcc users 7.6K Apr 29 13:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 29 13:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 13:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 29 13:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 78K May 10 09:34 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 HospitalTriage-PT-none-LTLFireability-00
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-01
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-02
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-03
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-04
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-05
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-06
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-07
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-08
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-09
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-10
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-11
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-12
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-13
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-14
FORMULA_NAME HospitalTriage-PT-none-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652782152108

Running Version 202205111006
[2022-05-17 10:09:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 10:09:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 10:09:14] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2022-05-17 10:09:14] [INFO ] Transformed 245 places.
[2022-05-17 10:09:14] [INFO ] Transformed 228 transitions.
[2022-05-17 10:09:14] [INFO ] Parsed PT model containing 245 places and 228 transitions in 312 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 80 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA HospitalTriage-PT-none-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HospitalTriage-PT-none-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 148/148 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 156 transition count 143
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 156 transition count 143
Applied a total of 10 rules in 42 ms. Remains 156 /161 variables (removed 5) and now considering 143/148 (removed 5) transitions.
// Phase 1: matrix 143 rows 156 cols
[2022-05-17 10:09:14] [INFO ] Computed 33 place invariants in 21 ms
[2022-05-17 10:09:14] [INFO ] Implicit Places using invariants in 301 ms returned [44, 52, 79, 113, 135, 138]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 350 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/161 places, 143/148 transitions.
Applied a total of 0 rules in 10 ms. Remains 150 /150 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 150/161 places, 143/148 transitions.
Support contains 32 out of 150 places after structural reductions.
[2022-05-17 10:09:15] [INFO ] Flatten gal took : 55 ms
[2022-05-17 10:09:15] [INFO ] Flatten gal took : 24 ms
[2022-05-17 10:09:15] [INFO ] Input system was already deterministic with 143 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 143 rows 150 cols
[2022-05-17 10:09:15] [INFO ] Computed 27 place invariants in 4 ms
[2022-05-17 10:09:15] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-05-17 10:09:15] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 150 transition count 80
Reduce places removed 66 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 74 rules applied. Total rules applied 137 place count 84 transition count 72
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 50 edges and 75 vertex of which 8 / 75 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 31 rules applied. Total rules applied 168 place count 71 transition count 51
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 33 rules applied. Total rules applied 201 place count 51 transition count 38
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 204 place count 48 transition count 38
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 20 Pre rules applied. Total rules applied 204 place count 48 transition count 18
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 254 place count 18 transition count 18
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 258 place count 18 transition count 14
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 270 place count 10 transition count 10
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 11 rules applied. Total rules applied 281 place count 3 transition count 6
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 283 place count 3 transition count 4
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 284 place count 3 transition count 3
Ensure Unique test removed 1 places
Iterating post reduction 8 with 1 rules applied. Total rules applied 285 place count 2 transition count 3
Applied a total of 285 rules in 37 ms. Remains 2 /150 variables (removed 148) and now considering 3/143 (removed 140) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-17 10:09:16] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 10:09:16] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-17 10:09:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 10:09:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2022-05-17 10:09:16] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-17 10:09:16] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-17 10:09:16] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/150 places, 3/143 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/150 places, 3/143 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-00 finished in 365 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||X(p1)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 147 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 147 transition count 140
Applied a total of 6 rules in 13 ms. Remains 147 /150 variables (removed 3) and now considering 140/143 (removed 3) transitions.
// Phase 1: matrix 140 rows 147 cols
[2022-05-17 10:09:16] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 10:09:16] [INFO ] Implicit Places using invariants in 127 ms returned [35]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/150 places, 140/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 146/150 places, 140/143 transitions.
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s142 1), p1:(AND (GEQ s15 1) (GEQ s54 1) (GEQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 HospitalTriage-PT-none-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-01 finished in 261 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 150 transition count 87
Reduce places removed 59 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 63 rules applied. Total rules applied 119 place count 91 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 123 place count 87 transition count 83
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 123 place count 87 transition count 55
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 193 place count 45 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 196 place count 45 transition count 52
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 196 place count 45 transition count 44
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 212 place count 37 transition count 44
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 215 place count 34 transition count 41
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 34 transition count 41
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 234 place count 26 transition count 33
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 242 place count 26 transition count 25
Applied a total of 242 rules in 32 ms. Remains 26 /150 variables (removed 124) and now considering 25/143 (removed 118) transitions.
// Phase 1: matrix 25 rows 26 cols
[2022-05-17 10:09:16] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-17 10:09:16] [INFO ] Implicit Places using invariants in 49 ms returned [5, 6, 14, 18]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 56 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/150 places, 25/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 19 transition count 22
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 19 transition count 22
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 16 transition count 19
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 16 transition count 19
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 16 transition count 16
Applied a total of 15 rules in 7 ms. Remains 16 /22 variables (removed 6) and now considering 16/25 (removed 9) transitions.
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 10:09:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 10:09:16] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 16 rows 16 cols
[2022-05-17 10:09:16] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-17 10:09:16] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/150 places, 16/143 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/150 places, 16/143 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-02 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 (LT s9 1) (LT s14 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 14 steps with 0 reset in 2 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-02 finished in 341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G((p0 U !F(p0))))))'
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 147 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 147 transition count 140
Applied a total of 6 rules in 8 ms. Remains 147 /150 variables (removed 3) and now considering 140/143 (removed 3) transitions.
// Phase 1: matrix 140 rows 147 cols
[2022-05-17 10:09:16] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-17 10:09:17] [INFO ] Implicit Places using invariants in 148 ms returned [35, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 161 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 140/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/150 places, 140/143 transitions.
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0, true]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s96 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 252 steps with 0 reset in 10 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-04 finished in 344 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(G(p0) U (((p2 U X(p0))&&p1)||X(p3))))))'
Support contains 7 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 148 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 148 transition count 141
Applied a total of 4 rules in 17 ms. Remains 148 /150 variables (removed 2) and now considering 141/143 (removed 2) transitions.
// Phase 1: matrix 141 rows 148 cols
[2022-05-17 10:09:17] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-17 10:09:17] [INFO ] Implicit Places using invariants in 135 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/150 places, 141/143 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/150 places, 141/143 transitions.
Stuttering acceptance computed with spot in 606 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=p3, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p3), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p2 p3), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 7}], [{ cond=(AND p0 p3), acceptance={0} source=5 dest: 1}, { cond=(AND p0 p1 p3), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1 p2 p3), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1 p3), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2 p3), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1) p3), acceptance={} source=7 dest: 4}, { cond=(AND p0 p1 p3), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p1) p3), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s28 1) (GEQ s106 1)), p3:(GEQ s65 1), p2:(GEQ s53 1), p0:(AND (GEQ s35 1) (GEQ s60 1) (GEQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33240 reset in 678 ms.
Product exploration explored 100000 steps with 33373 reset in 344 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1 p2))), (X (NOT p3)), (X (NOT (AND p1 p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2 p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1738 ms. Reduced automaton from 8 states, 29 edges and 4 AP to 8 states, 29 edges and 4 AP.
Stuttering acceptance computed with spot in 527 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 701 ms. (steps per millisecond=14 ) properties (out of 19) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 141 rows 147 cols
[2022-05-17 10:09:22] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-17 10:09:22] [INFO ] [Real]Absence check using 26 positive place invariants in 20 ms returned sat
[2022-05-17 10:09:22] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 10:09:22] [INFO ] [Nat]Absence check using 26 positive place invariants in 24 ms returned sat
[2022-05-17 10:09:23] [INFO ] After 185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 10:09:23] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 72 ms.
[2022-05-17 10:09:23] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 29 ms.
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 147/147 places, 141/141 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 147 transition count 90
Reduce places removed 51 places and 0 transitions.
Graph (complete) has 180 edges and 96 vertex of which 88 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 88 transition count 86
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 88 transition count 82
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 107 place count 88 transition count 70
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 131 place count 76 transition count 70
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 147 place count 68 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 153 place count 65 transition count 59
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 164 place count 65 transition count 48
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 177 place count 52 transition count 48
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 177 place count 52 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 193 place count 43 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 201 place count 38 transition count 38
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 38 transition count 32
Applied a total of 207 rules in 29 ms. Remains 38 /147 variables (removed 109) and now considering 32/141 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/147 places, 32/141 transitions.
Finished random walk after 9879 steps, including 2 resets, run visited all 4 properties in 51 ms. (steps per millisecond=193 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT (AND p0 p1 p2))), (X (NOT p3)), (X (NOT (AND p1 p3))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p1 p2 p3))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1) p3))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p1))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p1 p3)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p1 p2 p3)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1) p3)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p2 p0 p1)), (F (AND (NOT p0) p1)), (F (AND p3 (NOT p0) p1)), (F (AND p3 p0 (NOT p1))), (F (AND p3 p2 p0 p1)), (F (AND p3 p2 p1)), (F (AND p0 p1)), (F (AND p3 p0 p1)), (F (AND p3 p0)), (F p0), (F p1), (F (AND p3 p2 (NOT p1))), (F (AND p3 (NOT p1))), (F (AND p3 p1)), (F p3), (F (AND p3 p2 (NOT p0) p1)), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0) p1))]
Knowledge based reduction with 21 factoid took 2739 ms. Reduced automaton from 8 states, 29 edges and 4 AP to 8 states, 29 edges and 4 AP.
Stuttering acceptance computed with spot in 503 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 538 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 141/141 (removed 0) transitions.
// Phase 1: matrix 141 rows 147 cols
[2022-05-17 10:09:27] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-17 10:09:27] [INFO ] Implicit Places using invariants in 151 ms returned []
// Phase 1: matrix 141 rows 147 cols
[2022-05-17 10:09:27] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-17 10:09:27] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
// Phase 1: matrix 141 rows 147 cols
[2022-05-17 10:09:27] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-17 10:09:27] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 147/147 places, 141/141 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p3 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p3 p1))), (X (NOT p0)), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1717 ms. Reduced automaton from 8 states, 29 edges and 4 AP to 8 states, 29 edges and 4 AP.
Stuttering acceptance computed with spot in 378 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 335 ms. (steps per millisecond=29 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 141 rows 147 cols
[2022-05-17 10:09:30] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-17 10:09:30] [INFO ] [Real]Absence check using 26 positive place invariants in 10 ms returned sat
[2022-05-17 10:09:30] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-17 10:09:30] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2022-05-17 10:09:30] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-17 10:09:30] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 45 ms.
[2022-05-17 10:09:30] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 3 properties in 15 ms.
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 147/147 places, 141/141 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 147 transition count 90
Reduce places removed 51 places and 0 transitions.
Graph (complete) has 180 edges and 96 vertex of which 88 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 88 transition count 86
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 107 place count 88 transition count 82
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 107 place count 88 transition count 70
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 131 place count 76 transition count 70
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 147 place count 68 transition count 62
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
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 153 place count 65 transition count 59
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 164 place count 65 transition count 48
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 177 place count 52 transition count 48
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 177 place count 52 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 193 place count 43 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 201 place count 38 transition count 38
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 38 transition count 32
Applied a total of 207 rules in 28 ms. Remains 38 /147 variables (removed 109) and now considering 32/141 (removed 109) transitions.
Finished structural reductions, in 1 iterations. Remains : 38/147 places, 32/141 transitions.
Finished random walk after 1667 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=416 )
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) (NOT p0)), (X (NOT p3)), (X (NOT (AND p2 p0 p1))), (X (NOT (AND p3 p2 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p3 p1))), (X (NOT p0)), (X (NOT (AND p3 p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT p3))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND p3 p2 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p3 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND p3 p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND p2 p0 p1)), (F (AND (NOT p0) p1)), (F (AND p3 (NOT p0) p1)), (F (AND p3 p0 (NOT p1))), (F (AND p3 p2 p0 p1)), (F (AND p3 p2 p1)), (F (AND p0 p1)), (F (AND p3 p0 p1)), (F (AND p3 p0)), (F p0), (F p1), (F (AND p3 p2 (NOT p1))), (F (AND p3 (NOT p1))), (F (AND p3 p1)), (F p3), (F (AND p3 p2 (NOT p0) p1)), (F (AND p2 (NOT p1))), (F (AND p2 (NOT p0) p1))]
Knowledge based reduction with 21 factoid took 2020 ms. Reduced automaton from 8 states, 29 edges and 4 AP to 8 states, 29 edges and 4 AP.
Stuttering acceptance computed with spot in 345 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 358 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Stuttering acceptance computed with spot in 394 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Product exploration explored 100000 steps with 33273 reset in 283 ms.
Product exploration explored 100000 steps with 33333 reset in 268 ms.
Applying partial POR strategy [false, false, false, false, true, false, false, true]
Stuttering acceptance computed with spot in 360 ms :[(OR p3 (AND p0 p1)), p3, (OR (AND p0 p3) (AND p0 p1)), (AND p0 (NOT p1) p3), (OR (AND p0 p1) (AND p0 p3)), (AND p0 p3), (AND p0 (NOT p1) p3), (AND p0 p3)]
Support contains 7 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 141/141 transitions.
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 147 transition count 141
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 46 place count 147 transition count 148
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 67 place count 147 transition count 148
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 84 place count 130 transition count 131
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 17 rules applied. Total rules applied 101 place count 130 transition count 131
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 110 place count 121 transition count 122
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 119 place count 121 transition count 122
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 127 place count 121 transition count 122
Deduced a syphon composed of 52 places in 1 ms
Applied a total of 127 rules in 54 ms. Remains 121 /147 variables (removed 26) and now considering 122/141 (removed 19) transitions.
[2022-05-17 10:09:35] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 122 rows 121 cols
[2022-05-17 10:09:35] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-17 10:09:35] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/147 places, 122/141 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/147 places, 122/141 transitions.
Product exploration explored 100000 steps with 33350 reset in 457 ms.
Product exploration explored 100000 steps with 33278 reset in 422 ms.
Built C files in :
/tmp/ltsmin8543564626926278323
[2022-05-17 10:09:36] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8543564626926278323
Running compilation step : cd /tmp/ltsmin8543564626926278323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 521 ms.
Running link step : cd /tmp/ltsmin8543564626926278323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin8543564626926278323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1852880025347826683.hoa' '--buchi-type=spotba'
LTSmin run took 741 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HospitalTriage-PT-none-LTLFireability-05 finished in 20377 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(!(p0 U p1))||p1))||G(p2)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 150 transition count 91
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 67 rules applied. Total rules applied 119 place count 95 transition count 79
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 38 edges and 82 vertex of which 8 / 82 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 2 with 34 rules applied. Total rules applied 153 place count 78 transition count 59
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 32 rules applied. Total rules applied 185 place count 59 transition count 46
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 190 place count 56 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 192 place count 54 transition count 44
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 10 Pre rules applied. Total rules applied 192 place count 54 transition count 34
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 214 place count 42 transition count 34
Discarding 8 places :
Implicit places reduction removed 8 places
Iterating post reduction 6 with 8 rules applied. Total rules applied 222 place count 34 transition count 34
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 5 Pre rules applied. Total rules applied 222 place count 34 transition count 29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 232 place count 29 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 246 place count 22 transition count 22
Applied a total of 246 rules in 13 ms. Remains 22 /150 variables (removed 128) and now considering 22/143 (removed 121) transitions.
// Phase 1: matrix 22 rows 22 cols
[2022-05-17 10:09:37] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-17 10:09:37] [INFO ] Implicit Places using invariants in 37 ms returned [5, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 38 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/150 places, 22/143 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 19 transition count 21
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 21
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 19 transition count 20
Applied a total of 3 rules in 4 ms. Remains 19 /20 variables (removed 1) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 19 cols
[2022-05-17 10:09:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 10:09:37] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 20 rows 19 cols
[2022-05-17 10:09:37] [INFO ] Computed 7 place invariants in 0 ms
[2022-05-17 10:09:37] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/150 places, 20/143 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/150 places, 20/143 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, p1, (AND p1 (NOT p2)), false, false, (NOT p2)]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=3, aps=[p1:(GEQ s9 1), p2:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-06 finished in 369 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((!(X(!X(p0)) U p1)&&p2)))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 147 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 147 transition count 140
Applied a total of 6 rules in 7 ms. Remains 147 /150 variables (removed 3) and now considering 140/143 (removed 3) transitions.
// Phase 1: matrix 140 rows 147 cols
[2022-05-17 10:09:38] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 10:09:38] [INFO ] Implicit Places using invariants in 140 ms returned [35, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 142 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 140/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/150 places, 140/143 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={0} source=3 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s74 1) (GEQ s93 1)) (GEQ s116 1)), p2:(OR (LT s46 1) (LT s74 1)), p0:(AND (GEQ s74 1) (GEQ s93 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 689 reset in 669 ms.
Product exploration explored 100000 steps with 680 reset in 539 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 582 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Finished random walk after 23 steps, including 0 resets, run visited all 7 properties in 3 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND p1 (NOT p0)) (AND (NOT p2) (NOT p0)))))), (X (X (AND (NOT p1) p2 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (F (OR p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 1028 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Support contains 4 out of 145 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 145/145 places, 140/140 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
// Phase 1: matrix 140 rows 145 cols
[2022-05-17 10:09:41] [INFO ] Computed 25 place invariants in 0 ms
[2022-05-17 10:09:41] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 140 rows 145 cols
[2022-05-17 10:09:41] [INFO ] Computed 25 place invariants in 3 ms
[2022-05-17 10:09:42] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
// Phase 1: matrix 140 rows 145 cols
[2022-05-17 10:09:42] [INFO ] Computed 25 place invariants in 2 ms
[2022-05-17 10:09:42] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 145/145 places, 140/140 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 1 factoid took 448 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Finished random walk after 103 steps, including 0 resets, run visited all 7 properties in 7 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (OR p1 (NOT p2))), (X (NOT (OR p1 (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p1 (NOT p2)))), (X (X (NOT (OR p1 (NOT p2))))), (X (X (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (OR (AND (NOT p0) p1) (AND (NOT p0) (NOT p2)))), (F (OR p1 (NOT p2))), (F p1), (F (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 751 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p2) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1))]
Product exploration explored 100000 steps with 671 reset in 338 ms.
Product exploration explored 100000 steps with 683 reset in 675 ms.
Built C files in :
/tmp/ltsmin4987824348464018671
[2022-05-17 10:09:45] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4987824348464018671
Running compilation step : cd /tmp/ltsmin4987824348464018671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 353 ms.
Running link step : cd /tmp/ltsmin4987824348464018671;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin4987824348464018671;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17882750285900151900.hoa' '--buchi-type=spotba'
LTSmin run took 146 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HospitalTriage-PT-none-LTLFireability-07 finished in 8011 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0)))&&G(p1))))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 147 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 147 transition count 140
Applied a total of 6 rules in 5 ms. Remains 147 /150 variables (removed 3) and now considering 140/143 (removed 3) transitions.
// Phase 1: matrix 140 rows 147 cols
[2022-05-17 10:09:46] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 10:09:46] [INFO ] Implicit Places using invariants in 99 ms returned [35, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 101 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 140/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/150 places, 140/143 transitions.
Stuttering acceptance computed with spot in 547 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 3}, { cond=p1, acceptance={0} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 6}, { cond=p1, acceptance={0} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 9}, { cond=p1, acceptance={0} source=4 dest: 10}, { cond=p1, acceptance={} source=4 dest: 11}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 6}, { cond=p1, acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=6 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=7 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=7 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=8 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=8 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=9 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={0} source=9 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=10 dest: 9}, { cond=(AND p1 (NOT p0)), acceptance={0} source=10 dest: 10}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=11 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=11 dest: 8}]], initial=0, aps=[p1:(LT s22 1), p0:(GEQ s10 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 78 reset in 273 ms.
Product exploration explored 100000 steps with 72 reset in 301 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 12 states, 32 edges and 2 AP to 12 states, 32 edges and 2 AP.
Stuttering acceptance computed with spot in 518 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Finished random walk after 62 steps, including 0 resets, run visited all 3 properties in 6 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 235 ms. Reduced automaton from 12 states, 32 edges and 2 AP to 12 states, 32 edges and 2 AP.
Stuttering acceptance computed with spot in 694 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 627 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
// Phase 1: matrix 140 rows 145 cols
[2022-05-17 10:09:49] [INFO ] Computed 25 place invariants in 4 ms
[2022-05-17 10:09:49] [INFO ] [Real]Absence check using 25 positive place invariants in 13 ms returned unsat
Proved EG (NOT p1)
// Phase 1: matrix 140 rows 145 cols
[2022-05-17 10:09:49] [INFO ] Computed 25 place invariants in 1 ms
[2022-05-17 10:09:49] [INFO ] [Real]Absence check using 25 positive place invariants in 9 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p1)), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 176 ms. Reduced automaton from 12 states, 32 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA HospitalTriage-PT-none-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HospitalTriage-PT-none-LTLFireability-08 finished in 4099 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)&&p0))||F(G((p2 U p3)))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 150 transition count 90
Reduce places removed 55 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 59 rules applied. Total rules applied 112 place count 95 transition count 86
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 116 place count 91 transition count 86
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 116 place count 91 transition count 66
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 162 place count 65 transition count 66
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 165 place count 65 transition count 63
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 167 place count 63 transition count 61
Iterating global reduction 4 with 2 rules applied. Total rules applied 169 place count 63 transition count 61
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 185 place count 55 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 199 place count 48 transition count 46
Applied a total of 199 rules in 19 ms. Remains 48 /150 variables (removed 102) and now considering 46/143 (removed 97) transitions.
// Phase 1: matrix 46 rows 48 cols
[2022-05-17 10:09:50] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-17 10:09:50] [INFO ] Implicit Places using invariants in 52 ms returned [4, 14, 19, 23, 24, 29, 42, 43]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 53 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 40/150 places, 46/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 40/150 places, 46/143 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p3), (NOT p3)]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR (AND p2 (NOT p3) (NOT p1)) (AND p2 (NOT p3) (NOT p0))), acceptance={} source=0 dest: 2}], [{ cond=(OR p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s5 1), p0:(AND (GEQ s19 1) (GEQ s28 1)), p2:(GEQ s32 1), p3:(AND (GEQ s5 1) (GEQ s19 1) (GEQ s28 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 HospitalTriage-PT-none-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-11 finished in 231 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 147 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 147 transition count 140
Applied a total of 6 rules in 5 ms. Remains 147 /150 variables (removed 3) and now considering 140/143 (removed 3) transitions.
// Phase 1: matrix 140 rows 147 cols
[2022-05-17 10:09:50] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 10:09:50] [INFO ] Implicit Places using invariants in 142 ms returned [35, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 140/143 transitions.
Applied a total of 0 rules in 9 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/150 places, 140/143 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s74 1) (GEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 HospitalTriage-PT-none-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-12 finished in 287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(p0))||X(p1)))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 148 transition count 141
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 148 transition count 141
Applied a total of 4 rules in 13 ms. Remains 148 /150 variables (removed 2) and now considering 141/143 (removed 2) transitions.
// Phase 1: matrix 141 rows 148 cols
[2022-05-17 10:09:50] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 10:09:50] [INFO ] Implicit Places using invariants in 142 ms returned [36]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/150 places, 141/143 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 147/150 places, 141/143 transitions.
Stuttering acceptance computed with spot in 201 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(OR (LT s15 1) (LT s55 1) (LT s64 1)), p1:(GEQ s35 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 142 steps with 0 reset in 0 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-13 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p0)||X(p1)))'
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 147 transition count 140
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 147 transition count 140
Applied a total of 6 rules in 5 ms. Remains 147 /150 variables (removed 3) and now considering 140/143 (removed 3) transitions.
// Phase 1: matrix 140 rows 147 cols
[2022-05-17 10:09:51] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-17 10:09:51] [INFO ] Implicit Places using invariants in 231 ms returned [35, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 245 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 145/150 places, 140/143 transitions.
Applied a total of 0 rules in 2 ms. Remains 145 /145 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 145/150 places, 140/143 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : HospitalTriage-PT-none-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s54 1) (GEQ s74 1)), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 531 reset in 456 ms.
Stack based approach found an accepted trace after 16226 steps with 86 reset with depth 33 and stack size 33 in 65 ms.
FORMULA HospitalTriage-PT-none-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property HospitalTriage-PT-none-LTLFireability-14 finished in 1114 ms.
All properties solved by simple procedures.
Total runtime 38236 ms.

BK_STOP 1652782192391

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="HospitalTriage-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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