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.r241-tall-171649628700333.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 Medical-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r241-tall-171649628700333
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 13 15:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 13 14:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 13 14:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:27 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 3.1M 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 Medical-PT-06-LTLFireability-00
FORMULA_NAME Medical-PT-06-LTLFireability-01
FORMULA_NAME Medical-PT-06-LTLFireability-02
FORMULA_NAME Medical-PT-06-LTLFireability-03
FORMULA_NAME Medical-PT-06-LTLFireability-04
FORMULA_NAME Medical-PT-06-LTLFireability-05
FORMULA_NAME Medical-PT-06-LTLFireability-06
FORMULA_NAME Medical-PT-06-LTLFireability-07
FORMULA_NAME Medical-PT-06-LTLFireability-08
FORMULA_NAME Medical-PT-06-LTLFireability-09
FORMULA_NAME Medical-PT-06-LTLFireability-10
FORMULA_NAME Medical-PT-06-LTLFireability-11
FORMULA_NAME Medical-PT-06-LTLFireability-12
FORMULA_NAME Medical-PT-06-LTLFireability-13
FORMULA_NAME Medical-PT-06-LTLFireability-14
FORMULA_NAME Medical-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716568847047

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=Medical-PT-06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 16:40:48] [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 16:40:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 16:40:48] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-24 16:40:48] [INFO ] Transformed 312 places.
[2024-05-24 16:40:49] [INFO ] Transformed 5431 transitions.
[2024-05-24 16:40:49] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 242 places in 23 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA Medical-PT-06-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 6 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 13 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2024-05-24 16:40:49] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2024-05-24 16:40:49] [INFO ] Computed 8 invariants in 14 ms
[2024-05-24 16:40:49] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-24 16:40:49] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 16:40:49] [INFO ] Invariant cache hit.
[2024-05-24 16:40:49] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 16:40:49] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 390 ms to find 0 implicit places.
[2024-05-24 16:40:49] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 16:40:49] [INFO ] Invariant cache hit.
[2024-05-24 16:40:49] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 227/227 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 67/69 places, 227/227 transitions.
Support contains 6 out of 67 places after structural reductions.
[2024-05-24 16:40:49] [INFO ] Flatten gal took : 48 ms
[2024-05-24 16:40:49] [INFO ] Flatten gal took : 22 ms
[2024-05-24 16:40:50] [INFO ] Input system was already deterministic with 227 transitions.
Incomplete random walk after 10000 steps, including 62 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 494892 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{}
Probabilistic random walk after 494892 steps, saw 299014 distinct states, run finished after 3001 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 16:40:53] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2024-05-24 16:40:53] [INFO ] Invariant cache hit.
[2024-05-24 16:40:53] [INFO ] [Real]Absence check using 8 positive place invariants in 16 ms returned sat
[2024-05-24 16:40:53] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 16:40:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:40:53] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 16:40:53] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 16:40:53] [INFO ] After 33ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 16:40:53] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 5 ms to minimize.
[2024-05-24 16:40:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2024-05-24 16:40:53] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-05-24 16:40:53] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:40:54] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 5 ms to minimize.
[2024-05-24 16:40:54] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-05-24 16:40:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 309 ms
[2024-05-24 16:40:54] [INFO ] After 456ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2024-05-24 16:40:54] [INFO ] After 630ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 67 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 225
Free-agglomeration rule applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 65 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 62 transition count 222
Applied a total of 10 rules in 25 ms. Remains 62 /67 variables (removed 5) and now considering 222/227 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 62/67 places, 222/227 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 608379 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608379 steps, saw 364853 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 16:40:57] [INFO ] Flow matrix only has 177 transitions (discarded 45 similar events)
// Phase 1: matrix 177 rows 62 cols
[2024-05-24 16:40:57] [INFO ] Computed 8 invariants in 2 ms
[2024-05-24 16:40:57] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:40:57] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 16:40:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:40:57] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 16:40:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 16:40:57] [INFO ] After 22ms SMT Verify possible using 56 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 16:40:57] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-24 16:40:57] [INFO ] After 163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 222/222 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 62/62 places, 222/222 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 222/222 transitions.
Applied a total of 0 rules in 7 ms. Remains 62 /62 variables (removed 0) and now considering 222/222 (removed 0) transitions.
[2024-05-24 16:40:57] [INFO ] Flow matrix only has 177 transitions (discarded 45 similar events)
[2024-05-24 16:40:57] [INFO ] Invariant cache hit.
[2024-05-24 16:40:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-24 16:40:57] [INFO ] Flow matrix only has 177 transitions (discarded 45 similar events)
[2024-05-24 16:40:57] [INFO ] Invariant cache hit.
[2024-05-24 16:40:57] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 16:40:57] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-24 16:40:57] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-24 16:40:57] [INFO ] Flow matrix only has 177 transitions (discarded 45 similar events)
[2024-05-24 16:40:57] [INFO ] Invariant cache hit.
[2024-05-24 16:40:57] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 62/62 places, 222/222 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 51 transitions.
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 62 transition count 171
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 51 place count 62 transition count 169
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 55 place count 60 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 60 place count 57 transition count 200
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 57 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 56 transition count 223
Applied a total of 62 rules in 16 ms. Remains 56 /62 variables (removed 6) and now considering 223/222 (removed -1) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 223 rows 56 cols
[2024-05-24 16:40:57] [INFO ] Computed 9 invariants in 7 ms
[2024-05-24 16:40:57] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 16:40:57] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 16:40:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 16:40:58] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 16:40:58] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 16:40:58] [INFO ] After 15ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 16:40:58] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 16:40:58] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Computed a total of 6 stabilizing places and 33 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))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 67 transition count 224
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 64 transition count 224
Applied a total of 6 rules in 10 ms. Remains 64 /67 variables (removed 3) and now considering 224/227 (removed 3) transitions.
[2024-05-24 16:40:58] [INFO ] Flow matrix only has 179 transitions (discarded 45 similar events)
// Phase 1: matrix 179 rows 64 cols
[2024-05-24 16:40:58] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 16:40:58] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-24 16:40:58] [INFO ] Flow matrix only has 179 transitions (discarded 45 similar events)
[2024-05-24 16:40:58] [INFO ] Invariant cache hit.
[2024-05-24 16:40:58] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-24 16:40:58] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2024-05-24 16:40:58] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-24 16:40:58] [INFO ] Flow matrix only has 179 transitions (discarded 45 similar events)
[2024-05-24 16:40:58] [INFO ] Invariant cache hit.
[2024-05-24 16:40:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/67 places, 224/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 64/67 places, 224/227 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 149 ms :[(NOT p0)]
Running random walk in product with property : Medical-PT-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s32 1) (GEQ s38 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 6 steps with 0 reset in 2 ms.
FORMULA Medical-PT-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Medical-PT-06-LTLFireability-00 finished in 489 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(p0)))'
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 227/227 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 67 transition count 225
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 65 transition count 225
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 64 transition count 225
Applied a total of 6 rules in 15 ms. Remains 64 /67 variables (removed 3) and now considering 225/227 (removed 2) transitions.
[2024-05-24 16:40:58] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
// Phase 1: matrix 179 rows 64 cols
[2024-05-24 16:40:58] [INFO ] Computed 8 invariants in 1 ms
[2024-05-24 16:40:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-24 16:40:58] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:40:58] [INFO ] Invariant cache hit.
[2024-05-24 16:40:58] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:40:58] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2024-05-24 16:40:58] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-24 16:40:58] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:40:58] [INFO ] Invariant cache hit.
[2024-05-24 16:40:58] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/67 places, 225/227 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 64/67 places, 225/227 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Medical-PT-06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s33 1) (LT s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 777 reset in 279 ms.
Product exploration explored 100000 steps with 780 reset in 224 ms.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1076386 steps, run timeout after 3001 ms. (steps per millisecond=358 ) properties seen :{}
Probabilistic random walk after 1076386 steps, saw 513638 distinct states, run finished after 3001 ms. (steps per millisecond=358 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 16:41:02] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:41:02] [INFO ] Invariant cache hit.
[2024-05-24 16:41:02] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:41:02] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:41:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:41:02] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:02] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:02] [INFO ] After 15ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:02] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-24 16:41:02] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-24 16:41:02] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:41:03] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:41:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 193 ms
[2024-05-24 16:41:03] [INFO ] After 217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 16:41:03] [INFO ] After 286ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 225/225 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 223
Applied a total of 4 rules in 11 ms. Remains 62 /64 variables (removed 2) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 62/64 places, 223/225 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1217772 steps, run timeout after 3001 ms. (steps per millisecond=405 ) properties seen :{}
Probabilistic random walk after 1217772 steps, saw 730577 distinct states, run finished after 3001 ms. (steps per millisecond=405 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 16:41:06] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2024-05-24 16:41:06] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 16:41:06] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:41:06] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:41:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:41:06] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:06] [INFO ] After 13ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:06] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 0 ms to minimize.
[2024-05-24 16:41:06] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-24 16:41:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2024-05-24 16:41:06] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 16:41:06] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 62/62 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 4 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-24 16:41:06] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-24 16:41:06] [INFO ] Invariant cache hit.
[2024-05-24 16:41:06] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 16:41:06] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-24 16:41:06] [INFO ] Invariant cache hit.
[2024-05-24 16:41:06] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:06] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-24 16:41:06] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-24 16:41:06] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-24 16:41:06] [INFO ] Invariant cache hit.
[2024-05-24 16:41:06] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 261 ms. Remains : 62/62 places, 223/223 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 62 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 62 transition count 170
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 54 place count 61 transition count 170
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 1 with 2 rules applied. Total rules applied 56 place count 60 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 57 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 57 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 56 transition count 199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 56 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 55 transition count 222
Applied a total of 65 rules in 17 ms. Remains 55 /62 variables (removed 7) and now considering 222/223 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 55 cols
[2024-05-24 16:41:06] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 16:41:06] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 16:41:06] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:41:06] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2024-05-24 16:41:06] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:06] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 16:41:06] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:06] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2024-05-24 16:41:06] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 225/225 transitions.
Applied a total of 0 rules in 9 ms. Remains 64 /64 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-24 16:41:06] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
// Phase 1: matrix 179 rows 64 cols
[2024-05-24 16:41:06] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 16:41:06] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-24 16:41:06] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:41:06] [INFO ] Invariant cache hit.
[2024-05-24 16:41:07] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:07] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-24 16:41:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 16:41:07] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:41:07] [INFO ] Invariant cache hit.
[2024-05-24 16:41:07] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 307 ms. Remains : 64/64 places, 225/225 transitions.
Computed a total of 6 stabilizing places and 33 stable transitions
Computed a total of 6 stabilizing places and 33 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 77 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1088991 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :{}
Probabilistic random walk after 1088991 steps, saw 519941 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 16:41:10] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:41:10] [INFO ] Invariant cache hit.
[2024-05-24 16:41:10] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-05-24 16:41:10] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:41:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:41:10] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:10] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:10] [INFO ] After 20ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:10] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:41:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-24 16:41:10] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-24 16:41:10] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-24 16:41:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 210 ms
[2024-05-24 16:41:10] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 16:41:10] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 64/64 places, 225/225 transitions.
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 62 transition count 223
Applied a total of 4 rules in 12 ms. Remains 62 /64 variables (removed 2) and now considering 223/225 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 62/64 places, 223/225 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1223700 steps, run timeout after 3001 ms. (steps per millisecond=407 ) properties seen :{}
Probabilistic random walk after 1223700 steps, saw 734134 distinct states, run finished after 3001 ms. (steps per millisecond=407 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 16:41:13] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
// Phase 1: matrix 177 rows 62 cols
[2024-05-24 16:41:13] [INFO ] Computed 8 invariants in 3 ms
[2024-05-24 16:41:13] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:41:13] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:41:13] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-05-24 16:41:13] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:13] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:13] [INFO ] After 15ms SMT Verify possible using 57 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:13] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-24 16:41:14] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-24 16:41:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 96 ms
[2024-05-24 16:41:14] [INFO ] After 133ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-24 16:41:14] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 62/62 places, 223/223 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 223/223 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 223/223 (removed 0) transitions.
[2024-05-24 16:41:14] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-24 16:41:14] [INFO ] Invariant cache hit.
[2024-05-24 16:41:14] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-24 16:41:14] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-24 16:41:14] [INFO ] Invariant cache hit.
[2024-05-24 16:41:14] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:14] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-24 16:41:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 16:41:14] [INFO ] Flow matrix only has 177 transitions (discarded 46 similar events)
[2024-05-24 16:41:14] [INFO ] Invariant cache hit.
[2024-05-24 16:41:14] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 296 ms. Remains : 62/62 places, 223/223 transitions.
Drop transitions removed 13 transitions
Ensure Unique test removed 39 transitions
Reduce isomorphic transitions removed 52 transitions.
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 62 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 52 place count 62 transition count 170
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 61 transition count 170
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 1 with 2 rules applied. Total rules applied 56 place count 60 transition count 169
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 57 transition count 200
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 57 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 56 transition count 199
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 56 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 55 transition count 222
Applied a total of 65 rules in 35 ms. Remains 55 /62 variables (removed 7) and now considering 222/223 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 222 rows 55 cols
[2024-05-24 16:41:14] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 16:41:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-24 16:41:14] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 16:41:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-24 16:41:14] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:14] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-24 16:41:14] [INFO ] After 6ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 16:41:14] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 16:41:14] [INFO ] After 75ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 785 reset in 189 ms.
Product exploration explored 100000 steps with 779 reset in 187 ms.
Built C files in :
/tmp/ltsmin10137301210998661329
[2024-05-24 16:41:15] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2024-05-24 16:41:15] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:41:15] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2024-05-24 16:41:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:41:15] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2024-05-24 16:41:15] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:41:15] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10137301210998661329
Running compilation step : cd /tmp/ltsmin10137301210998661329;'/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 547 ms.
Running link step : cd /tmp/ltsmin10137301210998661329;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10137301210998661329;'/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/stateBased12153428592778388070.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 225/225 transitions.
Applied a total of 0 rules in 13 ms. Remains 64 /64 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2024-05-24 16:41:30] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
// Phase 1: matrix 179 rows 64 cols
[2024-05-24 16:41:30] [INFO ] Computed 8 invariants in 10 ms
[2024-05-24 16:41:30] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-24 16:41:30] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:41:30] [INFO ] Invariant cache hit.
[2024-05-24 16:41:30] [INFO ] State equation strengthened by 57 read => feed constraints.
[2024-05-24 16:41:30] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2024-05-24 16:41:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 16:41:30] [INFO ] Flow matrix only has 179 transitions (discarded 46 similar events)
[2024-05-24 16:41:30] [INFO ] Invariant cache hit.
[2024-05-24 16:41:30] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 305 ms. Remains : 64/64 places, 225/225 transitions.
Built C files in :
/tmp/ltsmin457551726684914303
[2024-05-24 16:41:30] [INFO ] Computing symmetric may disable matrix : 225 transitions.
[2024-05-24 16:41:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:41:30] [INFO ] Computing symmetric may enable matrix : 225 transitions.
[2024-05-24 16:41:30] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:41:30] [INFO ] Computing Do-Not-Accords matrix : 225 transitions.
[2024-05-24 16:41:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:41:30] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin457551726684914303
Running compilation step : cd /tmp/ltsmin457551726684914303;'/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 438 ms.
Running link step : cd /tmp/ltsmin457551726684914303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin457551726684914303;'/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/stateBased7187769224463358466.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 16:41:45] [INFO ] Flatten gal took : 17 ms
[2024-05-24 16:41:45] [INFO ] Flatten gal took : 15 ms
[2024-05-24 16:41:45] [INFO ] Time to serialize gal into /tmp/LTL8827369835838573793.gal : 3 ms
[2024-05-24 16:41:45] [INFO ] Time to serialize properties into /tmp/LTL16729710352200969751.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8827369835838573793.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11187363106072981480.hoa' '-atoms' '/tmp/LTL16729710352200969751.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16729710352200969751.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11187363106072981480.hoa
Detected timeout of ITS tools.
[2024-05-24 16:42:00] [INFO ] Flatten gal took : 14 ms
[2024-05-24 16:42:00] [INFO ] Flatten gal took : 14 ms
[2024-05-24 16:42:00] [INFO ] Time to serialize gal into /tmp/LTL1679998484776859277.gal : 3 ms
[2024-05-24 16:42:00] [INFO ] Time to serialize properties into /tmp/LTL16215478340474196545.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1679998484776859277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16215478340474196545.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p12<1)||(x3_HQ_q2<1))||(ch2_AA_q5<1))"))))
Formula 0 simplified : GF!"(((p12<1)||(x3_HQ_q2<1))||(ch2_AA_q5<1))"
Detected timeout of ITS tools.
[2024-05-24 16:42:15] [INFO ] Flatten gal took : 16 ms
[2024-05-24 16:42:15] [INFO ] Applying decomposition
[2024-05-24 16:42:15] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1385829215951040051.txt' '-o' '/tmp/graph1385829215951040051.bin' '-w' '/tmp/graph1385829215951040051.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1385829215951040051.bin' '-l' '-1' '-v' '-w' '/tmp/graph1385829215951040051.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:42:16] [INFO ] Decomposing Gal with order
[2024-05-24 16:42:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:42:16] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-24 16:42:16] [INFO ] Flatten gal took : 51 ms
[2024-05-24 16:42:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 91 labels/synchronizations in 7 ms.
[2024-05-24 16:42:16] [INFO ] Time to serialize gal into /tmp/LTL2121044700009013300.gal : 4 ms
[2024-05-24 16:42:16] [INFO ] Time to serialize properties into /tmp/LTL4875464687112386386.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2121044700009013300.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4875464687112386386.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G("(((i2.u3.p12<1)||(i2.u3.x3_HQ_q2<1))||(i2.u3.ch2_AA_q5<1))"))))
Formula 0 simplified : GF!"(((i2.u3.p12<1)||(i2.u3.x3_HQ_q2<1))||(i2.u3.ch2_AA_q5<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3717447815616145141
[2024-05-24 16:42:31] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3717447815616145141
Running compilation step : cd /tmp/ltsmin3717447815616145141;'/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 353 ms.
Running link step : cd /tmp/ltsmin3717447815616145141;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3717447815616145141;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Medical-PT-06-LTLFireability-01 finished in 107694 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(p0)))'
[2024-05-24 16:42:46] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14500830968434741291
[2024-05-24 16:42:46] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2024-05-24 16:42:46] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:42:46] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2024-05-24 16:42:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:42:46] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2024-05-24 16:42:46] [INFO ] Applying decomposition
[2024-05-24 16:42:46] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 16:42:46] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14500830968434741291
Running compilation step : cd /tmp/ltsmin14500830968434741291;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-24 16:42:46] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17732477844764888028.txt' '-o' '/tmp/graph17732477844764888028.bin' '-w' '/tmp/graph17732477844764888028.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17732477844764888028.bin' '-l' '-1' '-v' '-w' '/tmp/graph17732477844764888028.weights' '-q' '0' '-e' '0.001'
[2024-05-24 16:42:46] [INFO ] Decomposing Gal with order
[2024-05-24 16:42:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 16:42:46] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-24 16:42:46] [INFO ] Flatten gal took : 21 ms
[2024-05-24 16:42:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 3 ms.
[2024-05-24 16:42:46] [INFO ] Time to serialize gal into /tmp/LTLFireability17116690397663524125.gal : 2 ms
[2024-05-24 16:42:46] [INFO ] Time to serialize properties into /tmp/LTLFireability9061785567647294835.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17116690397663524125.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9061785567647294835.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(G("(((u2.p12<1)||(u2.x3_HQ_q2<1))||(u2.ch2_AA_q5<1))"))))
Formula 0 simplified : GF!"(((u2.p12<1)||(u2.x3_HQ_q2<1))||(u2.ch2_AA_q5<1))"
Compilation finished in 496 ms.
Running link step : cd /tmp/ltsmin14500830968434741291;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14500830968434741291;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.005: Initializing POR dependencies: labels 228, guards 227
pins2lts-mc-linux64( 1/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.020: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.020: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.108: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.222: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 0.222: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.222: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.255: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 0.306: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.321: There are 229 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.321: State length is 68, there are 231 groups
pins2lts-mc-linux64( 0/ 8), 0.321: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.321: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.321: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.321: Visible groups: 0 / 231, labels: 1 / 229
pins2lts-mc-linux64( 0/ 8), 0.321: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.321: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.331: [Blue] ~96 levels ~960 states ~1488 transitions
pins2lts-mc-linux64( 0/ 8), 0.369: [Blue] ~185 levels ~1920 states ~3216 transitions
pins2lts-mc-linux64( 2/ 8), 0.430: [Blue] ~420 levels ~3840 states ~6824 transitions
pins2lts-mc-linux64( 2/ 8), 0.523: [Blue] ~821 levels ~7680 states ~13656 transitions
pins2lts-mc-linux64( 3/ 8), 0.736: [Blue] ~1248 levels ~15360 states ~19904 transitions
pins2lts-mc-linux64( 2/ 8), 1.158: [Blue] ~2612 levels ~30720 states ~43008 transitions
pins2lts-mc-linux64( 3/ 8), 2.291: [Blue] ~4704 levels ~61440 states ~75200 transitions
pins2lts-mc-linux64( 2/ 8), 3.081: [Blue] ~9524 levels ~122880 states ~153600 transitions
pins2lts-mc-linux64( 2/ 8), 4.277: [Blue] ~18740 levels ~245760 states ~301056 transitions
pins2lts-mc-linux64( 2/ 8), 6.155: [Blue] ~37172 levels ~491520 states ~595968 transitions
pins2lts-mc-linux64( 2/ 8), 9.151: [Blue] ~74036 levels ~983040 states ~1185792 transitions
pins2lts-mc-linux64( 2/ 8), 14.972: [Blue] ~147764 levels ~1966080 states ~2365440 transitions
pins2lts-mc-linux64( 2/ 8), 27.102: [Blue] ~295220 levels ~3932160 states ~4724736 transitions
pins2lts-mc-linux64( 2/ 8), 51.510: [Blue] ~590132 levels ~7864320 states ~9443328 transitions
pins2lts-mc-linux64( 3/ 8), 99.784: [Blue] ~1179744 levels ~15728640 states ~18875840 transitions
pins2lts-mc-linux64( 3/ 8), 195.863: [Blue] ~2359392 levels ~31457280 states ~37750208 transitions
pins2lts-mc-linux64( 0/ 8), 275.060: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 275.147:
pins2lts-mc-linux64( 0/ 8), 275.147: Explored 31032382 states 60980225 transitions, fanout: 1.965
pins2lts-mc-linux64( 0/ 8), 275.147: Total exploration time 274.800 sec (274.730 sec minimum, 274.769 sec on average)
pins2lts-mc-linux64( 0/ 8), 275.147: States per second: 112927, Transitions per second: 221908
pins2lts-mc-linux64( 0/ 8), 275.147:
pins2lts-mc-linux64( 0/ 8), 275.147: State space has 58769518 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 275.147: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 275.147: blue states: 31032382 (52.80%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 275.147: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 275.147: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 275.147:
pins2lts-mc-linux64( 0/ 8), 275.147: Total memory used for local state coloring: 349.4MB
pins2lts-mc-linux64( 0/ 8), 275.147:
pins2lts-mc-linux64( 0/ 8), 275.147: Queue width: 8B, total height: 22899610, memory: 174.71MB
pins2lts-mc-linux64( 0/ 8), 275.147: Tree memory: 704.4MB, 12.6 B/state, compr.: 4.6%
pins2lts-mc-linux64( 0/ 8), 275.147: Tree fill ratio (roots/leafs): 43.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 275.147: Stored 227 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 275.147: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 275.147: Est. total memory use: 879.1MB (~1198.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14500830968434741291;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14500830968434741291;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 17:03:25] [INFO ] Flatten gal took : 13 ms
[2024-05-24 17:03:25] [INFO ] Time to serialize gal into /tmp/LTLFireability8473736618667383543.gal : 2 ms
[2024-05-24 17:03:25] [INFO ] Time to serialize properties into /tmp/LTLFireability3750916630994526582.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8473736618667383543.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3750916630994526582.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((F(G("(((p12<1)||(x3_HQ_q2<1))||(ch2_AA_q5<1))"))))
Formula 0 simplified : GF!"(((p12<1)||(x3_HQ_q2<1))||(ch2_AA_q5<1))"
Detected timeout of ITS tools.
[2024-05-24 17:24:05] [INFO ] Flatten gal took : 15 ms
[2024-05-24 17:24:05] [INFO ] Input system was already deterministic with 227 transitions.
[2024-05-24 17:24:05] [INFO ] Transformed 67 places.
[2024-05-24 17:24:05] [INFO ] Transformed 227 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 17:24:05] [INFO ] Time to serialize gal into /tmp/LTLFireability3096811138515907517.gal : 2 ms
[2024-05-24 17:24:05] [INFO ] Time to serialize properties into /tmp/LTLFireability13121882093011121938.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3096811138515907517.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13121882093011121938.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G("(((p12<1)||(x3_HQ_q2<1))||(ch2_AA_q5<1))"))))
Formula 0 simplified : GF!"(((p12<1)||(x3_HQ_q2<1))||(ch2_AA_q5<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 4979892 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16037668 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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="Medical-PT-06"
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 Medical-PT-06, 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 r241-tall-171649628700333"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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