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.r024-tall-165251918800644.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 CSRepetitions-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800644
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 73K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 291K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K Apr 30 05:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 344K Apr 30 05:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 38K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 47K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 151K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 162K May 10 09:33 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 CSRepetitions-PT-05-LTLFireability-00
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-01
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-02
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-03
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-04
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-05
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-06
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-07
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-08
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-09
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-10
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-11
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-12
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-13
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-14
FORMULA_NAME CSRepetitions-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652671688441

Running Version 202205111006
[2022-05-16 03:28:09] [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-16 03:28:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 03:28:09] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-16 03:28:09] [INFO ] Transformed 206 places.
[2022-05-16 03:28:09] [INFO ] Transformed 325 transitions.
[2022-05-16 03:28:09] [INFO ] Parsed PT model containing 206 places and 325 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-PT-05-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-05-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 206 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:09] [INFO ] Computed 30 place invariants in 20 ms
[2022-05-16 03:28:10] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:10] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-16 03:28:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:10] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:10] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-16 03:28:10] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Support contains 206 out of 206 places after structural reductions.
[2022-05-16 03:28:11] [INFO ] Flatten gal took : 444 ms
[2022-05-16 03:28:11] [INFO ] Flatten gal took : 40 ms
[2022-05-16 03:28:11] [INFO ] Input system was already deterministic with 325 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 20) seen :19
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:11] [INFO ] Computed 30 place invariants in 5 ms
[2022-05-16 03:28:11] [INFO ] After 35ms 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 13 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' '!(X(F((X(F(F(p0)))&&p1))))'
Support contains 175 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:12] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:12] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:12] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-16 03:28:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:12] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:12] [INFO ] Computed 30 place invariants in 6 ms
[2022-05-16 03:28:12] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s0 1) (LT s130 1) (LT s131 1) (LT s66 1) (LT s8 1) (LT s138 1) (LT s75 1) (LT s141 1) (LT s19 1) (LT s151 1) (LT s25 1) (LT s29 1) (LT s96 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 1354 reset in 793 ms.
Stack based approach found an accepted trace after 2931 steps with 40 reset with depth 45 and stack size 45 in 31 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-00 finished in 1443 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((F(X(p0))||F(!p0)) U (X(p1)&&p0)))'
Support contains 180 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:13] [INFO ] Computed 30 place invariants in 17 ms
[2022-05-16 03:28:13] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:13] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-16 03:28:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:13] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:13] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 03:28:13] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (AND p0 p1), p1]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s169 1) (GEQ s187 1)) (AND (GEQ s100 1) (GEQ s183 1)) (AND (GEQ s42 1) (GEQ s187 1)) (AND (GEQ s100 1) (GEQ s122 1)) (AND (GEQ s38 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-01 finished in 491 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(X(p0))) U (X(p1)||X(p0))))'
Support contains 175 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 3 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:14] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:14] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:14] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:14] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:14] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 03:28:14] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s53 1) (GEQ s203 1)) (AND (GEQ s46 1) (GEQ s109 1)) (AND (GEQ s60 1) (GEQ s167 1)) (AND (GEQ s32 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s4...], 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-03 finished in 497 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F((X(p0)||F(p1))))))'
Support contains 56 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 31 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:14] [INFO ] Computed 30 place invariants in 5 ms
[2022-05-16 03:28:14] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:14] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:14] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:14] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2022-05-16 03:28:14] [INFO ] Redundant transitions in 18 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:14] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:14] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s86 1) (GEQ s123 1)) (AND (GEQ s73 1) (GEQ s86 1)) (AND (GEQ s86 1) (GEQ s126 1)) (AND (GEQ s86 1) (GEQ s198 1)) (AND (GEQ s53 1) (GEQ s8...], 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 162 steps with 4 reset in 4 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-04 finished in 566 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 30 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 195 place count 36 transition count 180
Iterating global reduction 0 with 120 rules applied. Total rules applied 315 place count 36 transition count 180
Applied a total of 315 rules in 50 ms. Remains 36 /206 variables (removed 170) and now considering 180/325 (removed 145) transitions.
// Phase 1: matrix 180 rows 36 cols
[2022-05-16 03:28:15] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 03:28:15] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 180 rows 36 cols
[2022-05-16 03:28:15] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 03:28:15] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2022-05-16 03:28:15] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 180 rows 36 cols
[2022-05-16 03:28:15] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-16 03:28:15] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/206 places, 180/325 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/206 places, 180/325 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s28 1) (GEQ s32 1)) (AND (GEQ s19 1) (GEQ s31 1)) (AND (GEQ s11 1) (GEQ s32 1)) (AND (GEQ s19 1) (GEQ s23 1)) (AND (GEQ s10 1) (GEQ s34 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]]
Product exploration explored 100000 steps with 50000 reset in 454 ms.
Product exploration explored 100000 steps with 50000 reset in 413 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-05-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-05-LTLFireability-05 finished in 1226 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(!(false U !p1))))'
Support contains 175 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 18 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:16] [INFO ] Computed 30 place invariants in 3 ms
[2022-05-16 03:28:16] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:16] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-16 03:28:16] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:16] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2022-05-16 03:28:16] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:16] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 03:28:16] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s53 1) (GEQ s203 1)) (AND (GEQ s46 1) (GEQ s109 1)) (AND (GEQ s60 1) (GEQ s167 1)) (AND (GEQ s32 1) (GEQ s63 1)) (AND (GEQ s26 1) (GEQ s4...], 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]]
Product exploration explored 100000 steps with 7756 reset in 1058 ms.
Product exploration explored 100000 steps with 7793 reset in 1130 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:19] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 03:28:20] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2022-05-16 03:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:28:20] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2022-05-16 03:28:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:28:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2022-05-16 03:28:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:28:21] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2022-05-16 03:28:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:21] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2022-05-16 03:28:21] [INFO ] Computed and/alt/rep : 300/425/300 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-16 03:28:21] [INFO ] Added : 20 causal constraints over 4 iterations in 147 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 175 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 16 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:21] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 03:28:21] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:21] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:21] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:21] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-05-16 03:28:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:21] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:21] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 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 p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 340 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 2 AP to 1 states, 1 edges and 2 AP.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:22] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:23] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2022-05-16 03:28:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 03:28:23] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2022-05-16 03:28:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 03:28:24] [INFO ] [Nat]Absence check using 30 positive place invariants in 8 ms returned sat
[2022-05-16 03:28:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 03:28:24] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2022-05-16 03:28:24] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:24] [INFO ] [Nat]Added 25 Read/Feed constraints in 4 ms returned sat
[2022-05-16 03:28:24] [INFO ] Computed and/alt/rep : 300/425/300 causal constraints (skipped 0 transitions) in 18 ms.
[2022-05-16 03:28:24] [INFO ] Added : 20 causal constraints over 4 iterations in 117 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7706 reset in 1041 ms.
Product exploration explored 100000 steps with 7836 reset in 1066 ms.
Built C files in :
/tmp/ltsmin15272960376293810248
[2022-05-16 03:28:26] [INFO ] Computing symmetric may disable matrix : 325 transitions.
[2022-05-16 03:28:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:28:26] [INFO ] Computing symmetric may enable matrix : 325 transitions.
[2022-05-16 03:28:26] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:28:26] [INFO ] Computing Do-Not-Accords matrix : 325 transitions.
[2022-05-16 03:28:26] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:28:26] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15272960376293810248
Running compilation step : cd /tmp/ltsmin15272960376293810248;'/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 961 ms.
Running link step : cd /tmp/ltsmin15272960376293810248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin15272960376293810248;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7013924760034231900.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 175 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 16 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:41] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:28:41] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:41] [INFO ] Computed 30 place invariants in 7 ms
[2022-05-16 03:28:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:28:41] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2022-05-16 03:28:41] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:28:41] [INFO ] Computed 30 place invariants in 4 ms
[2022-05-16 03:28:42] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Built C files in :
/tmp/ltsmin2853129632257770945
[2022-05-16 03:28:42] [INFO ] Computing symmetric may disable matrix : 325 transitions.
[2022-05-16 03:28:42] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:28:42] [INFO ] Computing symmetric may enable matrix : 325 transitions.
[2022-05-16 03:28:42] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:28:42] [INFO ] Computing Do-Not-Accords matrix : 325 transitions.
[2022-05-16 03:28:42] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:28:42] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2853129632257770945
Running compilation step : cd /tmp/ltsmin2853129632257770945;'/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 671 ms.
Running link step : cd /tmp/ltsmin2853129632257770945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2853129632257770945;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17303148249231290587.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 03:28:57] [INFO ] Flatten gal took : 21 ms
[2022-05-16 03:28:57] [INFO ] Flatten gal took : 20 ms
[2022-05-16 03:28:57] [INFO ] Time to serialize gal into /tmp/LTL2552566038749441221.gal : 6 ms
[2022-05-16 03:28:57] [INFO ] Time to serialize properties into /tmp/LTL15339382024541452470.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2552566038749441221.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15339382024541452470.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2552566...267
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((Client_Sending_1>=1)&&(Server_Anwering_1_2>=1))||((Client_Sending_6>=1)&&(Server_Anwering_6_2>=1)))||(((Client_Sending...7435
Formula 0 simplified : !(F"(((((((((Client_Sending_1>=1)&&(Server_Anwering_1_2>=1))||((Client_Sending_6>=1)&&(Server_Anwering_6_2>=1)))||(((Client_Sending_...7428
Detected timeout of ITS tools.
[2022-05-16 03:29:12] [INFO ] Flatten gal took : 20 ms
[2022-05-16 03:29:12] [INFO ] Applying decomposition
[2022-05-16 03:29:12] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph6294101708280887243.txt' '-o' '/tmp/graph6294101708280887243.bin' '-w' '/tmp/graph6294101708280887243.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph6294101708280887243.bin' '-l' '-1' '-v' '-w' '/tmp/graph6294101708280887243.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:29:12] [INFO ] Decomposing Gal with order
[2022-05-16 03:29:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:29:12] [INFO ] Removed a total of 175 redundant transitions.
[2022-05-16 03:29:12] [INFO ] Flatten gal took : 117 ms
[2022-05-16 03:29:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2022-05-16 03:29:12] [INFO ] Time to serialize gal into /tmp/LTL8759905462394734524.gal : 3 ms
[2022-05-16 03:29:12] [INFO ] Time to serialize properties into /tmp/LTL2977330082896291355.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8759905462394734524.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2977330082896291355.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8759905...245
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((u28.Client_Sending_1>=1)&&(u27.Server_Anwering_1_2>=1))||((u16.Client_Sending_6>=1)&&(u27.Server_Anwering_6_2>=1)))||(...8456
Formula 0 simplified : !(F"(((((((((u28.Client_Sending_1>=1)&&(u27.Server_Anwering_1_2>=1))||((u16.Client_Sending_6>=1)&&(u27.Server_Anwering_6_2>=1)))||((...8449
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin366525099981562640
[2022-05-16 03:29:27] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin366525099981562640
Running compilation step : cd /tmp/ltsmin366525099981562640;'/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 485 ms.
Running link step : cd /tmp/ltsmin366525099981562640;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin366525099981562640;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>((LTLAPp0==true))||<>(!(false U !(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-PT-05-LTLFireability-06 finished in 86499 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(F(G((G(p1)&&p0)))))||X(p1))))'
Support contains 56 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 14 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:43] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:43] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:43] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:29:44] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:44] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 03:29:44] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (OR (LT s86 1) (LT s123 1)) (OR (LT s73 1) (LT s86 1)) (OR (LT s86 1) (LT s126 1)) (OR (LT s86 1) (LT s198 1)) (OR (LT s53 1) (LT s86 1)) (OR (LT ...], 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 1291 reset in 973 ms.
Stack based approach found an accepted trace after 4722 steps with 62 reset with depth 11 and stack size 11 in 45 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-07 finished in 2580 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 156 transition count 300
Discarding 120 places :
Symmetric choice reduction at 0 with 120 rule applications. Total rules 195 place count 36 transition count 180
Iterating global reduction 0 with 120 rules applied. Total rules applied 315 place count 36 transition count 180
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 335 place count 16 transition count 60
Iterating global reduction 0 with 20 rules applied. Total rules applied 355 place count 16 transition count 60
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 375 place count 16 transition count 40
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 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 387 place count 8 transition count 36
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 8 edges and 8 vertex of which 5 / 8 are part of one of the 1 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 16 rules applied. Total rules applied 403 place count 4 transition count 21
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 416 place count 4 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 4 transition count 7
Applied a total of 417 rules in 25 ms. Remains 4 /206 variables (removed 202) and now considering 7/325 (removed 318) transitions.
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 03:29:45] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 03:29:45] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 03:29:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 03:29:45] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-16 03:29:45] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 7 rows 4 cols
[2022-05-16 03:29:45] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 03:29:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/206 places, 7/325 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/206 places, 7/325 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-08 finished in 156 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(X((X(!(p0 U !F(p1)))||p2))))))'
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 63 rules applied. Total rules applied 63 place count 164 transition count 304
Discarding 100 places :
Symmetric choice reduction at 0 with 100 rule applications. Total rules 163 place count 64 transition count 204
Iterating global reduction 0 with 100 rules applied. Total rules applied 263 place count 64 transition count 204
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 280 place count 47 transition count 102
Iterating global reduction 0 with 17 rules applied. Total rules applied 297 place count 47 transition count 102
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 314 place count 47 transition count 85
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 324 place count 42 transition count 80
Applied a total of 324 rules in 20 ms. Remains 42 /206 variables (removed 164) and now considering 80/325 (removed 245) transitions.
[2022-05-16 03:29:45] [INFO ] Flow matrix only has 64 transitions (discarded 16 similar events)
// Phase 1: matrix 64 rows 42 cols
[2022-05-16 03:29:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 03:29:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-16 03:29:45] [INFO ] Flow matrix only has 64 transitions (discarded 16 similar events)
// Phase 1: matrix 64 rows 42 cols
[2022-05-16 03:29:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 03:29:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-16 03:29:45] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2022-05-16 03:29:45] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 03:29:45] [INFO ] Flow matrix only has 64 transitions (discarded 16 similar events)
// Phase 1: matrix 64 rows 42 cols
[2022-05-16 03:29:45] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 03:29:45] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/206 places, 80/325 transitions.
Finished structural reductions, in 1 iterations. Remains : 42/206 places, 80/325 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (OR (LT s7 1) (LT s21 1)) (OR (LT s18 1) (LT s25 1))), p0:(GEQ s28 1), p1:(GEQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 5097 reset in 250 ms.
Stack based approach found an accepted trace after 112 steps with 6 reset with depth 14 and stack size 14 in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-10 finished in 531 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((F(X(p1))||p2))))'
Support contains 5 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:46] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:46] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:46] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:29:46] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:46] [INFO ] Computed 30 place invariants in 1 ms
[2022-05-16 03:29:46] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(GEQ s179 1), p1:(AND (GEQ s86 1) (GEQ s136 1) (GEQ s20 1) (GEQ s38 1)), p0:(OR (LT s20 1) (LT s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 835 steps with 17 reset in 8 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-11 finished in 554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((F(p2)||p1)))&&p0)))'
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:46] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:46] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:46] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:29:46] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:46] [INFO ] Computed 30 place invariants in 9 ms
[2022-05-16 03:29:47] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s136 1)), p1:(OR (LT s82 1) (LT s191 1) (LT s4 1) (LT s178 1)), p2:(OR (LT s82 1) (LT s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-13 finished in 576 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||X(G(p1))||F(G(p0))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:47] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:47] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:47] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:29:47] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:47] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:47] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s151 1), p1:(AND (GEQ s63 1) (GEQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 186 steps with 29 reset in 2 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-14 finished in 551 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 325/325 transitions.
Applied a total of 0 rules in 10 ms. Remains 206 /206 variables (removed 0) and now considering 325/325 (removed 0) transitions.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:47] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:47] [INFO ] Implicit Places using invariants in 95 ms returned []
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:47] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:47] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 03:29:48] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
// Phase 1: matrix 325 rows 206 cols
[2022-05-16 03:29:48] [INFO ] Computed 30 place invariants in 2 ms
[2022-05-16 03:29:48] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 206/206 places, 325/325 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-05-LTLFireability-15 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=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s46 1) (LT s170 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 191 steps with 2 reset in 3 ms.
FORMULA CSRepetitions-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-05-LTLFireability-15 finished in 670 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||F(!(false U !p1))))'
[2022-05-16 03:29:48] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3232384187346796596
[2022-05-16 03:29:48] [INFO ] Computing symmetric may disable matrix : 325 transitions.
[2022-05-16 03:29:48] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:29:48] [INFO ] Applying decomposition
[2022-05-16 03:29:48] [INFO ] Computing symmetric may enable matrix : 325 transitions.
[2022-05-16 03:29:48] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:29:48] [INFO ] Flatten gal took : 24 ms
[2022-05-16 03:29:48] [INFO ] Computing Do-Not-Accords matrix : 325 transitions.
[2022-05-16 03:29:48] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:29:48] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3232384187346796596
Running compilation step : cd /tmp/ltsmin3232384187346796596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2485651779319973533.txt' '-o' '/tmp/graph2485651779319973533.bin' '-w' '/tmp/graph2485651779319973533.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2485651779319973533.bin' '-l' '-1' '-v' '-w' '/tmp/graph2485651779319973533.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:29:48] [INFO ] Decomposing Gal with order
[2022-05-16 03:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:29:48] [INFO ] Removed a total of 200 redundant transitions.
[2022-05-16 03:29:48] [INFO ] Flatten gal took : 56 ms
[2022-05-16 03:29:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2022-05-16 03:29:48] [INFO ] Time to serialize gal into /tmp/LTLFireability16860915186984014632.gal : 3 ms
[2022-05-16 03:29:48] [INFO ] Time to serialize properties into /tmp/LTLFireability5979613770591577058.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16860915186984014632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5979613770591577058.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((u8.Client_Sending_1>=1)&&(u29.Server_Anwering_1_2>=1))||((u16.Client_Sending_6>=1)&&(u29.Server_Anwering_6_2>=1)))||((...8437
Formula 0 simplified : !(F"(((((((((u8.Client_Sending_1>=1)&&(u29.Server_Anwering_1_2>=1))||((u16.Client_Sending_6>=1)&&(u29.Server_Anwering_6_2>=1)))||(((...8430
Compilation finished in 684 ms.
Running link step : cd /tmp/ltsmin3232384187346796596;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3232384187346796596;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>((LTLAPp0==true))||<>(!(false U !(LTLAPp1==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-16 03:50:22] [INFO ] Flatten gal took : 50 ms
[2022-05-16 03:50:22] [INFO ] Time to serialize gal into /tmp/LTLFireability12457962513631795197.gal : 12 ms
[2022-05-16 03:50:22] [INFO ] Time to serialize properties into /tmp/LTLFireability18086367954979192478.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12457962513631795197.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability18086367954979192478.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...290
Read 1 LTL properties
Checking formula 0 : !(((F("(((((((((Client_Sending_1>=1)&&(Server_Anwering_1_2>=1))||((Client_Sending_6>=1)&&(Server_Anwering_6_2>=1)))||(((Client_Sending...7435
Formula 0 simplified : !(F"(((((((((Client_Sending_1>=1)&&(Server_Anwering_1_2>=1))||((Client_Sending_6>=1)&&(Server_Anwering_6_2>=1)))||(((Client_Sending_...7428
Detected timeout of ITS tools.
[2022-05-16 04:10:57] [INFO ] Flatten gal took : 71 ms
[2022-05-16 04:10:57] [INFO ] Input system was already deterministic with 325 transitions.
[2022-05-16 04:10:57] [INFO ] Transformed 206 places.
[2022-05-16 04:10:57] [INFO ] Transformed 325 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/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//..//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
[2022-05-16 04:10:57] [INFO ] Time to serialize gal into /tmp/LTLFireability15082111854637311310.gal : 2 ms
[2022-05-16 04:10:57] [INFO ] Time to serialize properties into /tmp/LTLFireability16594394764498449375.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15082111854637311310.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16594394764498449375.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F("(((((((((Client_Sending_1>=1)&&(Server_Anwering_1_2>=1))||((Client_Sending_6>=1)&&(Server_Anwering_6_2>=1)))||(((Client_Sending...7435
Formula 0 simplified : !(F"(((((((((Client_Sending_1>=1)&&(Server_Anwering_1_2>=1))||((Client_Sending_6>=1)&&(Server_Anwering_6_2>=1)))||(((Client_Sending_...7428
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t7, t8, t10, t11, t12, t13, t14, t20, t21, t23, t29, t30, t31, t32, t34, t36, t39...1156
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
44065 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,440.694,3677084,1,0,873,2.54769e+07,18,355,3883,1.42726e+07,286
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CSRepetitions-PT-05-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3575918 ms.

BK_STOP 1652675265518

--------------------
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="CSRepetitions-PT-05"
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 CSRepetitions-PT-05, 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 r024-tall-165251918800644"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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