fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r069-smll-167814395900068
Last Updated
May 14, 2023

About the Execution of ITS-Tools for CSRepetitions-PT-04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3249.199 224301.00 706044.00 765.60 FFTFTFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 36K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 202K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 91K Feb 25 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 381K Feb 25 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114K Feb 25 11:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 504K Feb 25 11:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 87K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678245512387

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-PT-04
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 03:18:34] [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]
[2023-03-08 03:18:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 03:18:34] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-08 03:18:34] [INFO ] Transformed 117 places.
[2023-03-08 03:18:34] [INFO ] Transformed 176 transitions.
[2023-03-08 03:18:34] [INFO ] Parsed PT model containing 117 places and 176 transitions and 624 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-PT-04-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-08 03:18:35] [INFO ] Computed 20 place invariants in 18 ms
[2023-03-08 03:18:35] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-03-08 03:18:35] [INFO ] Invariant cache hit.
[2023-03-08 03:18:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:18:35] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 498 ms to find 0 implicit places.
[2023-03-08 03:18:35] [INFO ] Invariant cache hit.
[2023-03-08 03:18:35] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 710 ms. Remains : 117/117 places, 176/176 transitions.
Support contains 117 out of 117 places after structural reductions.
[2023-03-08 03:18:36] [INFO ] Flatten gal took : 61 ms
[2023-03-08 03:18:36] [INFO ] Flatten gal took : 39 ms
[2023-03-08 03:18:36] [INFO ] Input system was already deterministic with 176 transitions.
Finished random walk after 1213 steps, including 25 resets, run visited all 19 properties in 83 ms. (steps per millisecond=14 )
Computed a total of 0 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p1)&&p0))||(X(p2)&&F(!p2)))))'
Support contains 33 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:18:36] [INFO ] Invariant cache hit.
[2023-03-08 03:18:37] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 03:18:37] [INFO ] Invariant cache hit.
[2023-03-08 03:18:37] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:18:37] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-08 03:18:37] [INFO ] Invariant cache hit.
[2023-03-08 03:18:37] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 478 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 504 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), p2, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=5 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (OR (LT s95 1) (LT s115 1)) (OR (LT s34 1) (LT s115 1)) (OR (LT s5 1) (LT s115 1)) (OR (LT s54 1) (LT s115 1)) (OR (LT s11 1) (LT s115 1)) (OR (LT...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 8406 reset in 570 ms.
Stack based approach found an accepted trace after 7570 steps with 660 reset with depth 20 and stack size 20 in 43 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-00 finished in 1696 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:18:38] [INFO ] Invariant cache hit.
[2023-03-08 03:18:38] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 03:18:38] [INFO ] Invariant cache hit.
[2023-03-08 03:18:38] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:18:38] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-08 03:18:38] [INFO ] Invariant cache hit.
[2023-03-08 03:18:38] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ s50 1)) (AND (GEQ s34 1) (GEQ s81 1)) (AND (GEQ s13 1) (GEQ s61 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 14115 steps with 1288 reset in 109 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-01 finished in 692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(p1))))))'
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:18:39] [INFO ] Invariant cache hit.
[2023-03-08 03:18:39] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 03:18:39] [INFO ] Invariant cache hit.
[2023-03-08 03:18:39] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:18:39] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-08 03:18:39] [INFO ] Invariant cache hit.
[2023-03-08 03:18:39] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 231 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(OR (GEQ s0 1) (GEQ s32 1) (GEQ s100 1) (GEQ s68 1) (GEQ s106 1) (GEQ s107 1) (GEQ s75 1) (GEQ s74 1) (GEQ s14 1) (GEQ s46 1) (GEQ s109 1) (GEQ s80 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 14658 reset in 306 ms.
Product exploration explored 100000 steps with 14670 reset in 337 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 4 factoid took 235 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:18:41] [INFO ] Invariant cache hit.
[2023-03-08 03:18:41] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 03:18:41] [INFO ] Invariant cache hit.
[2023-03-08 03:18:41] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:18:41] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-08 03:18:41] [INFO ] Invariant cache hit.
[2023-03-08 03:18:42] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 26 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 14614 reset in 335 ms.
Product exploration explored 100000 steps with 14604 reset in 360 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:18:44] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 03:18:44] [INFO ] Invariant cache hit.
[2023-03-08 03:18:44] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 179 ms. Remains : 117/117 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin5149669280562604110
[2023-03-08 03:18:44] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5149669280562604110
Running compilation step : cd /tmp/ltsmin5149669280562604110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 604 ms.
Running link step : cd /tmp/ltsmin5149669280562604110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin5149669280562604110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7330551796742459049.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:18:59] [INFO ] Invariant cache hit.
[2023-03-08 03:18:59] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-08 03:18:59] [INFO ] Invariant cache hit.
[2023-03-08 03:18:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:18:59] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-08 03:18:59] [INFO ] Invariant cache hit.
[2023-03-08 03:19:00] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 117/117 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin2009635475792018109
[2023-03-08 03:19:00] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2009635475792018109
Running compilation step : cd /tmp/ltsmin2009635475792018109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 418 ms.
Running link step : cd /tmp/ltsmin2009635475792018109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2009635475792018109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8853843150140013925.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 03:19:15] [INFO ] Flatten gal took : 21 ms
[2023-03-08 03:19:15] [INFO ] Flatten gal took : 19 ms
[2023-03-08 03:19:15] [INFO ] Time to serialize gal into /tmp/LTL5150632464499779054.gal : 5 ms
[2023-03-08 03:19:15] [INFO ] Time to serialize properties into /tmp/LTL14362352349243823388.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5150632464499779054.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3441756536525391200.hoa' '-atoms' '/tmp/LTL14362352349243823388.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL14362352349243823388.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3441756536525391200.hoa
Detected timeout of ITS tools.
[2023-03-08 03:19:30] [INFO ] Flatten gal took : 16 ms
[2023-03-08 03:19:30] [INFO ] Flatten gal took : 15 ms
[2023-03-08 03:19:30] [INFO ] Time to serialize gal into /tmp/LTL6660998258435780571.gal : 3 ms
[2023-03-08 03:19:30] [INFO ] Time to serialize properties into /tmp/LTL3782619913278169376.ltl : 5 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6660998258435780571.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3782619913278169376.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((Client_Waiting_6>=1)||(Client_Waiting_2>=1))||((Client_Waiting_9>=1)||(Client_Waiting_11>=1)))||(((Client_Waiting_13>=1)...841
Formula 0 simplified : X(F!"(((((Client_Waiting_6>=1)||(Client_Waiting_2>=1))||((Client_Waiting_9>=1)||(Client_Waiting_11>=1)))||(((Client_Waiting_13>=1)||...829
Detected timeout of ITS tools.
[2023-03-08 03:19:45] [INFO ] Flatten gal took : 14 ms
[2023-03-08 03:19:45] [INFO ] Applying decomposition
[2023-03-08 03:19:45] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13170429017057777220.txt' '-o' '/tmp/graph13170429017057777220.bin' '-w' '/tmp/graph13170429017057777220.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13170429017057777220.bin' '-l' '-1' '-v' '-w' '/tmp/graph13170429017057777220.weights' '-q' '0' '-e' '0.001'
[2023-03-08 03:19:45] [INFO ] Decomposing Gal with order
[2023-03-08 03:19:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 03:19:45] [INFO ] Removed a total of 80 redundant transitions.
[2023-03-08 03:19:45] [INFO ] Flatten gal took : 83 ms
[2023-03-08 03:19:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-08 03:19:45] [INFO ] Time to serialize gal into /tmp/LTL15104930848727505178.gal : 5 ms
[2023-03-08 03:19:45] [INFO ] Time to serialize properties into /tmp/LTL212945408724640744.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15104930848727505178.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL212945408724640744.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((u13.Client_Waiting_6>=1)||(u16.Client_Waiting_2>=1))||((u15.Client_Waiting_9>=1)||(u0.Client_Waiting_11>=1)))||(((u12.Cl...961
Formula 0 simplified : X(F!"(((((u13.Client_Waiting_6>=1)||(u16.Client_Waiting_2>=1))||((u15.Client_Waiting_9>=1)||(u0.Client_Waiting_11>=1)))||(((u12.Clie...949
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5781712660117891754
[2023-03-08 03:20:00] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5781712660117891754
Running compilation step : cd /tmp/ltsmin5781712660117891754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 418 ms.
Running link step : cd /tmp/ltsmin5781712660117891754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5781712660117891754;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-PT-04-LTLFireability-02 finished in 96759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p1||X(G(!p1)))&&p0))))'
Support contains 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 14 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:20:15] [INFO ] Invariant cache hit.
[2023-03-08 03:20:16] [INFO ] Implicit Places using invariants in 60 ms returned []
[2023-03-08 03:20:16] [INFO ] Invariant cache hit.
[2023-03-08 03:20:16] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:20:16] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
[2023-03-08 03:20:16] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 03:20:16] [INFO ] Invariant cache hit.
[2023-03-08 03:20:16] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 372 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ s50 1)) (AND (GEQ s34 1) (GEQ s81 1)) (AND (GEQ s13 1) (GEQ s61 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1827 reset in 1832 ms.
Stack based approach found an accepted trace after 2556 steps with 45 reset with depth 8 and stack size 8 in 46 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-03 finished in 2369 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 80 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:20:18] [INFO ] Invariant cache hit.
[2023-03-08 03:20:18] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 03:20:18] [INFO ] Invariant cache hit.
[2023-03-08 03:20:18] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:20:18] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-08 03:20:18] [INFO ] Invariant cache hit.
[2023-03-08 03:20:18] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 113 ms :[p0, p0, p0]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s24 1)) (AND (GEQ s18 1) (GEQ s62 1)) (AND (GEQ s17 1) (GEQ s50 1)) (AND (GEQ s34 1) (GEQ s81 1)) (AND (GEQ s13 1) (GEQ s61 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 33333 reset in 389 ms.
Product exploration explored 100000 steps with 33333 reset in 400 ms.
Computed a total of 0 stabilizing places and 16 stable transitions
Computed a total of 0 stabilizing places and 16 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p0)))
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CSRepetitions-PT-04-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLFireability-04 finished in 1297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X((X((!(p1 U p2)||!p1))&&p0)))))'
Support contains 32 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:20:19] [INFO ] Invariant cache hit.
[2023-03-08 03:20:19] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 03:20:19] [INFO ] Invariant cache hit.
[2023-03-08 03:20:19] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:20:19] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-08 03:20:19] [INFO ] Invariant cache hit.
[2023-03-08 03:20:20] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 224 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) p2), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-05 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: 2}], [{ cond=(OR (NOT p0) (AND p1 p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (LT s64 1) (LT s99 1) (LT s98 1) (LT s3 1) (LT s39 1) (LT s8 1) (LT s15 1) (LT s114 1) (LT s113 1) (LT s53 1) (LT s52 1) (LT s116 1) (LT s57 1) (L...], 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, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-05 finished in 684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(G(X(p0)))||X(p0))))'
Support contains 20 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 03:20:20] [INFO ] Invariant cache hit.
[2023-03-08 03:20:20] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 03:20:20] [INFO ] Invariant cache hit.
[2023-03-08 03:20:20] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:20:20] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-08 03:20:20] [INFO ] Invariant cache hit.
[2023-03-08 03:20:20] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s74 1) (GEQ s97 1)) (AND (GEQ s9 1) (GEQ s74 1)) (AND (GEQ s9 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s25 1)) (AND (GEQ s9 1) (GEQ s80 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, 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-04-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-06 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 101 place count 31 transition count 105
Iterating global reduction 0 with 56 rules applied. Total rules applied 157 place count 31 transition count 105
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 167 place count 21 transition count 55
Iterating global reduction 0 with 10 rules applied. Total rules applied 177 place count 21 transition count 55
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 187 place count 21 transition count 45
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 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 195 place count 17 transition count 41
Applied a total of 195 rules in 26 ms. Remains 17 /117 variables (removed 100) and now considering 41/176 (removed 135) transitions.
[2023-03-08 03:20:20] [INFO ] Flow matrix only has 26 transitions (discarded 15 similar events)
// Phase 1: matrix 26 rows 17 cols
[2023-03-08 03:20:20] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 03:20:20] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-08 03:20:20] [INFO ] Flow matrix only has 26 transitions (discarded 15 similar events)
[2023-03-08 03:20:20] [INFO ] Invariant cache hit.
[2023-03-08 03:20:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 03:20:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-08 03:20:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 03:20:21] [INFO ] Flow matrix only has 26 transitions (discarded 15 similar events)
[2023-03-08 03:20:21] [INFO ] Invariant cache hit.
[2023-03-08 03:20:21] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/117 places, 41/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150 ms. Remains : 17/117 places, 41/176 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s12 1), p0:(AND (GEQ s4 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-09 finished in 238 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 85 transition count 160
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 108 place count 25 transition count 100
Iterating global reduction 0 with 60 rules applied. Total rules applied 168 place count 25 transition count 100
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 179 place count 14 transition count 45
Iterating global reduction 0 with 11 rules applied. Total rules applied 190 place count 14 transition count 45
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 201 place count 14 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 207 place count 10 transition count 32
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (trivial) has 8 edges and 10 vertex of which 5 / 10 are part of one of the 1 SCC in 3 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 6 rules applied. Total rules applied 213 place count 6 transition count 27
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 229 place count 6 transition count 11
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 6 transition count 10
Applied a total of 230 rules in 21 ms. Remains 6 /117 variables (removed 111) and now considering 10/176 (removed 166) transitions.
// Phase 1: matrix 10 rows 6 cols
[2023-03-08 03:20:21] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 03:20:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-08 03:20:21] [INFO ] Invariant cache hit.
[2023-03-08 03:20:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-08 03:20:21] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-08 03:20:21] [INFO ] Invariant cache hit.
[2023-03-08 03:20:21] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/117 places, 10/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 113 ms. Remains : 6/117 places, 10/176 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s4 1)), p1:(AND (GEQ s1 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-10 finished in 203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F((p1 U (p2||G(p1))))&&p0)))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-08 03:20:21] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-08 03:20:21] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 03:20:21] [INFO ] Invariant cache hit.
[2023-03-08 03:20:21] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:20:21] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-08 03:20:21] [INFO ] Invariant cache hit.
[2023-03-08 03:20:21] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 439 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s95 1) (GEQ s115 1)), p2:(AND (NOT (AND (GEQ s34 1) (GEQ s84 1))) (LT s98 1)), p1:(LT s98 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 129 steps with 3 reset in 3 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-12 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 101 place count 31 transition count 105
Iterating global reduction 0 with 56 rules applied. Total rules applied 157 place count 31 transition count 105
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 168 place count 20 transition count 50
Iterating global reduction 0 with 11 rules applied. Total rules applied 179 place count 20 transition count 50
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 190 place count 20 transition count 39
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 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 198 place count 16 transition count 35
Applied a total of 198 rules in 14 ms. Remains 16 /117 variables (removed 101) and now considering 35/176 (removed 141) transitions.
[2023-03-08 03:20:21] [INFO ] Flow matrix only has 23 transitions (discarded 12 similar events)
// Phase 1: matrix 23 rows 16 cols
[2023-03-08 03:20:21] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-08 03:20:21] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-08 03:20:21] [INFO ] Flow matrix only has 23 transitions (discarded 12 similar events)
[2023-03-08 03:20:21] [INFO ] Invariant cache hit.
[2023-03-08 03:20:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 03:20:22] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-08 03:20:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:20:22] [INFO ] Flow matrix only has 23 transitions (discarded 12 similar events)
[2023-03-08 03:20:22] [INFO ] Invariant cache hit.
[2023-03-08 03:20:22] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/117 places, 35/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 16/117 places, 35/176 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s8 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 13 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-13 finished in 169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 45 place count 87 transition count 161
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 101 place count 31 transition count 105
Iterating global reduction 0 with 56 rules applied. Total rules applied 157 place count 31 transition count 105
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 169 place count 19 transition count 45
Iterating global reduction 0 with 12 rules applied. Total rules applied 181 place count 19 transition count 45
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 193 place count 19 transition count 33
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 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 201 place count 15 transition count 29
Applied a total of 201 rules in 14 ms. Remains 15 /117 variables (removed 102) and now considering 29/176 (removed 147) transitions.
[2023-03-08 03:20:22] [INFO ] Flow matrix only has 20 transitions (discarded 9 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-08 03:20:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-08 03:20:22] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-08 03:20:22] [INFO ] Flow matrix only has 20 transitions (discarded 9 similar events)
[2023-03-08 03:20:22] [INFO ] Invariant cache hit.
[2023-03-08 03:20:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-08 03:20:22] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-08 03:20:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 03:20:22] [INFO ] Flow matrix only has 20 transitions (discarded 9 similar events)
[2023-03-08 03:20:22] [INFO ] Invariant cache hit.
[2023-03-08 03:20:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/117 places, 29/176 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 15/117 places, 29/176 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s6 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5116 reset in 286 ms.
Stack based approach found an accepted trace after 806 steps with 37 reset with depth 16 and stack size 16 in 4 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-14 finished in 492 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&(F(!p0)||G(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2023-03-08 03:20:22] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-08 03:20:22] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 03:20:22] [INFO ] Invariant cache hit.
[2023-03-08 03:20:22] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-08 03:20:22] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-08 03:20:22] [INFO ] Invariant cache hit.
[2023-03-08 03:20:23] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 405 ms. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), p0, (AND p0 (NOT p1)), (NOT p0), true]
Running random walk in product with property : CSRepetitions-PT-04-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s15 1), p1:(AND (GEQ s102 1) (GEQ s108 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 2 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLFireability-15 finished in 621 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(F(p1))))))'
[2023-03-08 03:20:23] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16288456073276882730
[2023-03-08 03:20:23] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2023-03-08 03:20:23] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:20:23] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2023-03-08 03:20:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:20:23] [INFO ] Applying decomposition
[2023-03-08 03:20:23] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2023-03-08 03:20:23] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 03:20:23] [INFO ] Flatten gal took : 12 ms
[2023-03-08 03:20:23] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16288456073276882730
Running compilation step : cd /tmp/ltsmin16288456073276882730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6600052717630091723.txt' '-o' '/tmp/graph6600052717630091723.bin' '-w' '/tmp/graph6600052717630091723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6600052717630091723.bin' '-l' '-1' '-v' '-w' '/tmp/graph6600052717630091723.weights' '-q' '0' '-e' '0.001'
[2023-03-08 03:20:23] [INFO ] Decomposing Gal with order
[2023-03-08 03:20:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 03:20:23] [INFO ] Removed a total of 80 redundant transitions.
[2023-03-08 03:20:23] [INFO ] Flatten gal took : 44 ms
[2023-03-08 03:20:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-08 03:20:23] [INFO ] Time to serialize gal into /tmp/LTLFireability13442365326834560091.gal : 16 ms
[2023-03-08 03:20:23] [INFO ] Time to serialize properties into /tmp/LTLFireability8892890300499247831.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13442365326834560091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8892890300499247831.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((G("(((((u13.Client_Waiting_6>=1)||(u16.Client_Waiting_2>=1))||((u4.Client_Waiting_9>=1)||(u10.Client_Waiting_11>=1)))||(((u8.Cli...961
Formula 0 simplified : X(F!"(((((u13.Client_Waiting_6>=1)||(u16.Client_Waiting_2>=1))||((u4.Client_Waiting_9>=1)||(u10.Client_Waiting_11>=1)))||(((u8.Clien...949
Compilation finished in 535 ms.
Running link step : cd /tmp/ltsmin16288456073276882730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin16288456073276882730;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X(<>((LTLAPp1==true))))))' '--buchi-type=spotba'
LTSmin run took 111334 ms.
FORMULA CSRepetitions-PT-04-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 220752 ms.

BK_STOP 1678245736688

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="CSRepetitions-PT-04"
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-5348"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-04, 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 r069-smll-167814395900068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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