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 |
| 5461.859 | 507723.00 | 1371300.00 | 1264.20 | FFFFFTTFFFFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918800635.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is CSRepetitions-PT-04, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800635
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 20K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 30 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 167K Apr 30 05:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 24K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.0K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 87K May 10 09:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-00
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-01
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-02
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-03
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-04
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-05
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-06
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-07
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-08
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-09
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-10
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-11
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-12
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-13
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-14
FORMULA_NAME CSRepetitions-PT-04-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1652670267705
Running Version 202205111006
[2022-05-16 03:04:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 03:04:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 03:04:29] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-16 03:04:29] [INFO ] Transformed 117 places.
[2022-05-16 03:04:29] [INFO ] Transformed 176 transitions.
[2022-05-16 03:04:29] [INFO ] Parsed PT model containing 117 places and 176 transitions in 184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-04-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-PT-04-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 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 12 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:29] [INFO ] Computed 20 place invariants in 18 ms
[2022-05-16 03:04:29] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:29] [INFO ] Computed 20 place invariants in 7 ms
[2022-05-16 03:04:29] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:29] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:29] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 03:04:29] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Support contains 101 out of 117 places after structural reductions.
[2022-05-16 03:04:29] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-16 03:04:29] [INFO ] Flatten gal took : 39 ms
FORMULA CSRepetitions-PT-04-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 03:04:29] [INFO ] Flatten gal took : 20 ms
[2022-05-16 03:04:30] [INFO ] Input system was already deterministic with 176 transitions.
Incomplete random walk after 10000 steps, including 223 resets, run finished after 315 ms. (steps per millisecond=31 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:30] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-16 03:04:30] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-16 03:04:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 03:04:30] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-PT-04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 15 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:30] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:04:30] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:30] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:04:30] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:31] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2022-05-16 03:04:31] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:31] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:31] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50 s54 s55 s63 s82 s95 s108) (ADD s3 s8 s15 s31 s39 s52 s53 s57 s64 s91 s92 s98 s99 s113 s114 s116))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 6 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-00 finished in 595 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(X((p0 U !F(!p0))))))))'
Support contains 16 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 7 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:31] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:04:31] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:31] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:31] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:31] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:31] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT 2 (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50 s54 s55 s63 s82 s95 s108))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-01 finished in 434 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((p0 U (G(F(p1)) U p0))))))'
Support contains 68 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.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:31] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:31] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:31] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:31] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:31] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:31] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:32] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(NOT p0), acceptance={0} source=4 dest: 3}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s1 s4 s6 s7 s10 s12 s16 s17 s19 s20 s22 s23 s24 s26 s27 s30 s33 s35 s36 s37 s38 s40 s41 s43 s44 s47 s49 s51 s56 s59 s60 s61 s62 s65 s66 s67...], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 45236 steps with 1377 reset in 270 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-02 finished in 683 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((X(p0)||p1)))||X(p1))))'
Support contains 21 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 11 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:32] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:32] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:32] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:04:32] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:32] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:32] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:32] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s2 s9 s25 s97)), p0:(LEQ s115 (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50 s54 s55 s63 s82 s95 s108))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4962 reset in 350 ms.
Product exploration explored 100000 steps with 4998 reset in 354 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 310 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3355 steps, including 75 resets, run visited all 3 properties in 21 ms. (steps per millisecond=159 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 334 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 21 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 7 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:34] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:34] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:34] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-16 03:04:34] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:34] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:34] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:34] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 262 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 228 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:35] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:35] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 03:04:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2022-05-16 03:04:35] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 03:04:35] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:35] [INFO ] After 19ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 03:04:35] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2022-05-16 03:04:35] [INFO ] After 161ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 56 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=28 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 316 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4952 reset in 311 ms.
Product exploration explored 100000 steps with 4991 reset in 446 ms.
Built C files in :
/tmp/ltsmin18232298394229954363
[2022-05-16 03:04:36] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18232298394229954363
Running compilation step : cd /tmp/ltsmin18232298394229954363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 356 ms.
Running link step : cd /tmp/ltsmin18232298394229954363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18232298394229954363;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7721436068562727310.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 21 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 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:51] [INFO ] Implicit Places using invariants in 71 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:51] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:52] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:04:52] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:04:52] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:04:52] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin15702604909904287309
[2022-05-16 03:04:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15702604909904287309
Running compilation step : cd /tmp/ltsmin15702604909904287309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 280 ms.
Running link step : cd /tmp/ltsmin15702604909904287309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15702604909904287309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3446069726772437073.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 03:05:07] [INFO ] Flatten gal took : 56 ms
[2022-05-16 03:05:07] [INFO ] Flatten gal took : 11 ms
[2022-05-16 03:05:07] [INFO ] Time to serialize gal into /tmp/LTL5811413343544814391.gal : 3 ms
[2022-05-16 03:05:07] [INFO ] Time to serialize properties into /tmp/LTL10835553483288316023.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5811413343544814391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10835553483288316023.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5811413...267
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(RequestBufferSlots<=((((Client_Sending_8+Client_Sending_2)+(Client_Sending_9+Client_Sending_16))+((Client_Sending_10+Cl...545
Formula 0 simplified : !G(FG("(((Server_Waiting_4+Server_Waiting_2)+(Server_Waiting_1+Server_Waiting_3))>=3)" | X"(RequestBufferSlots<=((((Client_Sending_8...531
Detected timeout of ITS tools.
[2022-05-16 03:05:22] [INFO ] Flatten gal took : 27 ms
[2022-05-16 03:05:22] [INFO ] Applying decomposition
[2022-05-16 03:05:22] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1804556886977683010.txt' '-o' '/tmp/graph1804556886977683010.bin' '-w' '/tmp/graph1804556886977683010.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1804556886977683010.bin' '-l' '-1' '-v' '-w' '/tmp/graph1804556886977683010.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:05:22] [INFO ] Decomposing Gal with order
[2022-05-16 03:05:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:05:22] [INFO ] Removed a total of 127 redundant transitions.
[2022-05-16 03:05:22] [INFO ] Flatten gal took : 176 ms
[2022-05-16 03:05:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 220 labels/synchronizations in 25 ms.
[2022-05-16 03:05:22] [INFO ] Time to serialize gal into /tmp/LTL17824959902920582478.gal : 13 ms
[2022-05-16 03:05:22] [INFO ] Time to serialize properties into /tmp/LTL12526872958177148833.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17824959902920582478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12526872958177148833.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1782495...268
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(gu1.RequestBufferSlots<=((((gu1.Client_Sending_8+gu1.Client_Sending_2)+(gu1.Client_Sending_9+gu1.Client_Sending_16))+((...677
Formula 0 simplified : !G(FG("(((gi1.gu0.Server_Waiting_4+gi1.gu0.Server_Waiting_2)+(gi1.gu0.Server_Waiting_1+gi1.gu0.Server_Waiting_3))>=3)" | X"(gu1.Requ...663
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7230911542588577479
[2022-05-16 03:05:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7230911542588577479
Running compilation step : cd /tmp/ltsmin7230911542588577479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 281 ms.
Running link step : cd /tmp/ltsmin7230911542588577479;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin7230911542588577479;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-PT-04-LTLCardinality-03 finished in 80612 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0)&&!p0))||G(p1)))'
Support contains 36 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 9 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:53] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:53] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-05-16 03:05:53] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:53] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 03:05:53] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(GT 1 (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50 s54 s55 s63 s82 s95 s108)), p1:(GT (ADD s3 s8 s15 s31 s39 s52 s53 s57 s64 s91 s92 s98 s99 s113 s114 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 48 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-04 finished in 480 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 16 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 8 ms. Remains 117 /117 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:53] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:53] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:53] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:53] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:53] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-16 03:05:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT 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:(LEQ 2 (ADD s3 s8 s15 s31 s39 s52 s53 s57 s64 s91 s92 s98 s99 s113 s114 s116))], 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 186 ms.
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 43 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-PT-04-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-PT-04-LTLCardinality-06 finished in 806 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 16 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.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:54] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:54] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:54] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:54] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:54] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:54] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:54] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(LEQ 3 (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50 s54 s55 s63 s82 s95 s108))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 443 steps with 8 reset in 6 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-07 finished in 425 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(F((G(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 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 100 place count 32 transition count 106
Iterating global reduction 0 with 55 rules applied. Total rules applied 155 place count 32 transition count 106
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 166 place count 21 transition count 51
Iterating global reduction 0 with 11 rules applied. Total rules applied 177 place count 21 transition count 51
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 188 place count 21 transition count 40
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 196 place count 17 transition count 36
Applied a total of 196 rules in 34 ms. Remains 17 /117 variables (removed 100) and now considering 36/176 (removed 140) transitions.
[2022-05-16 03:05:54] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
// Phase 1: matrix 25 rows 17 cols
[2022-05-16 03:05:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 03:05:54] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-16 03:05:54] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
// Phase 1: matrix 25 rows 17 cols
[2022-05-16 03:05:54] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 03:05:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 03:05:54] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2022-05-16 03:05:54] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 03:05:54] [INFO ] Flow matrix only has 25 transitions (discarded 11 similar events)
// Phase 1: matrix 25 rows 17 cols
[2022-05-16 03:05:54] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 03:05:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/117 places, 36/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/117 places, 36/176 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s14), p1:(GT s8 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4402 reset in 170 ms.
Stack based approach found an accepted trace after 513 steps with 24 reset with depth 21 and stack size 21 in 1 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-08 finished in 353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 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.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:55] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:55] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:55] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:55] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:55] [INFO ] Computed 20 place invariants in 6 ms
[2022-05-16 03:05:55] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s99 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-09 finished in 399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 1 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
[2022-05-16 03:05:55] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:55] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:55] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:55] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:55] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:55] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s13)], 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 180 steps with 34 reset in 2 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-12 finished in 342 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--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 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 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 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 107 place count 26 transition count 101
Iterating global reduction 0 with 59 rules applied. Total rules applied 166 place count 26 transition count 101
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 177 place count 15 transition count 46
Iterating global reduction 0 with 11 rules applied. Total rules applied 188 place count 15 transition count 46
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 199 place count 15 transition count 35
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 11 rules applied. Total rules applied 210 place count 8 transition count 31
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 220 place count 8 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 222 place count 6 transition count 15
Iterating global reduction 2 with 2 rules applied. Total rules applied 224 place count 6 transition count 15
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 226 place count 6 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 6 transition count 11
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 229 place count 5 transition count 9
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 231 place count 5 transition count 8
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 232 place count 5 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 5 transition count 7
Applied a total of 233 rules in 16 ms. Remains 5 /117 variables (removed 112) and now considering 7/176 (removed 169) transitions.
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 03:05:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 03:05:55] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 03:05:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 03:05:55] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-16 03:05:55] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 7 rows 5 cols
[2022-05-16 03:05:55] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 03:05:56] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/117 places, 7/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/117 places, 7/176 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p0)]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 99 steps with 3 reset in 0 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-14 finished in 374 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||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 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 196 place count 17 transition count 36
Applied a total of 196 rules in 16 ms. Remains 17 /117 variables (removed 100) and now considering 36/176 (removed 140) transitions.
[2022-05-16 03:05:56] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
// Phase 1: matrix 28 rows 17 cols
[2022-05-16 03:05:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 03:05:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2022-05-16 03:05:56] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
// Phase 1: matrix 28 rows 17 cols
[2022-05-16 03:05:56] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-16 03:05:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 03:05:56] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-16 03:05:56] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-16 03:05:56] [INFO ] Flow matrix only has 28 transitions (discarded 8 similar events)
// Phase 1: matrix 28 rows 17 cols
[2022-05-16 03:05:56] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-16 03:05:56] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/117 places, 36/176 transitions.
Finished structural reductions, in 1 iterations. Remains : 17/117 places, 36/176 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-15 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:(LEQ s3 s10), p1:(GT 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 7554 reset in 138 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA CSRepetitions-PT-04-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-PT-04-LTLCardinality-15 finished in 327 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G((X(p0)||p1)))||X(p1))))'
Found a SL insensitive property : CSRepetitions-PT-04-LTLCardinality-03
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 21 out of 117 places. Attempting structural reductions.
Starting structural reductions in SLCL_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.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:56] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:05:56] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:56] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:56] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:56] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:56] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Running random walk in product with property : CSRepetitions-PT-04-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (ADD s2 s9 s25 s97)), p0:(LEQ s115 (ADD s5 s11 s13 s18 s28 s34 s42 s45 s48 s50 s54 s55 s63 s82 s95 s108))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 4992 reset in 294 ms.
Product exploration explored 100000 steps with 4973 reset in 304 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 369 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 1097 steps, including 28 resets, run visited all 3 properties in 9 ms. (steps per millisecond=121 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 279 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 21 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.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:58] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:58] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:58] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:05:58] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:58] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:58] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 03:05:58] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 227 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:05:59] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-16 03:05:59] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 03:05:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2022-05-16 03:05:59] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 03:05:59] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:05:59] [INFO ] After 24ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 03:05:59] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2022-05-16 03:05:59] [INFO ] After 165ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 111 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X (X p1)), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F p0)]
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 5000 reset in 312 ms.
Product exploration explored 100000 steps with 5013 reset in 324 ms.
Built C files in :
/tmp/ltsmin11246004342964738888
[2022-05-16 03:06:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11246004342964738888
Running compilation step : cd /tmp/ltsmin11246004342964738888;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 287 ms.
Running link step : cd /tmp/ltsmin11246004342964738888;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11246004342964738888;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7383309159071895307.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 21 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
[2022-05-16 03:06:15] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-16 03:06:15] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:06:15] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:06:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2022-05-16 03:06:15] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
// Phase 1: matrix 176 rows 117 cols
[2022-05-16 03:06:15] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-16 03:06:15] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 117/117 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin2393611621204136809
[2022-05-16 03:06:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2393611621204136809
Running compilation step : cd /tmp/ltsmin2393611621204136809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 269 ms.
Running link step : cd /tmp/ltsmin2393611621204136809;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2393611621204136809;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8729699219261439121.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 03:06:31] [INFO ] Flatten gal took : 12 ms
[2022-05-16 03:06:31] [INFO ] Flatten gal took : 10 ms
[2022-05-16 03:06:31] [INFO ] Time to serialize gal into /tmp/LTL3322464976923776865.gal : 5 ms
[2022-05-16 03:06:31] [INFO ] Time to serialize properties into /tmp/LTL14432892034583836226.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3322464976923776865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14432892034583836226.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3322464...267
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(RequestBufferSlots<=((((Client_Sending_8+Client_Sending_2)+(Client_Sending_9+Client_Sending_16))+((Client_Sending_10+Cl...545
Formula 0 simplified : !G(FG("(((Server_Waiting_4+Server_Waiting_2)+(Server_Waiting_1+Server_Waiting_3))>=3)" | X"(RequestBufferSlots<=((((Client_Sending_8...531
Detected timeout of ITS tools.
[2022-05-16 03:06:46] [INFO ] Flatten gal took : 10 ms
[2022-05-16 03:06:46] [INFO ] Applying decomposition
[2022-05-16 03:06:46] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2875524236617207392.txt' '-o' '/tmp/graph2875524236617207392.bin' '-w' '/tmp/graph2875524236617207392.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2875524236617207392.bin' '-l' '-1' '-v' '-w' '/tmp/graph2875524236617207392.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:06:46] [INFO ] Decomposing Gal with order
[2022-05-16 03:06:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:06:46] [INFO ] Removed a total of 111 redundant transitions.
[2022-05-16 03:06:46] [INFO ] Flatten gal took : 50 ms
[2022-05-16 03:06:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 240 labels/synchronizations in 8 ms.
[2022-05-16 03:06:46] [INFO ] Time to serialize gal into /tmp/LTL17955387027555799742.gal : 2 ms
[2022-05-16 03:06:46] [INFO ] Time to serialize properties into /tmp/LTL7025350424266436218.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17955387027555799742.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7025350424266436218.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1795538...267
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(gu1.RequestBufferSlots<=((((gu1.Client_Sending_8+gu1.Client_Sending_2)+(gu1.Client_Sending_9+gu1.Client_Sending_16))+((...677
Formula 0 simplified : !G(FG("(((gi1.gu0.Server_Waiting_4+gi1.gu0.Server_Waiting_2)+(gi1.gu0.Server_Waiting_1+gi1.gu0.Server_Waiting_3))>=3)" | X"(gu1.Requ...663
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6109643311998523232
[2022-05-16 03:07:01] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6109643311998523232
Running compilation step : cd /tmp/ltsmin6109643311998523232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin6109643311998523232;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 24 ms.
Running LTSmin : cd /tmp/ltsmin6109643311998523232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-PT-04-LTLCardinality-03 finished in 79812 ms.
[2022-05-16 03:07:16] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin1705523009517100683
[2022-05-16 03:07:16] [INFO ] Applying decomposition
[2022-05-16 03:07:16] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2022-05-16 03:07:16] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:07:16] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2022-05-16 03:07:16] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:07:16] [INFO ] Flatten gal took : 8 ms
[2022-05-16 03:07:16] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10766386660618109784.txt' '-o' '/tmp/graph10766386660618109784.bin' '-w' '/tmp/graph10766386660618109784.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10766386660618109784.bin' '-l' '-1' '-v' '-w' '/tmp/graph10766386660618109784.weights' '-q' '0' '-e' '0.001'
[2022-05-16 03:07:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 03:07:16] [INFO ] Decomposing Gal with order
[2022-05-16 03:07:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 03:07:16] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1705523009517100683
Running compilation step : cd /tmp/ltsmin1705523009517100683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-16 03:07:16] [INFO ] Removed a total of 111 redundant transitions.
[2022-05-16 03:07:16] [INFO ] Flatten gal took : 47 ms
[2022-05-16 03:07:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 128 labels/synchronizations in 4 ms.
[2022-05-16 03:07:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality7035364213894256051.gal : 2 ms
[2022-05-16 03:07:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality4554222550612174581.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality7035364213894256051.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4554222550612174581.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((G((F(G((X("(gu0.RequestBufferSlots<=((((gu0.Client_Sending_8+gu0.Client_Sending_2)+(gu0.Client_Sending_9+gu0.Client_Sending_16))+((...645
Formula 0 simplified : !G(FG("(((gu1.Server_Waiting_4+gu1.Server_Waiting_2)+(gu1.Server_Waiting_1+gu1.Server_Waiting_3))>=3)" | X"(gu0.RequestBufferSlots<=...631
Compilation finished in 364 ms.
Running link step : cd /tmp/ltsmin1705523009517100683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1705523009517100683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.244: LTL layer: formula: []((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))
pins2lts-mc-linux64( 4/ 8), 0.244: "[]((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.244: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.244: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.247: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.249: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.265: There are 179 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.265: State length is 118, there are 180 groups
pins2lts-mc-linux64( 0/ 8), 0.265: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.265: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.265: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.265: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.318: [Blue] ~69 levels ~960 states ~12200 transitions
pins2lts-mc-linux64( 4/ 8), 0.323: [Blue] ~69 levels ~1920 states ~15816 transitions
pins2lts-mc-linux64( 4/ 8), 0.335: [Blue] ~69 levels ~3840 states ~24712 transitions
pins2lts-mc-linux64( 4/ 8), 0.352: [Blue] ~69 levels ~7680 states ~43840 transitions
pins2lts-mc-linux64( 4/ 8), 0.391: [Blue] ~69 levels ~15360 states ~76424 transitions
pins2lts-mc-linux64( 4/ 8), 0.494: [Blue] ~75 levels ~30720 states ~152184 transitions
pins2lts-mc-linux64( 4/ 8), 0.752: [Blue] ~75 levels ~61440 states ~278184 transitions
pins2lts-mc-linux64( 4/ 8), 1.377: [Blue] ~218 levels ~122880 states ~603048 transitions
pins2lts-mc-linux64( 4/ 8), 2.744: [Blue] ~7444 levels ~245760 states ~1824400 transitions
pins2lts-mc-linux64( 4/ 8), 4.106: [Blue] ~20992 levels ~491520 states ~4270656 transitions
pins2lts-mc-linux64( 4/ 8), 6.567: [Blue] ~46284 levels ~983040 states ~9091200 transitions
pins2lts-mc-linux64( 5/ 8), 11.743: [Blue] ~89662 levels ~1966080 states ~18135760 transitions
pins2lts-mc-linux64( 1/ 8), 22.241: [Blue] ~175891 levels ~3932160 states ~36316920 transitions
pins2lts-mc-linux64( 1/ 8), 42.888: [Blue] ~335246 levels ~7864320 states ~72187544 transitions
pins2lts-mc-linux64( 1/ 8), 84.527: [Blue] ~663979 levels ~15728640 states ~146374960 transitions
pins2lts-mc-linux64( 1/ 8), 167.940: [Blue] ~1248499 levels ~31457280 states ~289151648 transitions
pins2lts-mc-linux64( 5/ 8), 192.753: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 192.892:
pins2lts-mc-linux64( 0/ 8), 192.897: Explored 33990477 states 324328218 transitions, fanout: 9.542
pins2lts-mc-linux64( 0/ 8), 192.897: Total exploration time 192.610 sec (192.470 sec minimum, 192.546 sec on average)
pins2lts-mc-linux64( 0/ 8), 192.897: States per second: 176473, Transitions per second: 1683860
pins2lts-mc-linux64( 0/ 8), 192.898:
pins2lts-mc-linux64( 0/ 8), 192.898: State space has 134217262 states, 16471628 are accepting
pins2lts-mc-linux64( 0/ 8), 192.898: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 192.898: blue states: 33990477 (25.32%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 192.898: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 192.898: all-red states: 16471628 (12.27%), bogus 1 (0.00%)
pins2lts-mc-linux64( 0/ 8), 192.898:
pins2lts-mc-linux64( 0/ 8), 192.898: Total memory used for local state coloring: 177.5MB
pins2lts-mc-linux64( 0/ 8), 192.898:
pins2lts-mc-linux64( 0/ 8), 192.900: Queue width: 8B, total height: 11632333, memory: 88.75MB
pins2lts-mc-linux64( 0/ 8), 192.900: Tree memory: 1113.7MB, 8.7 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 192.900: Tree fill ratio (roots/leafs): 99.0%/35.0%
pins2lts-mc-linux64( 0/ 8), 192.900: Stored 180 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 192.900: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 192.900: Est. total memory use: 1202.5MB (~1112.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1705523009517100683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin1705523009517100683;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>([]((X((LTLAPp0==true))||(LTLAPp1==true))))||X((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Reverse transition relation is NOT exact ! Due to transitions gu1.t11, gu1.t13, gu1.t21, gu1.t22, gu1.t42, gu1.t44, gu1.t55, gu1.t68, gu1.t85, gu1.t90, gu1...483
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
3 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
21624 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,216.266,2206776,1,0,192,1.23006e+07,24,72,14983,1.19156e+07,32
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-PT-04-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 506363 ms.
BK_STOP 1652670775428
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CSRepetitions-PT-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CSRepetitions-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918800635"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;