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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 9.9K Apr 30 05:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 30 05:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 05:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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 4.5K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 15K 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-COL-05-LTLCardinality-00
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-01
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-02
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-03
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-04
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-05
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-06
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-07
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-08
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-09
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-10
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-11
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-12
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-13
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-14
FORMULA_NAME CSRepetitions-COL-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652664811757

Running Version 202205111006
[2022-05-16 01:33:32] [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 01:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 01:33:32] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 01:33:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 01:33:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 509 ms
[2022-05-16 01:33:33] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 206 PT places and 325.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA CSRepetitions-COL-05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 01:33:33] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 8 ms.
[2022-05-16 01:33:33] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 77 steps, including 1 resets, run visited all 16 properties in 11 ms. (steps per millisecond=7 )
[2022-05-16 01:33:33] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-16 01:33:33] [INFO ] Flatten gal took : 14 ms
FORMULA CSRepetitions-COL-05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 01:33:33] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 5
[2022-05-16 01:33:33] [INFO ] Unfolded HLPN to a Petri net with 102 places and 125 transitions 375 arcs in 9 ms.
[2022-05-16 01:33:33] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 77 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 13 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:33] [INFO ] Computed 26 place invariants in 14 ms
[2022-05-16 01:33:33] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:33] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:33:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:34] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:34] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:33:34] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Support contains 77 out of 102 places after structural reductions.
[2022-05-16 01:33:34] [INFO ] Flatten gal took : 16 ms
[2022-05-16 01:33:34] [INFO ] Flatten gal took : 13 ms
[2022-05-16 01:33:34] [INFO ] Input system was already deterministic with 125 transitions.
Finished random walk after 618 steps, including 12 resets, run visited all 15 properties in 31 ms. (steps per millisecond=19 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:34] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:34] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:34] [INFO ] Computed 26 place invariants in 4 ms
[2022-05-16 01:33:34] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:34] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:34] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:34] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-01 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 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25) (ADD s77 s78 s79 s80 s81 s82 s83 s84 s85 s86 s87 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1796 reset in 443 ms.
Product exploration explored 100000 steps with 1800 reset in 431 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 13 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 270 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:36] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:36] [INFO ] [Real]Absence check using 26 positive place invariants in 6 ms returned sat
[2022-05-16 01:33:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:33:36] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2022-05-16 01:33:36] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:33:37] [INFO ] [Nat]Absence check using 26 positive place invariants in 6 ms returned sat
[2022-05-16 01:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:33:37] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2022-05-16 01:33:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:37] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-05-16 01:33:37] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-16 01:33:37] [INFO ] Added : 4 causal constraints over 1 iterations in 31 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:37] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:37] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:37] [INFO ] Computed 26 place invariants in 15 ms
[2022-05-16 01:33:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:37] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:37] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:33:37] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F p1)]
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:38] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:38] [INFO ] [Real]Absence check using 26 positive place invariants in 4 ms returned sat
[2022-05-16 01:33:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 01:33:38] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2022-05-16 01:33:38] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 01:33:38] [INFO ] [Nat]Absence check using 26 positive place invariants in 5 ms returned sat
[2022-05-16 01:33:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 01:33:38] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2022-05-16 01:33:38] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:38] [INFO ] [Nat]Added 25 Read/Feed constraints in 3 ms returned sat
[2022-05-16 01:33:38] [INFO ] Computed and/alt/rep : 100/125/100 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 01:33:38] [INFO ] Added : 4 causal constraints over 1 iterations in 42 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1806 reset in 357 ms.
Product exploration explored 100000 steps with 1796 reset in 376 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 51 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 22 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
[2022-05-16 01:33:39] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:39] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:33:39] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Product exploration explored 100000 steps with 1792 reset in 401 ms.
Product exploration explored 100000 steps with 1799 reset in 388 ms.
Built C files in :
/tmp/ltsmin13591470332538955657
[2022-05-16 01:33:40] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13591470332538955657
Running compilation step : cd /tmp/ltsmin13591470332538955657;'/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 394 ms.
Running link step : cd /tmp/ltsmin13591470332538955657;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13591470332538955657;'/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/stateBased3580940526685989785.hoa' '--buchi-type=spotba'
LTSmin run took 448 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CSRepetitions-COL-05-LTLCardinality-01 finished in 6871 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||(p1 U !X(p2))))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 4 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:41] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:41] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:41] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:33:41] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:41] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:41] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:33:41] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (AND (NOT p0) p2), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), p2, p2]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 6}], [{ cond=(AND p1 p2), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 0}]], initial=1, aps=[p1:(GT 2 (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76)), p0:(LEQ 3 s0), p2:(LEQ (ADD s52 s53 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 272 ms.
Product exploration explored 100000 steps with 50000 reset in 285 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 p2 p0))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X p0)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 p2 p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p2 p0)))
Knowledge based reduction with 18 factoid took 330 ms. Reduced automaton from 7 states, 14 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-05-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLCardinality-02 finished in 1364 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:42] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:33:42] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:42] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:33:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:42] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:42] [INFO ] Computed 26 place invariants in 9 ms
[2022-05-16 01:33:42] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-04 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 3 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25))], 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 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-04 finished in 337 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!F((X(p0)||G(p1)))) U !(G(p1)||p1)))'
Support contains 50 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:43] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:43] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:43] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:43] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-16 01:33:43] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:43] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 01:33:43] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 126 ms :[p1, (OR p0 p1), p1]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76)), p0:(GT 3 (ADD s1 s2 s3 s4 s5 s6 s7 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2176 reset in 332 ms.
Stack based approach found an accepted trace after 9098 steps with 197 reset with depth 13 and stack size 13 in 32 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-05 finished in 710 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((F(p0)&&p1)))||(X(p2) U G(p1))))'
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:43] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:33:43] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:43] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:33:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:43] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:43] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:33:44] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 450 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(NOT p2), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 8}, { cond=(AND p1 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(LEQ s0 s51), p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)), p2:(GT s0 (ADD s52 s53 s54 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24766 reset in 252 ms.
Product exploration explored 100000 steps with 24874 reset in 282 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) (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1119 ms. Reduced automaton from 11 states, 26 edges and 3 AP to 9 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1))]
Incomplete random walk after 10000 steps, including 200 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 13) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:46] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:46] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:33:46] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2022-05-16 01:33:47] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND p2 (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (NOT (AND (NOT p2) p1))), (F (AND p2 p1)), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 22 factoid took 1351 ms. Reduced automaton from 9 states, 24 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 2 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:48] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:48] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:48] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:33:48] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:33:49] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:49] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:33:49] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (OR (AND p0 p2) p1)), (X (OR p0 (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND p0 p2) p1))), (X (X (OR p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1126 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 224 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Incomplete random walk after 10000 steps, including 206 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:33:50] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:33:50] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:33:50] [INFO ] [Nat]Absence check using 26 positive place invariants in 2 ms returned sat
[2022-05-16 01:33:50] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (OR (AND p0 p2) p1)), (X (OR p0 (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND p0 p2) p1))), (X (X (OR p0 (NOT p2)))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (AND p0 p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 22 factoid took 1339 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 277 ms :[(NOT p1), (AND (NOT p0) p1), (NOT p1), (NOT p0), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (AND (NOT p0) p1), (NOT p1), (NOT p0), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 226 ms :[(NOT p1), (AND (NOT p0) p1), (NOT p1), (NOT p0), (AND (NOT p0) p1), false]
Product exploration explored 100000 steps with 33301 reset in 295 ms.
Product exploration explored 100000 steps with 33161 reset in 301 ms.
Built C files in :
/tmp/ltsmin5856065674813072874
[2022-05-16 01:33:53] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:33:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:33:53] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:33:53] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:33:53] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:33:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:33:53] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5856065674813072874
Running compilation step : cd /tmp/ltsmin5856065674813072874;'/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 240 ms.
Running link step : cd /tmp/ltsmin5856065674813072874;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin5856065674813072874;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased18274939110915825737.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 9 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:34:08] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:34:08] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:34:08] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:34:08] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:34:08] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-16 01:34:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:34:08] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:34:08] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin10278023750884185359
[2022-05-16 01:34:08] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:34:08] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:34:08] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:34:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:34:08] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:34:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:34:08] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10278023750884185359
Running compilation step : cd /tmp/ltsmin10278023750884185359;'/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 246 ms.
Running link step : cd /tmp/ltsmin10278023750884185359;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10278023750884185359;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10730782896271179348.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:34:23] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:34:23] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:34:23] [INFO ] Time to serialize gal into /tmp/LTL12103416278391696491.gal : 4 ms
[2022-05-16 01:34:23] [INFO ] Time to serialize properties into /tmp/LTL16614556296256728876.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/LTL12103416278391696491.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16614556296256728876.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/LTL1210341...268
Read 1 LTL properties
Checking formula 0 : !(((G(F((F("(RequestBufferSlots_0<=(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Cli...1167
Formula 0 simplified : !(GF("(RequestBufferSlots_0<=Server_Waiting_0)" & F"(RequestBufferSlots_0<=(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2...1153
Detected timeout of ITS tools.
[2022-05-16 01:34:39] [INFO ] Flatten gal took : 7 ms
[2022-05-16 01:34:39] [INFO ] Applying decomposition
[2022-05-16 01:34:39] [INFO ] Flatten gal took : 7 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/graph13304201111991448340.txt' '-o' '/tmp/graph13304201111991448340.bin' '-w' '/tmp/graph13304201111991448340.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13304201111991448340.bin' '-l' '-1' '-v' '-w' '/tmp/graph13304201111991448340.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:34:39] [INFO ] Decomposing Gal with order
[2022-05-16 01:34:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:34:39] [INFO ] Flatten gal took : 47 ms
[2022-05-16 01:34:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2022-05-16 01:34:39] [INFO ] Time to serialize gal into /tmp/LTL12721628357839368091.gal : 2 ms
[2022-05-16 01:34:39] [INFO ] Time to serialize properties into /tmp/LTL13395153682556591144.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/LTL12721628357839368091.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13395153682556591144.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/LTL1272162...268
Read 1 LTL properties
Checking formula 0 : !(((G(F((F("(gu0.RequestBufferSlots_0<=(((((gu1.Client_Sending_0+gu1.Client_Sending_1)+(gu1.Client_Sending_2+gu1.Client_Sending_3))+((...1391
Formula 0 simplified : !(GF("(gu0.RequestBufferSlots_0<=gu0.Server_Waiting_0)" & F"(gu0.RequestBufferSlots_0<=(((((gu1.Client_Sending_0+gu1.Client_Sending_...1377
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10503095149992133167
[2022-05-16 01:34:54] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10503095149992133167
Running compilation step : cd /tmp/ltsmin10503095149992133167;'/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 211 ms.
Running link step : cd /tmp/ltsmin10503095149992133167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10503095149992133167;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((<>((LTLAPp0==true))&&(LTLAPp1==true))))||(X((LTLAPp2==true)) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-05-LTLCardinality-06 finished in 85519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(p0))) U X(F(p0))))'
Support contains 2 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:09] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:09] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:09] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:35:09] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:09] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:09] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:09] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s51 s0)], 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]]
Product exploration explored 100000 steps with 50000 reset in 202 ms.
Product exploration explored 100000 steps with 50000 reset in 206 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-05-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLCardinality-08 finished in 826 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 25 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:10] [INFO ] Computed 26 place invariants in 2 ms
[2022-05-16 01:35:10] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:10] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:10] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:10] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:10] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:35:10] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-09 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 3 (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76))], 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 203 ms.
Product exploration explored 100000 steps with 33333 reset in 224 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 57 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-05-LTLCardinality-09 finished in 816 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 6 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:10] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:11] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GT 1 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)) (GT s51 s0))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-10 finished in 275 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((G(X(p0))&&X(p1)))))))'
Support contains 76 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 01:35:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:11] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2022-05-16 01:35:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 32 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s51 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)), p1:(GT (ADD s77 s78 s79 s80 s81 s82 s83 s84...], 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 59 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-11 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(X(p0)))||(p0 U G(p1))))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 11 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:11] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2022-05-16 01:35:11] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:11] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:11] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)), p1:(GT 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1801 reset in 323 ms.
Stack based approach found an accepted trace after 51613 steps with 937 reset with depth 6 and stack size 6 in 174 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-12 finished in 816 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U G(F(X(F(p0))))))))'
Support contains 26 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:12] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:35:12] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:12] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:12] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:12] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2022-05-16 01:35:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:12] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:35:12] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76) s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1941 reset in 294 ms.
Stack based approach found an accepted trace after 4936 steps with 97 reset with depth 29 and stack size 29 in 16 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-13 finished in 600 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)&&G(p1)))))'
Support contains 27 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 0 with 75 rules applied. Total rules applied 75 place count 52 transition count 100
Applied a total of 75 rules in 15 ms. Remains 52 /102 variables (removed 50) and now considering 100/125 (removed 25) transitions.
// Phase 1: matrix 100 rows 52 cols
[2022-05-16 01:35:12] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-16 01:35:12] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 100 rows 52 cols
[2022-05-16 01:35:12] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 01:35:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2022-05-16 01:35:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 100 rows 52 cols
[2022-05-16 01:35:13] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 01:35:13] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/102 places, 100/125 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/102 places, 100/125 transitions.
Stuttering acceptance computed with spot in 40 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s0), p1:(LEQ s26 (ADD s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51))], 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 19 steps with 0 reset in 1 ms.
FORMULA CSRepetitions-COL-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-05-LTLCardinality-14 finished in 188 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((F(p0)&&p1)))||(X(p2) U G(p1))))'
Found a SL insensitive property : CSRepetitions-COL-05-LTLCardinality-06
Stuttering acceptance computed with spot in 424 ms :[(NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 8 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:13] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:13] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:13] [INFO ] Computed 26 place invariants in 6 ms
[2022-05-16 01:35:13] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:13] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:13] [INFO ] Computed 26 place invariants in 3 ms
[2022-05-16 01:35:13] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Running random walk in product with property : CSRepetitions-COL-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 7}, { cond=(NOT p2), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 8}, { cond=(AND p1 p2), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(LEQ s0 s51), p0:(LEQ s0 (ADD s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25)), p2:(GT s0 (ADD s52 s53 s54 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24803 reset in 257 ms.
Product exploration explored 100000 steps with 24797 reset in 249 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) (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1008 ms. Reduced automaton from 11 states, 26 edges and 3 AP to 9 states, 24 edges and 3 AP.
Stuttering acceptance computed with spot in 361 ms :[(NOT p1), (AND (NOT p0) (NOT p2) p1), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1))]
Incomplete random walk after 10004 steps, including 206 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:15] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:15] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 01:35:15] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2022-05-16 01:35:16] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (AND p1 (NOT p0))), (X (AND p1 (NOT p2))), (X p1), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p2)))), true, (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND p2 (NOT p0) (NOT p1)))), (G (NOT (AND p2 (NOT p0) p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0) p1))), (F (AND p2 p1)), (F (NOT (AND (NOT p2) p1))), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 22 factoid took 1352 ms. Reduced automaton from 9 states, 24 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:17] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:17] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:17] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:17] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:17] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:17] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:35:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (OR (AND p0 p2) p1)), (X (OR p0 (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND p0 p2) p1))), (X (X (OR p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 1011 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) p1), false]
Incomplete random walk after 10000 steps, including 200 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:19] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:19] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 01:35:19] [INFO ] [Nat]Absence check using 26 positive place invariants in 2 ms returned sat
[2022-05-16 01:35:19] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (AND p1 (NOT p2))), (X p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (OR (AND p0 p2) p1)), (X (OR p0 (NOT p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (OR (AND p0 p2) p1))), (X (X (OR p0 (NOT p2)))), (G (OR p0 (NOT p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (AND p1 (NOT p2)))), (F (NOT p1)), (F (AND (NOT p1) p2)), (F (NOT (OR p1 (AND p0 p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p1 p2))]
Knowledge based reduction with 22 factoid took 1356 ms. Reduced automaton from 6 states, 14 edges and 3 AP to 6 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 298 ms :[(NOT p1), (AND (NOT p0) p1), (NOT p1), (NOT p0), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (AND (NOT p0) p1), (NOT p1), (NOT p0), (AND (NOT p0) p1), false]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (AND (NOT p0) p1), (NOT p1), (NOT p0), (AND (NOT p0) p1), false]
Product exploration explored 100000 steps with 33278 reset in 271 ms.
Product exploration explored 100000 steps with 33316 reset in 288 ms.
Built C files in :
/tmp/ltsmin5011040360573900179
[2022-05-16 01:35:22] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:35:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:35:22] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:35:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:35:22] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:35:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:35:22] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5011040360573900179
Running compilation step : cd /tmp/ltsmin5011040360573900179;'/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 232 ms.
Running link step : cd /tmp/ltsmin5011040360573900179;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin5011040360573900179;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8929450758705723561.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 52 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 125/125 transitions.
Applied a total of 0 rules in 14 ms. Remains 102 /102 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:37] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:35:37] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:37] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-16 01:35:37] [INFO ] State equation strengthened by 25 read => feed constraints.
[2022-05-16 01:35:37] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-05-16 01:35:37] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 125 rows 102 cols
[2022-05-16 01:35:37] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-16 01:35:37] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 102/102 places, 125/125 transitions.
Built C files in :
/tmp/ltsmin12758744314735611716
[2022-05-16 01:35:37] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:35:37] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:35:37] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:35:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:35:37] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:35:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:35:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12758744314735611716
Running compilation step : cd /tmp/ltsmin12758744314735611716;'/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 223 ms.
Running link step : cd /tmp/ltsmin12758744314735611716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12758744314735611716;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14782204955242099344.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 01:35:52] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:35:52] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:35:52] [INFO ] Time to serialize gal into /tmp/LTL2096217077295732622.gal : 1 ms
[2022-05-16 01:35:52] [INFO ] Time to serialize properties into /tmp/LTL10453882704285243776.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/LTL2096217077295732622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10453882704285243776.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/LTL2096217...267
Read 1 LTL properties
Checking formula 0 : !(((G(F((F("(RequestBufferSlots_0<=(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2+Client_Sending_3))+((Client_Sending_4+Cli...1167
Formula 0 simplified : !(GF("(RequestBufferSlots_0<=Server_Waiting_0)" & F"(RequestBufferSlots_0<=(((((Client_Sending_0+Client_Sending_1)+(Client_Sending_2...1153
Detected timeout of ITS tools.
[2022-05-16 01:36:07] [INFO ] Flatten gal took : 8 ms
[2022-05-16 01:36:07] [INFO ] Applying decomposition
[2022-05-16 01:36:07] [INFO ] Flatten gal took : 7 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/graph10653111855395944426.txt' '-o' '/tmp/graph10653111855395944426.bin' '-w' '/tmp/graph10653111855395944426.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10653111855395944426.bin' '-l' '-1' '-v' '-w' '/tmp/graph10653111855395944426.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:36:07] [INFO ] Decomposing Gal with order
[2022-05-16 01:36:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:36:07] [INFO ] Flatten gal took : 35 ms
[2022-05-16 01:36:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:36:07] [INFO ] Time to serialize gal into /tmp/LTL12096666853210039639.gal : 2 ms
[2022-05-16 01:36:07] [INFO ] Time to serialize properties into /tmp/LTL6447498415947351392.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/LTL12096666853210039639.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6447498415947351392.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/LTL1209666...267
Read 1 LTL properties
Checking formula 0 : !(((G(F((F("(gu1.RequestBufferSlots_0<=(((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Sending_2+gu0.Client_Sending_3))+((...1391
Formula 0 simplified : !(GF("(gu1.RequestBufferSlots_0<=gu1.Server_Waiting_0)" & F"(gu1.RequestBufferSlots_0<=(((((gu0.Client_Sending_0+gu0.Client_Sending_...1377
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3617512601448046876
[2022-05-16 01:36:22] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3617512601448046876
Running compilation step : cd /tmp/ltsmin3617512601448046876;'/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 201 ms.
Running link step : cd /tmp/ltsmin3617512601448046876;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3617512601448046876;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((<>((LTLAPp0==true))&&(LTLAPp1==true))))||(X((LTLAPp2==true)) U []((LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property CSRepetitions-COL-05-LTLCardinality-06 finished in 84849 ms.
[2022-05-16 01:36:37] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
[2022-05-16 01:36:37] [INFO ] Applying decomposition
Built C files in :
/tmp/ltsmin2493888801515055066
[2022-05-16 01:36:37] [INFO ] Computing symmetric may disable matrix : 125 transitions.
[2022-05-16 01:36:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:36:37] [INFO ] Computing symmetric may enable matrix : 125 transitions.
[2022-05-16 01:36:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:36:37] [INFO ] Computing Do-Not-Accords matrix : 125 transitions.
[2022-05-16 01:36:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 01:36:38] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2493888801515055066
Running compilation step : cd /tmp/ltsmin2493888801515055066;'/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 01:36:38] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph859638007019973140.txt' '-o' '/tmp/graph859638007019973140.bin' '-w' '/tmp/graph859638007019973140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph859638007019973140.bin' '-l' '-1' '-v' '-w' '/tmp/graph859638007019973140.weights' '-q' '0' '-e' '0.001'
[2022-05-16 01:36:38] [INFO ] Decomposing Gal with order
[2022-05-16 01:36:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:36:38] [INFO ] Flatten gal took : 57 ms
[2022-05-16 01:36:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:36:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality9651843285641107114.gal : 1 ms
[2022-05-16 01:36:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality6315049948683343617.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/LTLCardinality9651843285641107114.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6315049948683343617.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((F("(gu1.RequestBufferSlots_0<=(((((gu0.Client_Sending_0+gu0.Client_Sending_1)+(gu0.Client_Sending_2+gu0.Client_Sending_3))+((...1391
Formula 0 simplified : !(GF("(gu1.RequestBufferSlots_0<=gu1.Server_Waiting_0)" & F"(gu1.RequestBufferSlots_0<=(((((gu0.Client_Sending_0+gu0.Client_Sending_...1377
Compilation finished in 333 ms.
Running link step : cd /tmp/ltsmin2493888801515055066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2493888801515055066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((<>((LTLAPp0==true))&&(LTLAPp1==true))))||(X((LTLAPp2==true)) U []((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: LTL layer: formula: ([](<>((<>((LTLAPp0==true))&&(LTLAPp1==true))))||(X((LTLAPp2==true)) U []((LTLAPp1==true))))
pins2lts-mc-linux64( 3/ 8), 0.001: "([](<>((<>((LTLAPp0==true))&&(LTLAPp1==true))))||(X((LTLAPp2==true)) U []((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: completed 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( 6/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.007: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: There are 129 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.049: State length is 103, there are 153 groups
pins2lts-mc-linux64( 0/ 8), 0.049: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.049: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.049: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.049: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.143: [Blue] ~7 levels ~960 states ~3064 transitions
pins2lts-mc-linux64( 3/ 8), 0.211: [Blue] ~11 levels ~1920 states ~5552 transitions
pins2lts-mc-linux64( 3/ 8), 0.329: [Blue] ~22 levels ~3840 states ~10912 transitions
pins2lts-mc-linux64( 0/ 8), 0.542: [Blue] ~36 levels ~7680 states ~27848 transitions
pins2lts-mc-linux64( 0/ 8), 1.048: [Blue] ~53 levels ~15360 states ~65696 transitions
pins2lts-mc-linux64( 3/ 8), 1.692: [Blue] ~35 levels ~30720 states ~142928 transitions
pins2lts-mc-linux64( 3/ 8), 3.394: [Blue] ~35 levels ~61440 states ~324208 transitions
pins2lts-mc-linux64( 3/ 8), 4.816: [Blue] ~35 levels ~122880 states ~725512 transitions
pins2lts-mc-linux64( 3/ 8), 8.911: [Blue] ~35 levels ~245760 states ~1585504 transitions
pins2lts-mc-linux64( 3/ 8), 12.191: [Blue] ~35 levels ~491520 states ~3428432 transitions
pins2lts-mc-linux64( 3/ 8), 16.835: [Blue] ~35 levels ~983040 states ~7368544 transitions
pins2lts-mc-linux64( 3/ 8), 21.691: [Blue] ~35 levels ~1966080 states ~15731528 transitions
pins2lts-mc-linux64( 3/ 8), 32.592: [Blue] ~35 levels ~3932160 states ~33432904 transitions
pins2lts-mc-linux64( 3/ 8), 55.046: [Blue] ~35 levels ~7864320 states ~70807344 transitions
pins2lts-mc-linux64( 3/ 8), 99.992: [Blue] ~35 levels ~15728640 states ~149467280 transitions
pins2lts-mc-linux64( 1/ 8), 187.873: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 188.309:
pins2lts-mc-linux64( 0/ 8), 188.309: Explored 29096562 states 308528254 transitions, fanout: 10.604
pins2lts-mc-linux64( 0/ 8), 188.309: Total exploration time 188.210 sec (187.800 sec minimum, 188.004 sec on average)
pins2lts-mc-linux64( 0/ 8), 188.309: States per second: 154596, Transitions per second: 1639277
pins2lts-mc-linux64( 0/ 8), 188.309:
pins2lts-mc-linux64( 0/ 8), 188.309: State space has 126334722 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 188.309: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 188.309: blue states: 29096562 (23.03%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 188.309: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 188.309: all-red states: 2428862 (1.92%), bogus 17 (0.00%)
pins2lts-mc-linux64( 0/ 8), 188.309:
pins2lts-mc-linux64( 0/ 8), 188.309: Total memory used for local state coloring: 216.7MB
pins2lts-mc-linux64( 0/ 8), 188.309:
pins2lts-mc-linux64( 0/ 8), 188.309: Queue width: 8B, total height: 14199682, memory: 108.33MB
pins2lts-mc-linux64( 0/ 8), 188.309: Tree memory: 1219.9MB, 10.1 B/state, compr.: 2.4%
pins2lts-mc-linux64( 0/ 8), 188.309: Tree fill ratio (roots/leafs): 94.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 188.309: Stored 125 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 188.309: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 188.309: Est. total memory use: 1328.2MB (~1132.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2493888801515055066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((<>((LTLAPp0==true))&&(LTLAPp1==true))))||(X((LTLAPp2==true)) U []((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2493888801515055066;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](<>((<>((LTLAPp0==true))&&(LTLAPp1==true))))||(X((LTLAPp2==true)) U []((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)
Detected timeout of ITS tools.
[2022-05-16 01:57:39] [INFO ] Applying decomposition
[2022-05-16 01:57:39] [INFO ] Flatten gal took : 6 ms
[2022-05-16 01:57:39] [INFO ] Decomposing Gal with order
[2022-05-16 01:57:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 01:57:39] [INFO ] Removed a total of 96 redundant transitions.
[2022-05-16 01:57:39] [INFO ] Flatten gal took : 15 ms
[2022-05-16 01:57:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2022-05-16 01:57:39] [INFO ] Time to serialize gal into /tmp/LTLCardinality7178042493764802238.gal : 2 ms
[2022-05-16 01:57:39] [INFO ] Time to serialize properties into /tmp/LTLCardinality618552814023563351.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/LTLCardinality7178042493764802238.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality618552814023563351.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...287
Read 1 LTL properties
Checking formula 0 : !(((G(F((F("(gRequestBufferSlots.RequestBufferSlots_0<=(((((gClient0.Client_Sending_0+gClient1.Client_Sending_1)+(gClient2.Client_Send...1759
Formula 0 simplified : !(GF("(gRequestBufferSlots.RequestBufferSlots_0<=gServer_Waiting.Server_Waiting_0)" & F"(gRequestBufferSlots.RequestBufferSlots_0<=(...1745
Reverse transition relation is NOT exact ! Due to transitions gClient0.t50, gClient0.t75, gClient1.t51, gClient1.t76, gClient2.t52, gClient2.t77, gClient3....1041
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
10542 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,105.45,1686312,1,0,386,8.27329e+06,307,165,35401,1.10932e+07,376
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CSRepetitions-COL-05-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 1566998 ms.

BK_STOP 1652666379927

--------------------
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
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination 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-COL-05"
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-COL-05, 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-165251918700595"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CSRepetitions-COL-05.tgz
mv CSRepetitions-COL-05 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;