java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --rcfgbuilder.command.for.external.solver 'z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000' -tc ../../../trunk/examples/toolchains/AutomizerBplInlineTransformed.xml --icfgtransformation.transformationtype MAP_ELIMINATION_MONNIAUX --icfgtransformation.map.elimination.monniaux.number.of.cells 1 -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-7aa59a0 [2019-05-23 09:49:44,171 INFO L146 ILogger]: Resetting all preferences to default values... [2019-05-23 09:49:44,173 INFO L146 ILogger]: Resetting UltimateCore preferences to default values [2019-05-23 09:49:44,184 INFO L146 ILogger]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-05-23 09:49:44,185 INFO L146 ILogger]: Resetting Boogie Preprocessor preferences to default values [2019-05-23 09:49:44,186 INFO L146 ILogger]: Resetting Boogie Procedure Inliner preferences to default values [2019-05-23 09:49:44,187 INFO L146 ILogger]: Resetting Abstract Interpretation preferences to default values [2019-05-23 09:49:44,189 INFO L146 ILogger]: Resetting LassoRanker preferences to default values [2019-05-23 09:49:44,190 INFO L146 ILogger]: Resetting Reaching Definitions preferences to default values [2019-05-23 09:49:44,191 INFO L146 ILogger]: Resetting SyntaxChecker preferences to default values [2019-05-23 09:49:44,192 INFO L146 ILogger]: Büchi Program Product provides no preferences, ignoring... [2019-05-23 09:49:44,192 INFO L146 ILogger]: Resetting LTL2Aut preferences to default values [2019-05-23 09:49:44,193 INFO L146 ILogger]: Resetting PEA to Boogie preferences to default values [2019-05-23 09:49:44,194 INFO L146 ILogger]: Resetting BlockEncodingV2 preferences to default values [2019-05-23 09:49:44,195 INFO L146 ILogger]: Resetting ChcToBoogie preferences to default values [2019-05-23 09:49:44,196 INFO L146 ILogger]: Resetting AutomataScriptInterpreter preferences to default values [2019-05-23 09:49:44,197 INFO L146 ILogger]: Resetting BuchiAutomizer preferences to default values [2019-05-23 09:49:44,199 INFO L146 ILogger]: Resetting CACSL2BoogieTranslator preferences to default values [2019-05-23 09:49:44,201 INFO L146 ILogger]: Resetting CodeCheck preferences to default values [2019-05-23 09:49:44,202 INFO L146 ILogger]: Resetting InvariantSynthesis preferences to default values [2019-05-23 09:49:44,204 INFO L146 ILogger]: Resetting RCFGBuilder preferences to default values [2019-05-23 09:49:44,205 INFO L146 ILogger]: Resetting TraceAbstraction preferences to default values [2019-05-23 09:49:44,207 INFO L146 ILogger]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-05-23 09:49:44,208 INFO L146 ILogger]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-05-23 09:49:44,208 INFO L146 ILogger]: Resetting TreeAutomizer preferences to default values [2019-05-23 09:49:44,209 INFO L146 ILogger]: Resetting IcfgToChc preferences to default values [2019-05-23 09:49:44,209 INFO L146 ILogger]: Resetting IcfgTransformer preferences to default values [2019-05-23 09:49:44,210 INFO L146 ILogger]: ReqToTest provides no preferences, ignoring... [2019-05-23 09:49:44,210 INFO L146 ILogger]: Resetting Boogie Printer preferences to default values [2019-05-23 09:49:44,211 INFO L146 ILogger]: Resetting ChcSmtPrinter preferences to default values [2019-05-23 09:49:44,212 INFO L146 ILogger]: Resetting ReqPrinter preferences to default values [2019-05-23 09:49:44,213 INFO L146 ILogger]: Resetting Witness Printer preferences to default values [2019-05-23 09:49:44,214 INFO L146 ILogger]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-05-23 09:49:44,214 INFO L146 ILogger]: Resetting CDTParser preferences to default values [2019-05-23 09:49:44,215 INFO L146 ILogger]: AutomataScriptParser provides no preferences, ignoring... [2019-05-23 09:49:44,215 INFO L146 ILogger]: ReqParser provides no preferences, ignoring... [2019-05-23 09:49:44,215 INFO L146 ILogger]: Resetting SmtParser preferences to default values [2019-05-23 09:49:44,216 INFO L146 ILogger]: Resetting Witness Parser preferences to default values [2019-05-23 09:49:44,217 INFO L146 ILogger]: Finished resetting all preferences to default values... Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Command for external solver -> z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: TransformationType -> MAP_ELIMINATION_MONNIAUX Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: Map elimination Monniaux: number of cells -> 1 [2019-05-23 09:49:44,245 INFO L146 ILogger]: Repository-Root is: /tmp [2019-05-23 09:49:44,257 INFO L146 ILogger]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-05-23 09:49:44,260 INFO L146 ILogger]: [Toolchain 1]: Toolchain selected. [2019-05-23 09:49:44,262 INFO L146 ILogger]: Initializing Boogie PL CUP Parser... [2019-05-23 09:49:44,262 INFO L146 ILogger]: Boogie PL CUP Parser initialized [2019-05-23 09:49:44,263 INFO L146 ILogger]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl [2019-05-23 09:49:44,263 INFO L146 ILogger]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/CountTillBound-Jupiter.bpl' [2019-05-23 09:49:44,290 INFO L146 ILogger]: ####################### [Toolchain 1] ####################### [2019-05-23 09:49:44,291 INFO L146 ILogger]: Walking toolchain with 5 elements. [2019-05-23 09:49:44,292 INFO L146 ILogger]: ------------------------Boogie Procedure Inliner---------------------------- [2019-05-23 09:49:44,292 INFO L146 ILogger]: Initializing Boogie Procedure Inliner... [2019-05-23 09:49:44,292 INFO L146 ILogger]: Boogie Procedure Inliner initialized [2019-05-23 09:49:44,308 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,316 INFO L146 ILogger]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,321 WARN L146 ILogger]: Program contained no entry procedure! [2019-05-23 09:49:44,322 WARN L146 ILogger]: Missing entry procedures: [ULTIMATE.start] [2019-05-23 09:49:44,322 WARN L146 ILogger]: Fallback enabled. All procedures will be processed. [2019-05-23 09:49:44,324 INFO L146 ILogger]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-05-23 09:49:44,324 INFO L146 ILogger]: ------------------------Boogie Preprocessor---------------------------- [2019-05-23 09:49:44,325 INFO L146 ILogger]: Initializing Boogie Preprocessor... [2019-05-23 09:49:44,325 INFO L146 ILogger]: Boogie Preprocessor initialized [2019-05-23 09:49:44,335 INFO L146 ILogger]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,335 INFO L146 ILogger]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,336 INFO L146 ILogger]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,336 INFO L146 ILogger]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,338 INFO L146 ILogger]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,342 INFO L146 ILogger]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,343 INFO L146 ILogger]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,344 INFO L146 ILogger]: ------------------------ END Boogie Preprocessor---------------------------- [2019-05-23 09:49:44,345 INFO L146 ILogger]: ------------------------RCFGBuilder---------------------------- [2019-05-23 09:49:44,345 INFO L146 ILogger]: Initializing RCFGBuilder... [2019-05-23 09:49:44,345 INFO L146 ILogger]: RCFGBuilder initialized [2019-05-23 09:49:44,346 INFO L146 ILogger]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4096 -smt2 -in -t:12000 [2019-05-23 09:49:44,399 INFO L146 ILogger]: Specification and implementation of procedure main given in one single declaration [2019-05-23 09:49:44,399 INFO L146 ILogger]: Found specification of procedure main [2019-05-23 09:49:44,399 INFO L146 ILogger]: Found implementation of procedure main [2019-05-23 09:49:44,581 INFO L146 ILogger]: Using library mode [2019-05-23 09:49:44,581 INFO L146 ILogger]: Removed 0 assume(true) statements. [2019-05-23 09:49:44,582 INFO L146 ILogger]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44 BoogieIcfgContainer [2019-05-23 09:49:44,582 INFO L146 ILogger]: ------------------------ END RCFGBuilder---------------------------- [2019-05-23 09:49:44,583 INFO L146 ILogger]: ------------------------IcfgTransformer---------------------------- [2019-05-23 09:49:44,583 INFO L146 ILogger]: Initializing IcfgTransformer... [2019-05-23 09:49:44,584 INFO L146 ILogger]: IcfgTransformer initialized [2019-05-23 09:49:44,586 INFO L146 ILogger]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44" (1/1) ... [2019-05-23 09:49:44,611 INFO L146 ILogger]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 09:49:44 BasicIcfg [2019-05-23 09:49:44,612 INFO L146 ILogger]: ------------------------ END IcfgTransformer---------------------------- [2019-05-23 09:49:44,613 INFO L146 ILogger]: ------------------------TraceAbstraction---------------------------- [2019-05-23 09:49:44,613 INFO L146 ILogger]: Initializing TraceAbstraction... [2019-05-23 09:49:44,616 INFO L146 ILogger]: TraceAbstraction initialized [2019-05-23 09:49:44,616 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 23.05 09:49:44" (1/3) ... [2019-05-23 09:49:44,617 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232a625c and model type CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.05 09:49:44, skipping insertion in model container [2019-05-23 09:49:44,618 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.05 09:49:44" (2/3) ... [2019-05-23 09:49:44,618 INFO L146 ILogger]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232a625c and model type CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:49:44, skipping insertion in model container [2019-05-23 09:49:44,618 INFO L146 ILogger]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 23.05 09:49:44" (3/3) ... [2019-05-23 09:49:44,620 INFO L146 ILogger]: Analyzing ICFG CountTillBound-Jupiter.bplME [2019-05-23 09:49:44,629 INFO L146 ILogger]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-05-23 09:49:44,636 INFO L146 ILogger]: Appying trace abstraction to program that has 1 error locations. [2019-05-23 09:49:44,651 INFO L146 ILogger]: Starting to check reachability of 1 error locations. [2019-05-23 09:49:44,670 INFO L146 ILogger]: Using default assertion order modulation [2019-05-23 09:49:44,671 INFO L146 ILogger]: Interprodecural is true [2019-05-23 09:49:44,671 INFO L146 ILogger]: Hoare is false [2019-05-23 09:49:44,671 INFO L146 ILogger]: Compute interpolants for ForwardPredicates [2019-05-23 09:49:44,671 INFO L146 ILogger]: Backedges is STRAIGHT_LINE [2019-05-23 09:49:44,672 INFO L146 ILogger]: Determinization is PREDICATE_ABSTRACTION [2019-05-23 09:49:44,672 INFO L146 ILogger]: Difference is false [2019-05-23 09:49:44,672 INFO L146 ILogger]: Minimize is MINIMIZE_SEVPA [2019-05-23 09:49:44,672 INFO L146 ILogger]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-05-23 09:49:44,685 INFO L146 ILogger]: Start isEmpty. Operand 6 states. [2019-05-23 09:49:44,692 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 4 [2019-05-23 09:49:44,693 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:44,694 INFO L146 ILogger]: trace histogram [1, 1, 1] [2019-05-23 09:49:44,696 INFO L146 ILogger]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:44,701 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:44,702 INFO L146 ILogger]: Analyzing trace with hash 46739, now seen corresponding path program 1 times [2019-05-23 09:49:44,746 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:44,770 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:44,773 INFO L146 ILogger]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2019-05-23 09:49:44,777 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:44,827 INFO L146 ILogger]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:44,830 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:49:44,830 INFO L146 ILogger]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-05-23 09:49:44,834 INFO L146 ILogger]: Interpolant automaton has 3 states [2019-05-23 09:49:44,843 INFO L146 ILogger]: Constructing interpolant automaton starting with 3 interpolants. [2019-05-23 09:49:44,844 INFO L146 ILogger]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:49:44,846 INFO L146 ILogger]: Start difference. First operand 6 states. Second operand 3 states. [2019-05-23 09:49:44,920 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:44,920 INFO L146 ILogger]: Finished difference Result 7 states and 8 transitions. [2019-05-23 09:49:44,921 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-05-23 09:49:44,923 INFO L146 ILogger]: Start accepts. Automaton has 3 states. Word has length 3 [2019-05-23 09:49:44,923 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:44,940 INFO L146 ILogger]: With dead ends: 7 [2019-05-23 09:49:44,941 INFO L146 ILogger]: Without dead ends: 6 [2019-05-23 09:49:44,944 INFO L146 ILogger]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-05-23 09:49:44,967 INFO L146 ILogger]: Start minimizeSevpa. Operand 6 states. [2019-05-23 09:49:44,981 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-05-23 09:49:44,982 INFO L146 ILogger]: Start removeUnreachable. Operand 6 states. [2019-05-23 09:49:44,983 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-05-23 09:49:44,984 INFO L146 ILogger]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-05-23 09:49:44,984 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:44,985 INFO L146 ILogger]: Abstraction has 6 states and 7 transitions. [2019-05-23 09:49:44,985 INFO L146 ILogger]: Interpolant automaton has 3 states. [2019-05-23 09:49:44,985 INFO L146 ILogger]: Start isEmpty. Operand 6 states and 7 transitions. [2019-05-23 09:49:44,985 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 6 [2019-05-23 09:49:44,986 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:44,986 INFO L146 ILogger]: trace histogram [1, 1, 1, 1, 1] [2019-05-23 09:49:44,986 INFO L146 ILogger]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:44,987 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:44,987 INFO L146 ILogger]: Analyzing trace with hash 44886038, now seen corresponding path program 1 times [2019-05-23 09:49:44,988 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:44,996 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:44,997 INFO L146 ILogger]: Trace formula consists of 12 conjuncts, 3 conjunts are in the unsatisfiable core [2019-05-23 09:49:44,998 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,045 INFO L146 ILogger]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,045 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,046 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-05-23 09:49:45,047 INFO L146 ILogger]: Interpolant automaton has 4 states [2019-05-23 09:49:45,048 INFO L146 ILogger]: Constructing interpolant automaton starting with 4 interpolants. [2019-05-23 09:49:45,048 INFO L146 ILogger]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:49:45,049 INFO L146 ILogger]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-05-23 09:49:45,104 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,104 INFO L146 ILogger]: Finished difference Result 8 states and 10 transitions. [2019-05-23 09:49:45,105 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:49:45,105 INFO L146 ILogger]: Start accepts. Automaton has 4 states. Word has length 5 [2019-05-23 09:49:45,105 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,105 INFO L146 ILogger]: With dead ends: 8 [2019-05-23 09:49:45,106 INFO L146 ILogger]: Without dead ends: 8 [2019-05-23 09:49:45,107 INFO L146 ILogger]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-05-23 09:49:45,107 INFO L146 ILogger]: Start minimizeSevpa. Operand 8 states. [2019-05-23 09:49:45,108 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-05-23 09:49:45,108 INFO L146 ILogger]: Start removeUnreachable. Operand 8 states. [2019-05-23 09:49:45,109 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2019-05-23 09:49:45,110 INFO L146 ILogger]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 5 [2019-05-23 09:49:45,110 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,110 INFO L146 ILogger]: Abstraction has 8 states and 10 transitions. [2019-05-23 09:49:45,110 INFO L146 ILogger]: Interpolant automaton has 4 states. [2019-05-23 09:49:45,111 INFO L146 ILogger]: Start isEmpty. Operand 8 states and 10 transitions. [2019-05-23 09:49:45,111 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 8 [2019-05-23 09:49:45,111 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,112 INFO L146 ILogger]: trace histogram [2, 2, 1, 1, 1] [2019-05-23 09:49:45,112 INFO L146 ILogger]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,112 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,112 INFO L146 ILogger]: Analyzing trace with hash 185779417, now seen corresponding path program 2 times [2019-05-23 09:49:45,113 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,122 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,123 INFO L146 ILogger]: Trace formula consists of 16 conjuncts, 4 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,124 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,233 INFO L146 ILogger]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,233 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,233 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-05-23 09:49:45,234 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:49:45,234 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:49:45,235 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:49:45,235 INFO L146 ILogger]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2019-05-23 09:49:45,272 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,273 INFO L146 ILogger]: Finished difference Result 10 states and 13 transitions. [2019-05-23 09:49:45,273 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-05-23 09:49:45,273 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 7 [2019-05-23 09:49:45,274 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,274 INFO L146 ILogger]: With dead ends: 10 [2019-05-23 09:49:45,274 INFO L146 ILogger]: Without dead ends: 10 [2019-05-23 09:49:45,275 INFO L146 ILogger]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:49:45,275 INFO L146 ILogger]: Start minimizeSevpa. Operand 10 states. [2019-05-23 09:49:45,276 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-05-23 09:49:45,277 INFO L146 ILogger]: Start removeUnreachable. Operand 10 states. [2019-05-23 09:49:45,277 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-05-23 09:49:45,278 INFO L146 ILogger]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2019-05-23 09:49:45,278 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,278 INFO L146 ILogger]: Abstraction has 10 states and 13 transitions. [2019-05-23 09:49:45,278 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:49:45,278 INFO L146 ILogger]: Start isEmpty. Operand 10 states and 13 transitions. [2019-05-23 09:49:45,279 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 10 [2019-05-23 09:49:45,279 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,279 INFO L146 ILogger]: trace histogram [3, 3, 1, 1, 1] [2019-05-23 09:49:45,280 INFO L146 ILogger]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,280 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,280 INFO L146 ILogger]: Analyzing trace with hash -1854636836, now seen corresponding path program 3 times [2019-05-23 09:49:45,281 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,290 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,290 INFO L146 ILogger]: Trace formula consists of 20 conjuncts, 5 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,292 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,394 INFO L146 ILogger]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,395 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,395 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-05-23 09:49:45,395 INFO L146 ILogger]: Interpolant automaton has 6 states [2019-05-23 09:49:45,396 INFO L146 ILogger]: Constructing interpolant automaton starting with 6 interpolants. [2019-05-23 09:49:45,396 INFO L146 ILogger]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:49:45,396 INFO L146 ILogger]: Start difference. First operand 10 states and 13 transitions. Second operand 6 states. [2019-05-23 09:49:45,449 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,450 INFO L146 ILogger]: Finished difference Result 12 states and 16 transitions. [2019-05-23 09:49:45,450 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-05-23 09:49:45,450 INFO L146 ILogger]: Start accepts. Automaton has 6 states. Word has length 9 [2019-05-23 09:49:45,450 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,451 INFO L146 ILogger]: With dead ends: 12 [2019-05-23 09:49:45,451 INFO L146 ILogger]: Without dead ends: 12 [2019-05-23 09:49:45,452 INFO L146 ILogger]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-05-23 09:49:45,452 INFO L146 ILogger]: Start minimizeSevpa. Operand 12 states. [2019-05-23 09:49:45,453 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-05-23 09:49:45,453 INFO L146 ILogger]: Start removeUnreachable. Operand 12 states. [2019-05-23 09:49:45,454 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-05-23 09:49:45,454 INFO L146 ILogger]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2019-05-23 09:49:45,455 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,455 INFO L146 ILogger]: Abstraction has 12 states and 16 transitions. [2019-05-23 09:49:45,455 INFO L146 ILogger]: Interpolant automaton has 6 states. [2019-05-23 09:49:45,455 INFO L146 ILogger]: Start isEmpty. Operand 12 states and 16 transitions. [2019-05-23 09:49:45,455 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 12 [2019-05-23 09:49:45,456 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,456 INFO L146 ILogger]: trace histogram [4, 4, 1, 1, 1] [2019-05-23 09:49:45,456 INFO L146 ILogger]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,456 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,456 INFO L146 ILogger]: Analyzing trace with hash 105398303, now seen corresponding path program 4 times [2019-05-23 09:49:45,457 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,466 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,467 INFO L146 ILogger]: Trace formula consists of 24 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,468 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,618 INFO L146 ILogger]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,619 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,619 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-05-23 09:49:45,619 INFO L146 ILogger]: Interpolant automaton has 7 states [2019-05-23 09:49:45,620 INFO L146 ILogger]: Constructing interpolant automaton starting with 7 interpolants. [2019-05-23 09:49:45,620 INFO L146 ILogger]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:49:45,620 INFO L146 ILogger]: Start difference. First operand 12 states and 16 transitions. Second operand 7 states. [2019-05-23 09:49:45,778 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,779 INFO L146 ILogger]: Finished difference Result 14 states and 19 transitions. [2019-05-23 09:49:45,779 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-05-23 09:49:45,779 INFO L146 ILogger]: Start accepts. Automaton has 7 states. Word has length 11 [2019-05-23 09:49:45,779 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,780 INFO L146 ILogger]: With dead ends: 14 [2019-05-23 09:49:45,780 INFO L146 ILogger]: Without dead ends: 14 [2019-05-23 09:49:45,781 INFO L146 ILogger]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-05-23 09:49:45,781 INFO L146 ILogger]: Start minimizeSevpa. Operand 14 states. [2019-05-23 09:49:45,783 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-05-23 09:49:45,783 INFO L146 ILogger]: Start removeUnreachable. Operand 14 states. [2019-05-23 09:49:45,783 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-05-23 09:49:45,784 INFO L146 ILogger]: Start accepts. Automaton has 14 states and 19 transitions. Word has length 11 [2019-05-23 09:49:45,784 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,784 INFO L146 ILogger]: Abstraction has 14 states and 19 transitions. [2019-05-23 09:49:45,784 INFO L146 ILogger]: Interpolant automaton has 7 states. [2019-05-23 09:49:45,784 INFO L146 ILogger]: Start isEmpty. Operand 14 states and 19 transitions. [2019-05-23 09:49:45,785 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 14 [2019-05-23 09:49:45,785 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,785 INFO L146 ILogger]: trace histogram [5, 5, 1, 1, 1] [2019-05-23 09:49:45,785 INFO L146 ILogger]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,786 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,786 INFO L146 ILogger]: Analyzing trace with hash -1791476062, now seen corresponding path program 5 times [2019-05-23 09:49:45,787 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:45,796 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:45,797 INFO L146 ILogger]: Trace formula consists of 28 conjuncts, 7 conjunts are in the unsatisfiable core [2019-05-23 09:49:45,798 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:45,943 INFO L146 ILogger]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:45,943 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:45,944 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-05-23 09:49:45,944 INFO L146 ILogger]: Interpolant automaton has 8 states [2019-05-23 09:49:45,944 INFO L146 ILogger]: Constructing interpolant automaton starting with 8 interpolants. [2019-05-23 09:49:45,945 INFO L146 ILogger]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:49:45,945 INFO L146 ILogger]: Start difference. First operand 14 states and 19 transitions. Second operand 8 states. [2019-05-23 09:49:45,989 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:45,990 INFO L146 ILogger]: Finished difference Result 16 states and 22 transitions. [2019-05-23 09:49:45,990 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-05-23 09:49:45,990 INFO L146 ILogger]: Start accepts. Automaton has 8 states. Word has length 13 [2019-05-23 09:49:45,990 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:45,991 INFO L146 ILogger]: With dead ends: 16 [2019-05-23 09:49:45,991 INFO L146 ILogger]: Without dead ends: 16 [2019-05-23 09:49:45,991 INFO L146 ILogger]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-05-23 09:49:45,992 INFO L146 ILogger]: Start minimizeSevpa. Operand 16 states. [2019-05-23 09:49:45,993 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-05-23 09:49:45,994 INFO L146 ILogger]: Start removeUnreachable. Operand 16 states. [2019-05-23 09:49:45,994 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-05-23 09:49:45,994 INFO L146 ILogger]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 13 [2019-05-23 09:49:45,995 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:45,995 INFO L146 ILogger]: Abstraction has 16 states and 22 transitions. [2019-05-23 09:49:45,995 INFO L146 ILogger]: Interpolant automaton has 8 states. [2019-05-23 09:49:45,995 INFO L146 ILogger]: Start isEmpty. Operand 16 states and 22 transitions. [2019-05-23 09:49:45,996 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 16 [2019-05-23 09:49:45,996 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:45,996 INFO L146 ILogger]: trace histogram [6, 6, 1, 1, 1] [2019-05-23 09:49:45,996 INFO L146 ILogger]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:45,996 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:45,996 INFO L146 ILogger]: Analyzing trace with hash 673359973, now seen corresponding path program 6 times [2019-05-23 09:49:45,997 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,008 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,009 INFO L146 ILogger]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,010 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,189 INFO L146 ILogger]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,189 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,189 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-05-23 09:49:46,190 INFO L146 ILogger]: Interpolant automaton has 9 states [2019-05-23 09:49:46,190 INFO L146 ILogger]: Constructing interpolant automaton starting with 9 interpolants. [2019-05-23 09:49:46,191 INFO L146 ILogger]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:49:46,191 INFO L146 ILogger]: Start difference. First operand 16 states and 22 transitions. Second operand 9 states. [2019-05-23 09:49:46,219 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,220 INFO L146 ILogger]: Finished difference Result 18 states and 25 transitions. [2019-05-23 09:49:46,220 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-05-23 09:49:46,220 INFO L146 ILogger]: Start accepts. Automaton has 9 states. Word has length 15 [2019-05-23 09:49:46,221 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,221 INFO L146 ILogger]: With dead ends: 18 [2019-05-23 09:49:46,222 INFO L146 ILogger]: Without dead ends: 18 [2019-05-23 09:49:46,222 INFO L146 ILogger]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-05-23 09:49:46,223 INFO L146 ILogger]: Start minimizeSevpa. Operand 18 states. [2019-05-23 09:49:46,225 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-05-23 09:49:46,225 INFO L146 ILogger]: Start removeUnreachable. Operand 18 states. [2019-05-23 09:49:46,226 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 18 states to 18 states and 25 transitions. [2019-05-23 09:49:46,226 INFO L146 ILogger]: Start accepts. Automaton has 18 states and 25 transitions. Word has length 15 [2019-05-23 09:49:46,226 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,226 INFO L146 ILogger]: Abstraction has 18 states and 25 transitions. [2019-05-23 09:49:46,227 INFO L146 ILogger]: Interpolant automaton has 9 states. [2019-05-23 09:49:46,227 INFO L146 ILogger]: Start isEmpty. Operand 18 states and 25 transitions. [2019-05-23 09:49:46,227 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 18 [2019-05-23 09:49:46,227 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,227 INFO L146 ILogger]: trace histogram [7, 7, 1, 1, 1] [2019-05-23 09:49:46,228 INFO L146 ILogger]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,228 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,228 INFO L146 ILogger]: Analyzing trace with hash -1441157784, now seen corresponding path program 7 times [2019-05-23 09:49:46,229 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,241 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,243 INFO L146 ILogger]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,244 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,352 INFO L146 ILogger]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,353 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,353 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-05-23 09:49:46,353 INFO L146 ILogger]: Interpolant automaton has 10 states [2019-05-23 09:49:46,354 INFO L146 ILogger]: Constructing interpolant automaton starting with 10 interpolants. [2019-05-23 09:49:46,354 INFO L146 ILogger]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:49:46,354 INFO L146 ILogger]: Start difference. First operand 18 states and 25 transitions. Second operand 10 states. [2019-05-23 09:49:46,375 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,375 INFO L146 ILogger]: Finished difference Result 20 states and 28 transitions. [2019-05-23 09:49:46,378 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-05-23 09:49:46,378 INFO L146 ILogger]: Start accepts. Automaton has 10 states. Word has length 17 [2019-05-23 09:49:46,378 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,379 INFO L146 ILogger]: With dead ends: 20 [2019-05-23 09:49:46,379 INFO L146 ILogger]: Without dead ends: 20 [2019-05-23 09:49:46,379 INFO L146 ILogger]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-05-23 09:49:46,380 INFO L146 ILogger]: Start minimizeSevpa. Operand 20 states. [2019-05-23 09:49:46,382 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-05-23 09:49:46,382 INFO L146 ILogger]: Start removeUnreachable. Operand 20 states. [2019-05-23 09:49:46,383 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 20 states to 20 states and 28 transitions. [2019-05-23 09:49:46,383 INFO L146 ILogger]: Start accepts. Automaton has 20 states and 28 transitions. Word has length 17 [2019-05-23 09:49:46,383 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,383 INFO L146 ILogger]: Abstraction has 20 states and 28 transitions. [2019-05-23 09:49:46,383 INFO L146 ILogger]: Interpolant automaton has 10 states. [2019-05-23 09:49:46,384 INFO L146 ILogger]: Start isEmpty. Operand 20 states and 28 transitions. [2019-05-23 09:49:46,384 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 20 [2019-05-23 09:49:46,384 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,385 INFO L146 ILogger]: trace histogram [8, 8, 1, 1, 1] [2019-05-23 09:49:46,385 INFO L146 ILogger]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,385 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,385 INFO L146 ILogger]: Analyzing trace with hash -1973191253, now seen corresponding path program 8 times [2019-05-23 09:49:46,386 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,397 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,398 INFO L146 ILogger]: Trace formula consists of 40 conjuncts, 10 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,400 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:46,829 INFO L146 ILogger]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:46,830 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:46,830 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-05-23 09:49:46,830 INFO L146 ILogger]: Interpolant automaton has 11 states [2019-05-23 09:49:46,831 INFO L146 ILogger]: Constructing interpolant automaton starting with 11 interpolants. [2019-05-23 09:49:46,831 INFO L146 ILogger]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:49:46,831 INFO L146 ILogger]: Start difference. First operand 20 states and 28 transitions. Second operand 11 states. [2019-05-23 09:49:46,862 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:46,862 INFO L146 ILogger]: Finished difference Result 22 states and 31 transitions. [2019-05-23 09:49:46,862 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-05-23 09:49:46,862 INFO L146 ILogger]: Start accepts. Automaton has 11 states. Word has length 19 [2019-05-23 09:49:46,863 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:46,863 INFO L146 ILogger]: With dead ends: 22 [2019-05-23 09:49:46,863 INFO L146 ILogger]: Without dead ends: 22 [2019-05-23 09:49:46,864 INFO L146 ILogger]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-05-23 09:49:46,864 INFO L146 ILogger]: Start minimizeSevpa. Operand 22 states. [2019-05-23 09:49:46,866 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-05-23 09:49:46,866 INFO L146 ILogger]: Start removeUnreachable. Operand 22 states. [2019-05-23 09:49:46,867 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 22 states to 22 states and 31 transitions. [2019-05-23 09:49:46,867 INFO L146 ILogger]: Start accepts. Automaton has 22 states and 31 transitions. Word has length 19 [2019-05-23 09:49:46,867 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:46,867 INFO L146 ILogger]: Abstraction has 22 states and 31 transitions. [2019-05-23 09:49:46,868 INFO L146 ILogger]: Interpolant automaton has 11 states. [2019-05-23 09:49:46,868 INFO L146 ILogger]: Start isEmpty. Operand 22 states and 31 transitions. [2019-05-23 09:49:46,868 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 22 [2019-05-23 09:49:46,868 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:46,868 INFO L146 ILogger]: trace histogram [9, 9, 1, 1, 1] [2019-05-23 09:49:46,869 INFO L146 ILogger]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:46,869 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:46,869 INFO L146 ILogger]: Analyzing trace with hash 2138720558, now seen corresponding path program 9 times [2019-05-23 09:49:46,870 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:46,882 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:46,883 INFO L146 ILogger]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2019-05-23 09:49:46,884 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,009 INFO L146 ILogger]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,009 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,010 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-05-23 09:49:47,010 INFO L146 ILogger]: Interpolant automaton has 12 states [2019-05-23 09:49:47,010 INFO L146 ILogger]: Constructing interpolant automaton starting with 12 interpolants. [2019-05-23 09:49:47,011 INFO L146 ILogger]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:49:47,011 INFO L146 ILogger]: Start difference. First operand 22 states and 31 transitions. Second operand 12 states. [2019-05-23 09:49:47,042 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,042 INFO L146 ILogger]: Finished difference Result 24 states and 34 transitions. [2019-05-23 09:49:47,042 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-05-23 09:49:47,043 INFO L146 ILogger]: Start accepts. Automaton has 12 states. Word has length 21 [2019-05-23 09:49:47,043 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,043 INFO L146 ILogger]: With dead ends: 24 [2019-05-23 09:49:47,044 INFO L146 ILogger]: Without dead ends: 24 [2019-05-23 09:49:47,044 INFO L146 ILogger]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-05-23 09:49:47,044 INFO L146 ILogger]: Start minimizeSevpa. Operand 24 states. [2019-05-23 09:49:47,047 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-05-23 09:49:47,047 INFO L146 ILogger]: Start removeUnreachable. Operand 24 states. [2019-05-23 09:49:47,048 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2019-05-23 09:49:47,048 INFO L146 ILogger]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 21 [2019-05-23 09:49:47,049 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,049 INFO L146 ILogger]: Abstraction has 24 states and 34 transitions. [2019-05-23 09:49:47,049 INFO L146 ILogger]: Interpolant automaton has 12 states. [2019-05-23 09:49:47,049 INFO L146 ILogger]: Start isEmpty. Operand 24 states and 34 transitions. [2019-05-23 09:49:47,050 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 24 [2019-05-23 09:49:47,050 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,050 INFO L146 ILogger]: trace histogram [10, 10, 1, 1, 1] [2019-05-23 09:49:47,050 INFO L146 ILogger]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,051 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,051 INFO L146 ILogger]: Analyzing trace with hash -1978908687, now seen corresponding path program 10 times [2019-05-23 09:49:47,052 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,065 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,066 INFO L146 ILogger]: Trace formula consists of 48 conjuncts, 12 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,068 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,203 INFO L146 ILogger]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,203 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,203 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-05-23 09:49:47,203 INFO L146 ILogger]: Interpolant automaton has 13 states [2019-05-23 09:49:47,204 INFO L146 ILogger]: Constructing interpolant automaton starting with 13 interpolants. [2019-05-23 09:49:47,204 INFO L146 ILogger]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:49:47,204 INFO L146 ILogger]: Start difference. First operand 24 states and 34 transitions. Second operand 13 states. [2019-05-23 09:49:47,425 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,425 INFO L146 ILogger]: Finished difference Result 26 states and 37 transitions. [2019-05-23 09:49:47,425 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-05-23 09:49:47,426 INFO L146 ILogger]: Start accepts. Automaton has 13 states. Word has length 23 [2019-05-23 09:49:47,427 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,427 INFO L146 ILogger]: With dead ends: 26 [2019-05-23 09:49:47,428 INFO L146 ILogger]: Without dead ends: 26 [2019-05-23 09:49:47,428 INFO L146 ILogger]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-05-23 09:49:47,429 INFO L146 ILogger]: Start minimizeSevpa. Operand 26 states. [2019-05-23 09:49:47,434 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-05-23 09:49:47,436 INFO L146 ILogger]: Start removeUnreachable. Operand 26 states. [2019-05-23 09:49:47,436 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 26 states to 26 states and 37 transitions. [2019-05-23 09:49:47,437 INFO L146 ILogger]: Start accepts. Automaton has 26 states and 37 transitions. Word has length 23 [2019-05-23 09:49:47,437 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,437 INFO L146 ILogger]: Abstraction has 26 states and 37 transitions. [2019-05-23 09:49:47,437 INFO L146 ILogger]: Interpolant automaton has 13 states. [2019-05-23 09:49:47,437 INFO L146 ILogger]: Start isEmpty. Operand 26 states and 37 transitions. [2019-05-23 09:49:47,438 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 26 [2019-05-23 09:49:47,438 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,438 INFO L146 ILogger]: trace histogram [11, 11, 1, 1, 1] [2019-05-23 09:49:47,438 INFO L146 ILogger]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,439 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,440 INFO L146 ILogger]: Analyzing trace with hash 939233780, now seen corresponding path program 11 times [2019-05-23 09:49:47,441 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,465 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,469 INFO L146 ILogger]: Trace formula consists of 52 conjuncts, 13 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,470 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,744 INFO L146 ILogger]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,744 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,745 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-05-23 09:49:47,745 INFO L146 ILogger]: Interpolant automaton has 14 states [2019-05-23 09:49:47,745 INFO L146 ILogger]: Constructing interpolant automaton starting with 14 interpolants. [2019-05-23 09:49:47,746 INFO L146 ILogger]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:49:47,746 INFO L146 ILogger]: Start difference. First operand 26 states and 37 transitions. Second operand 14 states. [2019-05-23 09:49:47,792 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,792 INFO L146 ILogger]: Finished difference Result 28 states and 40 transitions. [2019-05-23 09:49:47,792 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-05-23 09:49:47,792 INFO L146 ILogger]: Start accepts. Automaton has 14 states. Word has length 25 [2019-05-23 09:49:47,793 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,794 INFO L146 ILogger]: With dead ends: 28 [2019-05-23 09:49:47,794 INFO L146 ILogger]: Without dead ends: 28 [2019-05-23 09:49:47,795 INFO L146 ILogger]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-05-23 09:49:47,795 INFO L146 ILogger]: Start minimizeSevpa. Operand 28 states. [2019-05-23 09:49:47,798 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-05-23 09:49:47,798 INFO L146 ILogger]: Start removeUnreachable. Operand 28 states. [2019-05-23 09:49:47,798 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 28 states to 28 states and 40 transitions. [2019-05-23 09:49:47,798 INFO L146 ILogger]: Start accepts. Automaton has 28 states and 40 transitions. Word has length 25 [2019-05-23 09:49:47,799 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,799 INFO L146 ILogger]: Abstraction has 28 states and 40 transitions. [2019-05-23 09:49:47,799 INFO L146 ILogger]: Interpolant automaton has 14 states. [2019-05-23 09:49:47,799 INFO L146 ILogger]: Start isEmpty. Operand 28 states and 40 transitions. [2019-05-23 09:49:47,800 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 28 [2019-05-23 09:49:47,800 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,800 INFO L146 ILogger]: trace histogram [12, 12, 1, 1, 1] [2019-05-23 09:49:47,800 INFO L146 ILogger]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,801 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,801 INFO L146 ILogger]: Analyzing trace with hash 660500279, now seen corresponding path program 12 times [2019-05-23 09:49:47,801 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:47,813 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:47,814 INFO L146 ILogger]: Trace formula consists of 56 conjuncts, 14 conjunts are in the unsatisfiable core [2019-05-23 09:49:47,816 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:47,936 INFO L146 ILogger]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:47,937 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:47,937 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-05-23 09:49:47,937 INFO L146 ILogger]: Interpolant automaton has 15 states [2019-05-23 09:49:47,937 INFO L146 ILogger]: Constructing interpolant automaton starting with 15 interpolants. [2019-05-23 09:49:47,938 INFO L146 ILogger]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:49:47,938 INFO L146 ILogger]: Start difference. First operand 28 states and 40 transitions. Second operand 15 states. [2019-05-23 09:49:47,980 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:47,980 INFO L146 ILogger]: Finished difference Result 30 states and 43 transitions. [2019-05-23 09:49:47,981 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-05-23 09:49:47,981 INFO L146 ILogger]: Start accepts. Automaton has 15 states. Word has length 27 [2019-05-23 09:49:47,981 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:47,982 INFO L146 ILogger]: With dead ends: 30 [2019-05-23 09:49:47,982 INFO L146 ILogger]: Without dead ends: 30 [2019-05-23 09:49:47,982 INFO L146 ILogger]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-05-23 09:49:47,983 INFO L146 ILogger]: Start minimizeSevpa. Operand 30 states. [2019-05-23 09:49:47,985 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-05-23 09:49:47,985 INFO L146 ILogger]: Start removeUnreachable. Operand 30 states. [2019-05-23 09:49:47,987 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2019-05-23 09:49:47,987 INFO L146 ILogger]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 27 [2019-05-23 09:49:47,987 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:47,987 INFO L146 ILogger]: Abstraction has 30 states and 43 transitions. [2019-05-23 09:49:47,988 INFO L146 ILogger]: Interpolant automaton has 15 states. [2019-05-23 09:49:47,988 INFO L146 ILogger]: Start isEmpty. Operand 30 states and 43 transitions. [2019-05-23 09:49:47,988 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 30 [2019-05-23 09:49:47,988 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:47,988 INFO L146 ILogger]: trace histogram [13, 13, 1, 1, 1] [2019-05-23 09:49:47,989 INFO L146 ILogger]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:47,989 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:47,989 INFO L146 ILogger]: Analyzing trace with hash -914421830, now seen corresponding path program 13 times [2019-05-23 09:49:47,990 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,001 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,003 INFO L146 ILogger]: Trace formula consists of 60 conjuncts, 15 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,004 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,277 INFO L146 ILogger]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,277 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,277 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-05-23 09:49:48,278 INFO L146 ILogger]: Interpolant automaton has 16 states [2019-05-23 09:49:48,278 INFO L146 ILogger]: Constructing interpolant automaton starting with 16 interpolants. [2019-05-23 09:49:48,279 INFO L146 ILogger]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:49:48,279 INFO L146 ILogger]: Start difference. First operand 30 states and 43 transitions. Second operand 16 states. [2019-05-23 09:49:48,306 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,306 INFO L146 ILogger]: Finished difference Result 32 states and 46 transitions. [2019-05-23 09:49:48,306 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-05-23 09:49:48,307 INFO L146 ILogger]: Start accepts. Automaton has 16 states. Word has length 29 [2019-05-23 09:49:48,307 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,308 INFO L146 ILogger]: With dead ends: 32 [2019-05-23 09:49:48,308 INFO L146 ILogger]: Without dead ends: 32 [2019-05-23 09:49:48,309 INFO L146 ILogger]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-05-23 09:49:48,309 INFO L146 ILogger]: Start minimizeSevpa. Operand 32 states. [2019-05-23 09:49:48,311 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-05-23 09:49:48,312 INFO L146 ILogger]: Start removeUnreachable. Operand 32 states. [2019-05-23 09:49:48,312 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 32 states to 32 states and 46 transitions. [2019-05-23 09:49:48,312 INFO L146 ILogger]: Start accepts. Automaton has 32 states and 46 transitions. Word has length 29 [2019-05-23 09:49:48,313 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,313 INFO L146 ILogger]: Abstraction has 32 states and 46 transitions. [2019-05-23 09:49:48,313 INFO L146 ILogger]: Interpolant automaton has 16 states. [2019-05-23 09:49:48,313 INFO L146 ILogger]: Start isEmpty. Operand 32 states and 46 transitions. [2019-05-23 09:49:48,314 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 32 [2019-05-23 09:49:48,314 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,314 INFO L146 ILogger]: trace histogram [14, 14, 1, 1, 1] [2019-05-23 09:49:48,314 INFO L146 ILogger]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,315 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,315 INFO L146 ILogger]: Analyzing trace with hash 1708886909, now seen corresponding path program 14 times [2019-05-23 09:49:48,315 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,328 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,330 INFO L146 ILogger]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,332 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,541 INFO L146 ILogger]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,541 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,541 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-05-23 09:49:48,542 INFO L146 ILogger]: Interpolant automaton has 17 states [2019-05-23 09:49:48,543 INFO L146 ILogger]: Constructing interpolant automaton starting with 17 interpolants. [2019-05-23 09:49:48,543 INFO L146 ILogger]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:49:48,543 INFO L146 ILogger]: Start difference. First operand 32 states and 46 transitions. Second operand 17 states. [2019-05-23 09:49:48,578 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,578 INFO L146 ILogger]: Finished difference Result 34 states and 49 transitions. [2019-05-23 09:49:48,579 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-05-23 09:49:48,579 INFO L146 ILogger]: Start accepts. Automaton has 17 states. Word has length 31 [2019-05-23 09:49:48,579 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,580 INFO L146 ILogger]: With dead ends: 34 [2019-05-23 09:49:48,580 INFO L146 ILogger]: Without dead ends: 34 [2019-05-23 09:49:48,581 INFO L146 ILogger]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-05-23 09:49:48,581 INFO L146 ILogger]: Start minimizeSevpa. Operand 34 states. [2019-05-23 09:49:48,584 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-05-23 09:49:48,584 INFO L146 ILogger]: Start removeUnreachable. Operand 34 states. [2019-05-23 09:49:48,592 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 34 states to 34 states and 49 transitions. [2019-05-23 09:49:48,593 INFO L146 ILogger]: Start accepts. Automaton has 34 states and 49 transitions. Word has length 31 [2019-05-23 09:49:48,593 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,593 INFO L146 ILogger]: Abstraction has 34 states and 49 transitions. [2019-05-23 09:49:48,593 INFO L146 ILogger]: Interpolant automaton has 17 states. [2019-05-23 09:49:48,593 INFO L146 ILogger]: Start isEmpty. Operand 34 states and 49 transitions. [2019-05-23 09:49:48,594 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 34 [2019-05-23 09:49:48,594 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,594 INFO L146 ILogger]: trace histogram [15, 15, 1, 1, 1] [2019-05-23 09:49:48,595 INFO L146 ILogger]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,595 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,595 INFO L146 ILogger]: Analyzing trace with hash 1562782336, now seen corresponding path program 15 times [2019-05-23 09:49:48,596 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,622 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,623 INFO L146 ILogger]: Trace formula consists of 68 conjuncts, 17 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,625 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:48,804 INFO L146 ILogger]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:48,804 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:48,805 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-05-23 09:49:48,805 INFO L146 ILogger]: Interpolant automaton has 18 states [2019-05-23 09:49:48,805 INFO L146 ILogger]: Constructing interpolant automaton starting with 18 interpolants. [2019-05-23 09:49:48,806 INFO L146 ILogger]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:49:48,806 INFO L146 ILogger]: Start difference. First operand 34 states and 49 transitions. Second operand 18 states. [2019-05-23 09:49:48,860 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:48,861 INFO L146 ILogger]: Finished difference Result 36 states and 52 transitions. [2019-05-23 09:49:48,861 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-05-23 09:49:48,861 INFO L146 ILogger]: Start accepts. Automaton has 18 states. Word has length 33 [2019-05-23 09:49:48,862 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:48,862 INFO L146 ILogger]: With dead ends: 36 [2019-05-23 09:49:48,862 INFO L146 ILogger]: Without dead ends: 36 [2019-05-23 09:49:48,863 INFO L146 ILogger]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-05-23 09:49:48,864 INFO L146 ILogger]: Start minimizeSevpa. Operand 36 states. [2019-05-23 09:49:48,866 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-05-23 09:49:48,866 INFO L146 ILogger]: Start removeUnreachable. Operand 36 states. [2019-05-23 09:49:48,866 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2019-05-23 09:49:48,867 INFO L146 ILogger]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 33 [2019-05-23 09:49:48,867 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:48,867 INFO L146 ILogger]: Abstraction has 36 states and 52 transitions. [2019-05-23 09:49:48,867 INFO L146 ILogger]: Interpolant automaton has 18 states. [2019-05-23 09:49:48,867 INFO L146 ILogger]: Start isEmpty. Operand 36 states and 52 transitions. [2019-05-23 09:49:48,868 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 36 [2019-05-23 09:49:48,868 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:48,868 INFO L146 ILogger]: trace histogram [16, 16, 1, 1, 1] [2019-05-23 09:49:48,868 INFO L146 ILogger]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:48,868 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:48,869 INFO L146 ILogger]: Analyzing trace with hash -1404758845, now seen corresponding path program 16 times [2019-05-23 09:49:48,869 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:48,886 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:48,888 INFO L146 ILogger]: Trace formula consists of 72 conjuncts, 18 conjunts are in the unsatisfiable core [2019-05-23 09:49:48,889 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:49,084 INFO L146 ILogger]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:49,085 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:49,085 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-05-23 09:49:49,085 INFO L146 ILogger]: Interpolant automaton has 19 states [2019-05-23 09:49:49,086 INFO L146 ILogger]: Constructing interpolant automaton starting with 19 interpolants. [2019-05-23 09:49:49,086 INFO L146 ILogger]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:49:49,086 INFO L146 ILogger]: Start difference. First operand 36 states and 52 transitions. Second operand 19 states. [2019-05-23 09:49:49,116 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:49,116 INFO L146 ILogger]: Finished difference Result 38 states and 55 transitions. [2019-05-23 09:49:49,117 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-05-23 09:49:49,117 INFO L146 ILogger]: Start accepts. Automaton has 19 states. Word has length 35 [2019-05-23 09:49:49,117 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:49,118 INFO L146 ILogger]: With dead ends: 38 [2019-05-23 09:49:49,118 INFO L146 ILogger]: Without dead ends: 38 [2019-05-23 09:49:49,119 INFO L146 ILogger]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-05-23 09:49:49,119 INFO L146 ILogger]: Start minimizeSevpa. Operand 38 states. [2019-05-23 09:49:49,121 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-05-23 09:49:49,121 INFO L146 ILogger]: Start removeUnreachable. Operand 38 states. [2019-05-23 09:49:49,122 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 38 states to 38 states and 55 transitions. [2019-05-23 09:49:49,122 INFO L146 ILogger]: Start accepts. Automaton has 38 states and 55 transitions. Word has length 35 [2019-05-23 09:49:49,122 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:49,122 INFO L146 ILogger]: Abstraction has 38 states and 55 transitions. [2019-05-23 09:49:49,123 INFO L146 ILogger]: Interpolant automaton has 19 states. [2019-05-23 09:49:49,123 INFO L146 ILogger]: Start isEmpty. Operand 38 states and 55 transitions. [2019-05-23 09:49:49,123 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 38 [2019-05-23 09:49:49,123 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:49,124 INFO L146 ILogger]: trace histogram [17, 17, 1, 1, 1] [2019-05-23 09:49:49,124 INFO L146 ILogger]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:49,124 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:49,124 INFO L146 ILogger]: Analyzing trace with hash -1353549242, now seen corresponding path program 17 times [2019-05-23 09:49:49,125 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:49,135 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:49,136 INFO L146 ILogger]: Trace formula consists of 76 conjuncts, 19 conjunts are in the unsatisfiable core [2019-05-23 09:49:49,138 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:49,628 INFO L146 ILogger]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:49,628 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:49,629 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-05-23 09:49:49,629 INFO L146 ILogger]: Interpolant automaton has 20 states [2019-05-23 09:49:49,629 INFO L146 ILogger]: Constructing interpolant automaton starting with 20 interpolants. [2019-05-23 09:49:49,630 INFO L146 ILogger]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:49:49,630 INFO L146 ILogger]: Start difference. First operand 38 states and 55 transitions. Second operand 20 states. [2019-05-23 09:49:49,709 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:49,709 INFO L146 ILogger]: Finished difference Result 40 states and 58 transitions. [2019-05-23 09:49:49,710 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-05-23 09:49:49,710 INFO L146 ILogger]: Start accepts. Automaton has 20 states. Word has length 37 [2019-05-23 09:49:49,710 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:49,710 INFO L146 ILogger]: With dead ends: 40 [2019-05-23 09:49:49,710 INFO L146 ILogger]: Without dead ends: 40 [2019-05-23 09:49:49,711 INFO L146 ILogger]: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-05-23 09:49:49,711 INFO L146 ILogger]: Start minimizeSevpa. Operand 40 states. [2019-05-23 09:49:49,713 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-05-23 09:49:49,714 INFO L146 ILogger]: Start removeUnreachable. Operand 40 states. [2019-05-23 09:49:49,714 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-05-23 09:49:49,714 INFO L146 ILogger]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 37 [2019-05-23 09:49:49,714 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:49,715 INFO L146 ILogger]: Abstraction has 40 states and 58 transitions. [2019-05-23 09:49:49,715 INFO L146 ILogger]: Interpolant automaton has 20 states. [2019-05-23 09:49:49,715 INFO L146 ILogger]: Start isEmpty. Operand 40 states and 58 transitions. [2019-05-23 09:49:49,715 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 40 [2019-05-23 09:49:49,716 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:49,716 INFO L146 ILogger]: trace histogram [18, 18, 1, 1, 1] [2019-05-23 09:49:49,716 INFO L146 ILogger]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:49,716 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:49,716 INFO L146 ILogger]: Analyzing trace with hash 614238985, now seen corresponding path program 18 times [2019-05-23 09:49:49,717 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:49,727 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:49,728 INFO L146 ILogger]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2019-05-23 09:49:49,730 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:50,241 INFO L146 ILogger]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:50,241 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:50,241 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-05-23 09:49:50,244 INFO L146 ILogger]: Interpolant automaton has 21 states [2019-05-23 09:49:50,244 INFO L146 ILogger]: Constructing interpolant automaton starting with 21 interpolants. [2019-05-23 09:49:50,244 INFO L146 ILogger]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:49:50,245 INFO L146 ILogger]: Start difference. First operand 40 states and 58 transitions. Second operand 21 states. [2019-05-23 09:49:50,276 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:50,277 INFO L146 ILogger]: Finished difference Result 42 states and 61 transitions. [2019-05-23 09:49:50,277 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-05-23 09:49:50,277 INFO L146 ILogger]: Start accepts. Automaton has 21 states. Word has length 39 [2019-05-23 09:49:50,277 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:50,278 INFO L146 ILogger]: With dead ends: 42 [2019-05-23 09:49:50,278 INFO L146 ILogger]: Without dead ends: 42 [2019-05-23 09:49:50,279 INFO L146 ILogger]: 0 DeclaredPredicates, 38 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-05-23 09:49:50,280 INFO L146 ILogger]: Start minimizeSevpa. Operand 42 states. [2019-05-23 09:49:50,282 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-05-23 09:49:50,282 INFO L146 ILogger]: Start removeUnreachable. Operand 42 states. [2019-05-23 09:49:50,283 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2019-05-23 09:49:50,283 INFO L146 ILogger]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 39 [2019-05-23 09:49:50,283 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:50,283 INFO L146 ILogger]: Abstraction has 42 states and 61 transitions. [2019-05-23 09:49:50,283 INFO L146 ILogger]: Interpolant automaton has 21 states. [2019-05-23 09:49:50,283 INFO L146 ILogger]: Start isEmpty. Operand 42 states and 61 transitions. [2019-05-23 09:49:50,284 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 42 [2019-05-23 09:49:50,284 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:50,284 INFO L146 ILogger]: trace histogram [19, 19, 1, 1, 1] [2019-05-23 09:49:50,285 INFO L146 ILogger]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:50,285 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:50,285 INFO L146 ILogger]: Analyzing trace with hash 1873114892, now seen corresponding path program 19 times [2019-05-23 09:49:50,286 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:50,295 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:50,296 INFO L146 ILogger]: Trace formula consists of 84 conjuncts, 21 conjunts are in the unsatisfiable core [2019-05-23 09:49:50,298 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:50,621 INFO L146 ILogger]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:50,621 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:50,621 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-05-23 09:49:50,622 INFO L146 ILogger]: Interpolant automaton has 22 states [2019-05-23 09:49:50,622 INFO L146 ILogger]: Constructing interpolant automaton starting with 22 interpolants. [2019-05-23 09:49:50,622 INFO L146 ILogger]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:49:50,622 INFO L146 ILogger]: Start difference. First operand 42 states and 61 transitions. Second operand 22 states. [2019-05-23 09:49:50,668 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:50,668 INFO L146 ILogger]: Finished difference Result 44 states and 64 transitions. [2019-05-23 09:49:50,669 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-05-23 09:49:50,669 INFO L146 ILogger]: Start accepts. Automaton has 22 states. Word has length 41 [2019-05-23 09:49:50,669 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:50,669 INFO L146 ILogger]: With dead ends: 44 [2019-05-23 09:49:50,670 INFO L146 ILogger]: Without dead ends: 44 [2019-05-23 09:49:50,670 INFO L146 ILogger]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-05-23 09:49:50,671 INFO L146 ILogger]: Start minimizeSevpa. Operand 44 states. [2019-05-23 09:49:50,674 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-05-23 09:49:50,674 INFO L146 ILogger]: Start removeUnreachable. Operand 44 states. [2019-05-23 09:49:50,674 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2019-05-23 09:49:50,675 INFO L146 ILogger]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 41 [2019-05-23 09:49:50,675 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:50,675 INFO L146 ILogger]: Abstraction has 44 states and 64 transitions. [2019-05-23 09:49:50,675 INFO L146 ILogger]: Interpolant automaton has 22 states. [2019-05-23 09:49:50,675 INFO L146 ILogger]: Start isEmpty. Operand 44 states and 64 transitions. [2019-05-23 09:49:50,676 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 44 [2019-05-23 09:49:50,676 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:50,676 INFO L146 ILogger]: trace histogram [20, 20, 1, 1, 1] [2019-05-23 09:49:50,676 INFO L146 ILogger]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:50,676 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:50,677 INFO L146 ILogger]: Analyzing trace with hash 472084047, now seen corresponding path program 20 times [2019-05-23 09:49:50,677 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:50,686 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:50,687 INFO L146 ILogger]: Trace formula consists of 88 conjuncts, 22 conjunts are in the unsatisfiable core [2019-05-23 09:49:50,689 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:50,942 INFO L146 ILogger]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:50,942 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:50,943 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2019-05-23 09:49:50,943 INFO L146 ILogger]: Interpolant automaton has 23 states [2019-05-23 09:49:50,943 INFO L146 ILogger]: Constructing interpolant automaton starting with 23 interpolants. [2019-05-23 09:49:50,944 INFO L146 ILogger]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:49:50,944 INFO L146 ILogger]: Start difference. First operand 44 states and 64 transitions. Second operand 23 states. [2019-05-23 09:49:51,014 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:51,014 INFO L146 ILogger]: Finished difference Result 46 states and 67 transitions. [2019-05-23 09:49:51,015 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-05-23 09:49:51,015 INFO L146 ILogger]: Start accepts. Automaton has 23 states. Word has length 43 [2019-05-23 09:49:51,015 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:51,016 INFO L146 ILogger]: With dead ends: 46 [2019-05-23 09:49:51,016 INFO L146 ILogger]: Without dead ends: 46 [2019-05-23 09:49:51,016 INFO L146 ILogger]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-05-23 09:49:51,017 INFO L146 ILogger]: Start minimizeSevpa. Operand 46 states. [2019-05-23 09:49:51,019 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-05-23 09:49:51,019 INFO L146 ILogger]: Start removeUnreachable. Operand 46 states. [2019-05-23 09:49:51,020 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2019-05-23 09:49:51,020 INFO L146 ILogger]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 43 [2019-05-23 09:49:51,020 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:51,020 INFO L146 ILogger]: Abstraction has 46 states and 67 transitions. [2019-05-23 09:49:51,021 INFO L146 ILogger]: Interpolant automaton has 23 states. [2019-05-23 09:49:51,021 INFO L146 ILogger]: Start isEmpty. Operand 46 states and 67 transitions. [2019-05-23 09:49:51,021 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 46 [2019-05-23 09:49:51,022 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:51,022 INFO L146 ILogger]: trace histogram [21, 21, 1, 1, 1] [2019-05-23 09:49:51,022 INFO L146 ILogger]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:51,022 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:51,022 INFO L146 ILogger]: Analyzing trace with hash -1593794350, now seen corresponding path program 21 times [2019-05-23 09:49:51,023 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:51,035 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:51,036 INFO L146 ILogger]: Trace formula consists of 92 conjuncts, 23 conjunts are in the unsatisfiable core [2019-05-23 09:49:51,045 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:51,308 INFO L146 ILogger]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:51,309 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:51,309 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2019-05-23 09:49:51,309 INFO L146 ILogger]: Interpolant automaton has 24 states [2019-05-23 09:49:51,309 INFO L146 ILogger]: Constructing interpolant automaton starting with 24 interpolants. [2019-05-23 09:49:51,309 INFO L146 ILogger]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:49:51,310 INFO L146 ILogger]: Start difference. First operand 46 states and 67 transitions. Second operand 24 states. [2019-05-23 09:49:51,344 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:51,344 INFO L146 ILogger]: Finished difference Result 48 states and 70 transitions. [2019-05-23 09:49:51,347 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-05-23 09:49:51,347 INFO L146 ILogger]: Start accepts. Automaton has 24 states. Word has length 45 [2019-05-23 09:49:51,347 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:51,347 INFO L146 ILogger]: With dead ends: 48 [2019-05-23 09:49:51,348 INFO L146 ILogger]: Without dead ends: 48 [2019-05-23 09:49:51,348 INFO L146 ILogger]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-05-23 09:49:51,348 INFO L146 ILogger]: Start minimizeSevpa. Operand 48 states. [2019-05-23 09:49:51,350 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-05-23 09:49:51,350 INFO L146 ILogger]: Start removeUnreachable. Operand 48 states. [2019-05-23 09:49:51,351 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2019-05-23 09:49:51,351 INFO L146 ILogger]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 45 [2019-05-23 09:49:51,351 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:51,351 INFO L146 ILogger]: Abstraction has 48 states and 70 transitions. [2019-05-23 09:49:51,351 INFO L146 ILogger]: Interpolant automaton has 24 states. [2019-05-23 09:49:51,351 INFO L146 ILogger]: Start isEmpty. Operand 48 states and 70 transitions. [2019-05-23 09:49:51,352 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 48 [2019-05-23 09:49:51,352 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:51,352 INFO L146 ILogger]: trace histogram [22, 22, 1, 1, 1] [2019-05-23 09:49:51,352 INFO L146 ILogger]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:51,353 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:51,353 INFO L146 ILogger]: Analyzing trace with hash 1666924181, now seen corresponding path program 22 times [2019-05-23 09:49:51,353 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:51,362 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:51,363 INFO L146 ILogger]: Trace formula consists of 96 conjuncts, 24 conjunts are in the unsatisfiable core [2019-05-23 09:49:51,364 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:51,637 INFO L146 ILogger]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:51,637 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:51,637 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2019-05-23 09:49:51,637 INFO L146 ILogger]: Interpolant automaton has 25 states [2019-05-23 09:49:51,638 INFO L146 ILogger]: Constructing interpolant automaton starting with 25 interpolants. [2019-05-23 09:49:51,638 INFO L146 ILogger]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:49:51,638 INFO L146 ILogger]: Start difference. First operand 48 states and 70 transitions. Second operand 25 states. [2019-05-23 09:49:51,668 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:51,668 INFO L146 ILogger]: Finished difference Result 50 states and 73 transitions. [2019-05-23 09:49:51,668 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-05-23 09:49:51,669 INFO L146 ILogger]: Start accepts. Automaton has 25 states. Word has length 47 [2019-05-23 09:49:51,669 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:51,669 INFO L146 ILogger]: With dead ends: 50 [2019-05-23 09:49:51,670 INFO L146 ILogger]: Without dead ends: 50 [2019-05-23 09:49:51,670 INFO L146 ILogger]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2019-05-23 09:49:51,671 INFO L146 ILogger]: Start minimizeSevpa. Operand 50 states. [2019-05-23 09:49:51,673 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-05-23 09:49:51,673 INFO L146 ILogger]: Start removeUnreachable. Operand 50 states. [2019-05-23 09:49:51,674 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 50 states to 50 states and 73 transitions. [2019-05-23 09:49:51,674 INFO L146 ILogger]: Start accepts. Automaton has 50 states and 73 transitions. Word has length 47 [2019-05-23 09:49:51,674 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:51,674 INFO L146 ILogger]: Abstraction has 50 states and 73 transitions. [2019-05-23 09:49:51,674 INFO L146 ILogger]: Interpolant automaton has 25 states. [2019-05-23 09:49:51,674 INFO L146 ILogger]: Start isEmpty. Operand 50 states and 73 transitions. [2019-05-23 09:49:51,675 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 50 [2019-05-23 09:49:51,675 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:51,675 INFO L146 ILogger]: trace histogram [23, 23, 1, 1, 1] [2019-05-23 09:49:51,676 INFO L146 ILogger]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:51,676 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:51,676 INFO L146 ILogger]: Analyzing trace with hash -108693608, now seen corresponding path program 23 times [2019-05-23 09:49:51,677 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:51,685 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:51,686 INFO L146 ILogger]: Trace formula consists of 100 conjuncts, 25 conjunts are in the unsatisfiable core [2019-05-23 09:49:51,687 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:52,140 INFO L146 ILogger]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:52,141 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:52,141 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-05-23 09:49:52,141 INFO L146 ILogger]: Interpolant automaton has 26 states [2019-05-23 09:49:52,141 INFO L146 ILogger]: Constructing interpolant automaton starting with 26 interpolants. [2019-05-23 09:49:52,142 INFO L146 ILogger]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:49:52,142 INFO L146 ILogger]: Start difference. First operand 50 states and 73 transitions. Second operand 26 states. [2019-05-23 09:49:52,177 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:52,178 INFO L146 ILogger]: Finished difference Result 52 states and 76 transitions. [2019-05-23 09:49:52,178 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-05-23 09:49:52,178 INFO L146 ILogger]: Start accepts. Automaton has 26 states. Word has length 49 [2019-05-23 09:49:52,179 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:52,179 INFO L146 ILogger]: With dead ends: 52 [2019-05-23 09:49:52,179 INFO L146 ILogger]: Without dead ends: 52 [2019-05-23 09:49:52,180 INFO L146 ILogger]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-05-23 09:49:52,180 INFO L146 ILogger]: Start minimizeSevpa. Operand 52 states. [2019-05-23 09:49:52,183 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-05-23 09:49:52,183 INFO L146 ILogger]: Start removeUnreachable. Operand 52 states. [2019-05-23 09:49:52,183 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 52 states to 52 states and 76 transitions. [2019-05-23 09:49:52,184 INFO L146 ILogger]: Start accepts. Automaton has 52 states and 76 transitions. Word has length 49 [2019-05-23 09:49:52,184 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:52,184 INFO L146 ILogger]: Abstraction has 52 states and 76 transitions. [2019-05-23 09:49:52,184 INFO L146 ILogger]: Interpolant automaton has 26 states. [2019-05-23 09:49:52,184 INFO L146 ILogger]: Start isEmpty. Operand 52 states and 76 transitions. [2019-05-23 09:49:52,185 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 52 [2019-05-23 09:49:52,185 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:52,185 INFO L146 ILogger]: trace histogram [24, 24, 1, 1, 1] [2019-05-23 09:49:52,185 INFO L146 ILogger]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:52,185 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:52,185 INFO L146 ILogger]: Analyzing trace with hash -1375372325, now seen corresponding path program 24 times [2019-05-23 09:49:52,186 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:52,195 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:52,196 INFO L146 ILogger]: Trace formula consists of 104 conjuncts, 26 conjunts are in the unsatisfiable core [2019-05-23 09:49:52,197 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:53,120 INFO L146 ILogger]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:53,121 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:53,121 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-05-23 09:49:53,121 INFO L146 ILogger]: Interpolant automaton has 27 states [2019-05-23 09:49:53,121 INFO L146 ILogger]: Constructing interpolant automaton starting with 27 interpolants. [2019-05-23 09:49:53,122 INFO L146 ILogger]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:49:53,122 INFO L146 ILogger]: Start difference. First operand 52 states and 76 transitions. Second operand 27 states. [2019-05-23 09:49:53,174 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:53,174 INFO L146 ILogger]: Finished difference Result 54 states and 79 transitions. [2019-05-23 09:49:53,174 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-05-23 09:49:53,174 INFO L146 ILogger]: Start accepts. Automaton has 27 states. Word has length 51 [2019-05-23 09:49:53,174 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:53,175 INFO L146 ILogger]: With dead ends: 54 [2019-05-23 09:49:53,175 INFO L146 ILogger]: Without dead ends: 54 [2019-05-23 09:49:53,176 INFO L146 ILogger]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-05-23 09:49:53,176 INFO L146 ILogger]: Start minimizeSevpa. Operand 54 states. [2019-05-23 09:49:53,177 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-05-23 09:49:53,177 INFO L146 ILogger]: Start removeUnreachable. Operand 54 states. [2019-05-23 09:49:53,178 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 54 states to 54 states and 79 transitions. [2019-05-23 09:49:53,178 INFO L146 ILogger]: Start accepts. Automaton has 54 states and 79 transitions. Word has length 51 [2019-05-23 09:49:53,178 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:53,178 INFO L146 ILogger]: Abstraction has 54 states and 79 transitions. [2019-05-23 09:49:53,178 INFO L146 ILogger]: Interpolant automaton has 27 states. [2019-05-23 09:49:53,178 INFO L146 ILogger]: Start isEmpty. Operand 54 states and 79 transitions. [2019-05-23 09:49:53,179 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 54 [2019-05-23 09:49:53,179 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:53,179 INFO L146 ILogger]: trace histogram [25, 25, 1, 1, 1] [2019-05-23 09:49:53,179 INFO L146 ILogger]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:53,179 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:53,180 INFO L146 ILogger]: Analyzing trace with hash 1117092702, now seen corresponding path program 25 times [2019-05-23 09:49:53,180 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:53,188 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:53,189 INFO L146 ILogger]: Trace formula consists of 108 conjuncts, 27 conjunts are in the unsatisfiable core [2019-05-23 09:49:53,190 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:53,823 INFO L146 ILogger]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:53,823 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:53,824 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-05-23 09:49:53,824 INFO L146 ILogger]: Interpolant automaton has 28 states [2019-05-23 09:49:53,824 INFO L146 ILogger]: Constructing interpolant automaton starting with 28 interpolants. [2019-05-23 09:49:53,825 INFO L146 ILogger]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:49:53,825 INFO L146 ILogger]: Start difference. First operand 54 states and 79 transitions. Second operand 28 states. [2019-05-23 09:49:53,863 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:53,863 INFO L146 ILogger]: Finished difference Result 56 states and 82 transitions. [2019-05-23 09:49:53,863 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-05-23 09:49:53,864 INFO L146 ILogger]: Start accepts. Automaton has 28 states. Word has length 53 [2019-05-23 09:49:53,864 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:53,865 INFO L146 ILogger]: With dead ends: 56 [2019-05-23 09:49:53,865 INFO L146 ILogger]: Without dead ends: 56 [2019-05-23 09:49:53,866 INFO L146 ILogger]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-05-23 09:49:53,866 INFO L146 ILogger]: Start minimizeSevpa. Operand 56 states. [2019-05-23 09:49:53,868 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-05-23 09:49:53,869 INFO L146 ILogger]: Start removeUnreachable. Operand 56 states. [2019-05-23 09:49:53,869 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2019-05-23 09:49:53,869 INFO L146 ILogger]: Start accepts. Automaton has 56 states and 82 transitions. Word has length 53 [2019-05-23 09:49:53,869 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:53,870 INFO L146 ILogger]: Abstraction has 56 states and 82 transitions. [2019-05-23 09:49:53,870 INFO L146 ILogger]: Interpolant automaton has 28 states. [2019-05-23 09:49:53,870 INFO L146 ILogger]: Start isEmpty. Operand 56 states and 82 transitions. [2019-05-23 09:49:53,870 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 56 [2019-05-23 09:49:53,870 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:53,870 INFO L146 ILogger]: trace histogram [26, 26, 1, 1, 1] [2019-05-23 09:49:53,871 INFO L146 ILogger]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:53,871 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:53,871 INFO L146 ILogger]: Analyzing trace with hash -215767519, now seen corresponding path program 26 times [2019-05-23 09:49:53,872 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:53,890 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:53,890 INFO L146 ILogger]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2019-05-23 09:49:53,892 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:54,592 INFO L146 ILogger]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:54,593 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:54,593 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2019-05-23 09:49:54,593 INFO L146 ILogger]: Interpolant automaton has 29 states [2019-05-23 09:49:54,594 INFO L146 ILogger]: Constructing interpolant automaton starting with 29 interpolants. [2019-05-23 09:49:54,594 INFO L146 ILogger]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:49:54,594 INFO L146 ILogger]: Start difference. First operand 56 states and 82 transitions. Second operand 29 states. [2019-05-23 09:49:54,631 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:54,631 INFO L146 ILogger]: Finished difference Result 58 states and 85 transitions. [2019-05-23 09:49:54,631 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-05-23 09:49:54,632 INFO L146 ILogger]: Start accepts. Automaton has 29 states. Word has length 55 [2019-05-23 09:49:54,632 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:54,632 INFO L146 ILogger]: With dead ends: 58 [2019-05-23 09:49:54,633 INFO L146 ILogger]: Without dead ends: 58 [2019-05-23 09:49:54,633 INFO L146 ILogger]: 0 DeclaredPredicates, 54 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-05-23 09:49:54,634 INFO L146 ILogger]: Start minimizeSevpa. Operand 58 states. [2019-05-23 09:49:54,635 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-05-23 09:49:54,636 INFO L146 ILogger]: Start removeUnreachable. Operand 58 states. [2019-05-23 09:49:54,636 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 58 states to 58 states and 85 transitions. [2019-05-23 09:49:54,636 INFO L146 ILogger]: Start accepts. Automaton has 58 states and 85 transitions. Word has length 55 [2019-05-23 09:49:54,636 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:54,636 INFO L146 ILogger]: Abstraction has 58 states and 85 transitions. [2019-05-23 09:49:54,637 INFO L146 ILogger]: Interpolant automaton has 29 states. [2019-05-23 09:49:54,637 INFO L146 ILogger]: Start isEmpty. Operand 58 states and 85 transitions. [2019-05-23 09:49:54,637 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 58 [2019-05-23 09:49:54,637 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:54,637 INFO L146 ILogger]: trace histogram [27, 27, 1, 1, 1] [2019-05-23 09:49:54,637 INFO L146 ILogger]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:54,638 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:54,638 INFO L146 ILogger]: Analyzing trace with hash -1194185692, now seen corresponding path program 27 times [2019-05-23 09:49:54,638 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:54,646 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:54,647 INFO L146 ILogger]: Trace formula consists of 116 conjuncts, 29 conjunts are in the unsatisfiable core [2019-05-23 09:49:54,648 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:54,980 INFO L146 ILogger]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:54,981 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:54,981 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2019-05-23 09:49:54,981 INFO L146 ILogger]: Interpolant automaton has 30 states [2019-05-23 09:49:54,981 INFO L146 ILogger]: Constructing interpolant automaton starting with 30 interpolants. [2019-05-23 09:49:54,982 INFO L146 ILogger]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:49:54,982 INFO L146 ILogger]: Start difference. First operand 58 states and 85 transitions. Second operand 30 states. [2019-05-23 09:49:55,019 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:55,020 INFO L146 ILogger]: Finished difference Result 60 states and 88 transitions. [2019-05-23 09:49:55,020 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-05-23 09:49:55,020 INFO L146 ILogger]: Start accepts. Automaton has 30 states. Word has length 57 [2019-05-23 09:49:55,020 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:55,021 INFO L146 ILogger]: With dead ends: 60 [2019-05-23 09:49:55,021 INFO L146 ILogger]: Without dead ends: 60 [2019-05-23 09:49:55,022 INFO L146 ILogger]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-05-23 09:49:55,022 INFO L146 ILogger]: Start minimizeSevpa. Operand 60 states. [2019-05-23 09:49:55,024 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-05-23 09:49:55,024 INFO L146 ILogger]: Start removeUnreachable. Operand 60 states. [2019-05-23 09:49:55,024 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 60 states to 60 states and 88 transitions. [2019-05-23 09:49:55,025 INFO L146 ILogger]: Start accepts. Automaton has 60 states and 88 transitions. Word has length 57 [2019-05-23 09:49:55,025 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:55,025 INFO L146 ILogger]: Abstraction has 60 states and 88 transitions. [2019-05-23 09:49:55,025 INFO L146 ILogger]: Interpolant automaton has 30 states. [2019-05-23 09:49:55,025 INFO L146 ILogger]: Start isEmpty. Operand 60 states and 88 transitions. [2019-05-23 09:49:55,026 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 60 [2019-05-23 09:49:55,026 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:55,026 INFO L146 ILogger]: trace histogram [28, 28, 1, 1, 1] [2019-05-23 09:49:55,026 INFO L146 ILogger]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:55,026 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:55,026 INFO L146 ILogger]: Analyzing trace with hash -856212121, now seen corresponding path program 28 times [2019-05-23 09:49:55,027 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:55,035 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:55,036 INFO L146 ILogger]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-05-23 09:49:55,037 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:55,390 INFO L146 ILogger]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:55,391 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:55,391 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2019-05-23 09:49:55,391 INFO L146 ILogger]: Interpolant automaton has 31 states [2019-05-23 09:49:55,391 INFO L146 ILogger]: Constructing interpolant automaton starting with 31 interpolants. [2019-05-23 09:49:55,392 INFO L146 ILogger]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:49:55,392 INFO L146 ILogger]: Start difference. First operand 60 states and 88 transitions. Second operand 31 states. [2019-05-23 09:49:55,442 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:55,442 INFO L146 ILogger]: Finished difference Result 62 states and 91 transitions. [2019-05-23 09:49:55,442 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-05-23 09:49:55,443 INFO L146 ILogger]: Start accepts. Automaton has 31 states. Word has length 59 [2019-05-23 09:49:55,443 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:55,443 INFO L146 ILogger]: With dead ends: 62 [2019-05-23 09:49:55,444 INFO L146 ILogger]: Without dead ends: 62 [2019-05-23 09:49:55,444 INFO L146 ILogger]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-05-23 09:49:55,445 INFO L146 ILogger]: Start minimizeSevpa. Operand 62 states. [2019-05-23 09:49:55,447 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-05-23 09:49:55,447 INFO L146 ILogger]: Start removeUnreachable. Operand 62 states. [2019-05-23 09:49:55,447 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2019-05-23 09:49:55,447 INFO L146 ILogger]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 59 [2019-05-23 09:49:55,447 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:55,447 INFO L146 ILogger]: Abstraction has 62 states and 91 transitions. [2019-05-23 09:49:55,447 INFO L146 ILogger]: Interpolant automaton has 31 states. [2019-05-23 09:49:55,448 INFO L146 ILogger]: Start isEmpty. Operand 62 states and 91 transitions. [2019-05-23 09:49:55,448 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 62 [2019-05-23 09:49:55,448 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:55,448 INFO L146 ILogger]: trace histogram [29, 29, 1, 1, 1] [2019-05-23 09:49:55,448 INFO L146 ILogger]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:55,449 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:55,449 INFO L146 ILogger]: Analyzing trace with hash 1813842410, now seen corresponding path program 29 times [2019-05-23 09:49:55,449 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:55,458 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:55,459 INFO L146 ILogger]: Trace formula consists of 124 conjuncts, 31 conjunts are in the unsatisfiable core [2019-05-23 09:49:55,460 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:55,861 INFO L146 ILogger]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:55,862 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:55,862 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2019-05-23 09:49:55,862 INFO L146 ILogger]: Interpolant automaton has 32 states [2019-05-23 09:49:55,862 INFO L146 ILogger]: Constructing interpolant automaton starting with 32 interpolants. [2019-05-23 09:49:55,863 INFO L146 ILogger]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:49:55,863 INFO L146 ILogger]: Start difference. First operand 62 states and 91 transitions. Second operand 32 states. [2019-05-23 09:49:55,977 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:55,977 INFO L146 ILogger]: Finished difference Result 64 states and 94 transitions. [2019-05-23 09:49:55,978 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-05-23 09:49:55,978 INFO L146 ILogger]: Start accepts. Automaton has 32 states. Word has length 61 [2019-05-23 09:49:55,978 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:55,979 INFO L146 ILogger]: With dead ends: 64 [2019-05-23 09:49:55,979 INFO L146 ILogger]: Without dead ends: 64 [2019-05-23 09:49:55,980 INFO L146 ILogger]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-05-23 09:49:55,980 INFO L146 ILogger]: Start minimizeSevpa. Operand 64 states. [2019-05-23 09:49:55,981 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-05-23 09:49:55,982 INFO L146 ILogger]: Start removeUnreachable. Operand 64 states. [2019-05-23 09:49:55,982 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 64 states to 64 states and 94 transitions. [2019-05-23 09:49:55,982 INFO L146 ILogger]: Start accepts. Automaton has 64 states and 94 transitions. Word has length 61 [2019-05-23 09:49:55,982 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:55,982 INFO L146 ILogger]: Abstraction has 64 states and 94 transitions. [2019-05-23 09:49:55,983 INFO L146 ILogger]: Interpolant automaton has 32 states. [2019-05-23 09:49:55,983 INFO L146 ILogger]: Start isEmpty. Operand 64 states and 94 transitions. [2019-05-23 09:49:55,983 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 64 [2019-05-23 09:49:55,983 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:55,983 INFO L146 ILogger]: trace histogram [30, 30, 1, 1, 1] [2019-05-23 09:49:55,984 INFO L146 ILogger]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:55,984 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:55,984 INFO L146 ILogger]: Analyzing trace with hash -654196307, now seen corresponding path program 30 times [2019-05-23 09:49:55,984 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:55,993 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:55,994 INFO L146 ILogger]: Trace formula consists of 128 conjuncts, 32 conjunts are in the unsatisfiable core [2019-05-23 09:49:55,995 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:56,378 INFO L146 ILogger]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:56,379 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:56,379 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2019-05-23 09:49:56,379 INFO L146 ILogger]: Interpolant automaton has 33 states [2019-05-23 09:49:56,379 INFO L146 ILogger]: Constructing interpolant automaton starting with 33 interpolants. [2019-05-23 09:49:56,380 INFO L146 ILogger]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:49:56,380 INFO L146 ILogger]: Start difference. First operand 64 states and 94 transitions. Second operand 33 states. [2019-05-23 09:49:56,632 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:56,632 INFO L146 ILogger]: Finished difference Result 66 states and 97 transitions. [2019-05-23 09:49:56,637 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-05-23 09:49:56,637 INFO L146 ILogger]: Start accepts. Automaton has 33 states. Word has length 63 [2019-05-23 09:49:56,637 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:56,638 INFO L146 ILogger]: With dead ends: 66 [2019-05-23 09:49:56,638 INFO L146 ILogger]: Without dead ends: 66 [2019-05-23 09:49:56,638 INFO L146 ILogger]: 0 DeclaredPredicates, 62 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-05-23 09:49:56,639 INFO L146 ILogger]: Start minimizeSevpa. Operand 66 states. [2019-05-23 09:49:56,640 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-05-23 09:49:56,640 INFO L146 ILogger]: Start removeUnreachable. Operand 66 states. [2019-05-23 09:49:56,640 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 66 states to 66 states and 97 transitions. [2019-05-23 09:49:56,640 INFO L146 ILogger]: Start accepts. Automaton has 66 states and 97 transitions. Word has length 63 [2019-05-23 09:49:56,640 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:56,641 INFO L146 ILogger]: Abstraction has 66 states and 97 transitions. [2019-05-23 09:49:56,641 INFO L146 ILogger]: Interpolant automaton has 33 states. [2019-05-23 09:49:56,641 INFO L146 ILogger]: Start isEmpty. Operand 66 states and 97 transitions. [2019-05-23 09:49:56,641 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 66 [2019-05-23 09:49:56,641 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:56,641 INFO L146 ILogger]: trace histogram [31, 31, 1, 1, 1] [2019-05-23 09:49:56,642 INFO L146 ILogger]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:56,642 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:56,642 INFO L146 ILogger]: Analyzing trace with hash -1617455952, now seen corresponding path program 31 times [2019-05-23 09:49:56,643 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:56,652 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:56,653 INFO L146 ILogger]: Trace formula consists of 132 conjuncts, 33 conjunts are in the unsatisfiable core [2019-05-23 09:49:56,654 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:57,092 INFO L146 ILogger]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:57,092 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:57,092 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2019-05-23 09:49:57,093 INFO L146 ILogger]: Interpolant automaton has 34 states [2019-05-23 09:49:57,093 INFO L146 ILogger]: Constructing interpolant automaton starting with 34 interpolants. [2019-05-23 09:49:57,094 INFO L146 ILogger]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:49:57,094 INFO L146 ILogger]: Start difference. First operand 66 states and 97 transitions. Second operand 34 states. [2019-05-23 09:49:57,145 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:57,145 INFO L146 ILogger]: Finished difference Result 68 states and 100 transitions. [2019-05-23 09:49:57,146 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-05-23 09:49:57,146 INFO L146 ILogger]: Start accepts. Automaton has 34 states. Word has length 65 [2019-05-23 09:49:57,146 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:57,147 INFO L146 ILogger]: With dead ends: 68 [2019-05-23 09:49:57,147 INFO L146 ILogger]: Without dead ends: 68 [2019-05-23 09:49:57,148 INFO L146 ILogger]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-05-23 09:49:57,148 INFO L146 ILogger]: Start minimizeSevpa. Operand 68 states. [2019-05-23 09:49:57,150 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-05-23 09:49:57,150 INFO L146 ILogger]: Start removeUnreachable. Operand 68 states. [2019-05-23 09:49:57,150 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 68 states to 68 states and 100 transitions. [2019-05-23 09:49:57,151 INFO L146 ILogger]: Start accepts. Automaton has 68 states and 100 transitions. Word has length 65 [2019-05-23 09:49:57,151 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:57,151 INFO L146 ILogger]: Abstraction has 68 states and 100 transitions. [2019-05-23 09:49:57,151 INFO L146 ILogger]: Interpolant automaton has 34 states. [2019-05-23 09:49:57,151 INFO L146 ILogger]: Start isEmpty. Operand 68 states and 100 transitions. [2019-05-23 09:49:57,151 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 68 [2019-05-23 09:49:57,152 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:57,152 INFO L146 ILogger]: trace histogram [32, 32, 1, 1, 1] [2019-05-23 09:49:57,152 INFO L146 ILogger]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:57,152 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:57,152 INFO L146 ILogger]: Analyzing trace with hash 402961139, now seen corresponding path program 32 times [2019-05-23 09:49:57,153 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:57,161 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:57,162 INFO L146 ILogger]: Trace formula consists of 136 conjuncts, 34 conjunts are in the unsatisfiable core [2019-05-23 09:49:57,164 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:57,671 INFO L146 ILogger]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:57,672 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:57,672 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-05-23 09:49:57,672 INFO L146 ILogger]: Interpolant automaton has 35 states [2019-05-23 09:49:57,673 INFO L146 ILogger]: Constructing interpolant automaton starting with 35 interpolants. [2019-05-23 09:49:57,673 INFO L146 ILogger]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:49:57,673 INFO L146 ILogger]: Start difference. First operand 68 states and 100 transitions. Second operand 35 states. [2019-05-23 09:49:57,717 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:57,718 INFO L146 ILogger]: Finished difference Result 70 states and 103 transitions. [2019-05-23 09:49:57,718 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-05-23 09:49:57,718 INFO L146 ILogger]: Start accepts. Automaton has 35 states. Word has length 67 [2019-05-23 09:49:57,718 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:57,719 INFO L146 ILogger]: With dead ends: 70 [2019-05-23 09:49:57,719 INFO L146 ILogger]: Without dead ends: 70 [2019-05-23 09:49:57,720 INFO L146 ILogger]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-05-23 09:49:57,721 INFO L146 ILogger]: Start minimizeSevpa. Operand 70 states. [2019-05-23 09:49:57,722 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-05-23 09:49:57,722 INFO L146 ILogger]: Start removeUnreachable. Operand 70 states. [2019-05-23 09:49:57,723 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 70 states to 70 states and 103 transitions. [2019-05-23 09:49:57,723 INFO L146 ILogger]: Start accepts. Automaton has 70 states and 103 transitions. Word has length 67 [2019-05-23 09:49:57,723 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:57,723 INFO L146 ILogger]: Abstraction has 70 states and 103 transitions. [2019-05-23 09:49:57,723 INFO L146 ILogger]: Interpolant automaton has 35 states. [2019-05-23 09:49:57,724 INFO L146 ILogger]: Start isEmpty. Operand 70 states and 103 transitions. [2019-05-23 09:49:57,724 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 70 [2019-05-23 09:49:57,724 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:57,724 INFO L146 ILogger]: trace histogram [33, 33, 1, 1, 1] [2019-05-23 09:49:57,724 INFO L146 ILogger]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:57,724 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:57,724 INFO L146 ILogger]: Analyzing trace with hash 698567798, now seen corresponding path program 33 times [2019-05-23 09:49:57,725 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:57,733 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:57,734 INFO L146 ILogger]: Trace formula consists of 140 conjuncts, 35 conjunts are in the unsatisfiable core [2019-05-23 09:49:57,735 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:59,125 INFO L146 ILogger]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:59,125 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:59,125 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-05-23 09:49:59,126 INFO L146 ILogger]: Interpolant automaton has 36 states [2019-05-23 09:49:59,126 INFO L146 ILogger]: Constructing interpolant automaton starting with 36 interpolants. [2019-05-23 09:49:59,126 INFO L146 ILogger]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:49:59,126 INFO L146 ILogger]: Start difference. First operand 70 states and 103 transitions. Second operand 36 states. [2019-05-23 09:49:59,173 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:59,174 INFO L146 ILogger]: Finished difference Result 72 states and 106 transitions. [2019-05-23 09:49:59,174 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-05-23 09:49:59,174 INFO L146 ILogger]: Start accepts. Automaton has 36 states. Word has length 69 [2019-05-23 09:49:59,175 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:59,175 INFO L146 ILogger]: With dead ends: 72 [2019-05-23 09:49:59,175 INFO L146 ILogger]: Without dead ends: 72 [2019-05-23 09:49:59,176 INFO L146 ILogger]: 0 DeclaredPredicates, 68 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-05-23 09:49:59,176 INFO L146 ILogger]: Start minimizeSevpa. Operand 72 states. [2019-05-23 09:49:59,177 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-05-23 09:49:59,177 INFO L146 ILogger]: Start removeUnreachable. Operand 72 states. [2019-05-23 09:49:59,178 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 72 states to 72 states and 106 transitions. [2019-05-23 09:49:59,178 INFO L146 ILogger]: Start accepts. Automaton has 72 states and 106 transitions. Word has length 69 [2019-05-23 09:49:59,178 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:59,178 INFO L146 ILogger]: Abstraction has 72 states and 106 transitions. [2019-05-23 09:49:59,178 INFO L146 ILogger]: Interpolant automaton has 36 states. [2019-05-23 09:49:59,178 INFO L146 ILogger]: Start isEmpty. Operand 72 states and 106 transitions. [2019-05-23 09:49:59,178 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 72 [2019-05-23 09:49:59,179 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:59,179 INFO L146 ILogger]: trace histogram [34, 34, 1, 1, 1] [2019-05-23 09:49:59,179 INFO L146 ILogger]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:59,179 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:59,179 INFO L146 ILogger]: Analyzing trace with hash 1308725561, now seen corresponding path program 34 times [2019-05-23 09:49:59,180 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:59,189 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:59,190 INFO L146 ILogger]: Trace formula consists of 144 conjuncts, 36 conjunts are in the unsatisfiable core [2019-05-23 09:49:59,191 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:49:59,788 INFO L146 ILogger]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:49:59,788 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:49:59,788 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2019-05-23 09:49:59,788 INFO L146 ILogger]: Interpolant automaton has 37 states [2019-05-23 09:49:59,789 INFO L146 ILogger]: Constructing interpolant automaton starting with 37 interpolants. [2019-05-23 09:49:59,789 INFO L146 ILogger]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:49:59,789 INFO L146 ILogger]: Start difference. First operand 72 states and 106 transitions. Second operand 37 states. [2019-05-23 09:49:59,838 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:49:59,838 INFO L146 ILogger]: Finished difference Result 74 states and 109 transitions. [2019-05-23 09:49:59,845 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-05-23 09:49:59,845 INFO L146 ILogger]: Start accepts. Automaton has 37 states. Word has length 71 [2019-05-23 09:49:59,845 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:49:59,846 INFO L146 ILogger]: With dead ends: 74 [2019-05-23 09:49:59,846 INFO L146 ILogger]: Without dead ends: 74 [2019-05-23 09:49:59,846 INFO L146 ILogger]: 0 DeclaredPredicates, 70 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2019-05-23 09:49:59,847 INFO L146 ILogger]: Start minimizeSevpa. Operand 74 states. [2019-05-23 09:49:59,848 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-05-23 09:49:59,849 INFO L146 ILogger]: Start removeUnreachable. Operand 74 states. [2019-05-23 09:49:59,849 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-05-23 09:49:59,849 INFO L146 ILogger]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 71 [2019-05-23 09:49:59,849 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:49:59,849 INFO L146 ILogger]: Abstraction has 74 states and 109 transitions. [2019-05-23 09:49:59,850 INFO L146 ILogger]: Interpolant automaton has 37 states. [2019-05-23 09:49:59,850 INFO L146 ILogger]: Start isEmpty. Operand 74 states and 109 transitions. [2019-05-23 09:49:59,850 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 74 [2019-05-23 09:49:59,850 INFO L146 ILogger]: Found error trace [2019-05-23 09:49:59,850 INFO L146 ILogger]: trace histogram [35, 35, 1, 1, 1] [2019-05-23 09:49:59,851 INFO L146 ILogger]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:49:59,851 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:49:59,851 INFO L146 ILogger]: Analyzing trace with hash -740183748, now seen corresponding path program 35 times [2019-05-23 09:49:59,851 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:49:59,860 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:49:59,861 INFO L146 ILogger]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2019-05-23 09:49:59,863 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:00,719 INFO L146 ILogger]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:00,719 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:00,720 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2019-05-23 09:50:00,720 INFO L146 ILogger]: Interpolant automaton has 38 states [2019-05-23 09:50:00,720 INFO L146 ILogger]: Constructing interpolant automaton starting with 38 interpolants. [2019-05-23 09:50:00,721 INFO L146 ILogger]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:50:00,721 INFO L146 ILogger]: Start difference. First operand 74 states and 109 transitions. Second operand 38 states. [2019-05-23 09:50:00,810 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:00,811 INFO L146 ILogger]: Finished difference Result 76 states and 112 transitions. [2019-05-23 09:50:00,811 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-05-23 09:50:00,811 INFO L146 ILogger]: Start accepts. Automaton has 38 states. Word has length 73 [2019-05-23 09:50:00,812 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:00,812 INFO L146 ILogger]: With dead ends: 76 [2019-05-23 09:50:00,812 INFO L146 ILogger]: Without dead ends: 76 [2019-05-23 09:50:00,813 INFO L146 ILogger]: 0 DeclaredPredicates, 72 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-05-23 09:50:00,814 INFO L146 ILogger]: Start minimizeSevpa. Operand 76 states. [2019-05-23 09:50:00,815 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-05-23 09:50:00,815 INFO L146 ILogger]: Start removeUnreachable. Operand 76 states. [2019-05-23 09:50:00,815 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 76 states to 76 states and 112 transitions. [2019-05-23 09:50:00,816 INFO L146 ILogger]: Start accepts. Automaton has 76 states and 112 transitions. Word has length 73 [2019-05-23 09:50:00,816 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:00,816 INFO L146 ILogger]: Abstraction has 76 states and 112 transitions. [2019-05-23 09:50:00,816 INFO L146 ILogger]: Interpolant automaton has 38 states. [2019-05-23 09:50:00,816 INFO L146 ILogger]: Start isEmpty. Operand 76 states and 112 transitions. [2019-05-23 09:50:00,816 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 76 [2019-05-23 09:50:00,817 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:00,817 INFO L146 ILogger]: trace histogram [36, 36, 1, 1, 1] [2019-05-23 09:50:00,817 INFO L146 ILogger]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:00,817 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:00,817 INFO L146 ILogger]: Analyzing trace with hash 1647959167, now seen corresponding path program 36 times [2019-05-23 09:50:00,818 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:00,826 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:00,827 INFO L146 ILogger]: Trace formula consists of 152 conjuncts, 38 conjunts are in the unsatisfiable core [2019-05-23 09:50:00,828 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:01,317 INFO L146 ILogger]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:01,318 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:01,318 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2019-05-23 09:50:01,318 INFO L146 ILogger]: Interpolant automaton has 39 states [2019-05-23 09:50:01,319 INFO L146 ILogger]: Constructing interpolant automaton starting with 39 interpolants. [2019-05-23 09:50:01,319 INFO L146 ILogger]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:50:01,319 INFO L146 ILogger]: Start difference. First operand 76 states and 112 transitions. Second operand 39 states. [2019-05-23 09:50:01,387 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:01,388 INFO L146 ILogger]: Finished difference Result 78 states and 115 transitions. [2019-05-23 09:50:01,388 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-05-23 09:50:01,388 INFO L146 ILogger]: Start accepts. Automaton has 39 states. Word has length 75 [2019-05-23 09:50:01,388 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:01,389 INFO L146 ILogger]: With dead ends: 78 [2019-05-23 09:50:01,389 INFO L146 ILogger]: Without dead ends: 78 [2019-05-23 09:50:01,389 INFO L146 ILogger]: 0 DeclaredPredicates, 74 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2019-05-23 09:50:01,390 INFO L146 ILogger]: Start minimizeSevpa. Operand 78 states. [2019-05-23 09:50:01,391 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-05-23 09:50:01,391 INFO L146 ILogger]: Start removeUnreachable. Operand 78 states. [2019-05-23 09:50:01,391 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 78 states to 78 states and 115 transitions. [2019-05-23 09:50:01,391 INFO L146 ILogger]: Start accepts. Automaton has 78 states and 115 transitions. Word has length 75 [2019-05-23 09:50:01,392 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:01,392 INFO L146 ILogger]: Abstraction has 78 states and 115 transitions. [2019-05-23 09:50:01,392 INFO L146 ILogger]: Interpolant automaton has 39 states. [2019-05-23 09:50:01,392 INFO L146 ILogger]: Start isEmpty. Operand 78 states and 115 transitions. [2019-05-23 09:50:01,392 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 78 [2019-05-23 09:50:01,393 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:01,393 INFO L146 ILogger]: trace histogram [37, 37, 1, 1, 1] [2019-05-23 09:50:01,393 INFO L146 ILogger]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:01,393 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:01,393 INFO L146 ILogger]: Analyzing trace with hash -1154202878, now seen corresponding path program 37 times [2019-05-23 09:50:01,394 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:01,402 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:01,403 INFO L146 ILogger]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-05-23 09:50:01,405 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:02,121 INFO L146 ILogger]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:02,121 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:02,121 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2019-05-23 09:50:02,122 INFO L146 ILogger]: Interpolant automaton has 40 states [2019-05-23 09:50:02,122 INFO L146 ILogger]: Constructing interpolant automaton starting with 40 interpolants. [2019-05-23 09:50:02,122 INFO L146 ILogger]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:50:02,122 INFO L146 ILogger]: Start difference. First operand 78 states and 115 transitions. Second operand 40 states. [2019-05-23 09:50:02,180 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:02,181 INFO L146 ILogger]: Finished difference Result 80 states and 118 transitions. [2019-05-23 09:50:02,181 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-05-23 09:50:02,181 INFO L146 ILogger]: Start accepts. Automaton has 40 states. Word has length 77 [2019-05-23 09:50:02,181 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:02,182 INFO L146 ILogger]: With dead ends: 80 [2019-05-23 09:50:02,182 INFO L146 ILogger]: Without dead ends: 80 [2019-05-23 09:50:02,183 INFO L146 ILogger]: 0 DeclaredPredicates, 76 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-05-23 09:50:02,183 INFO L146 ILogger]: Start minimizeSevpa. Operand 80 states. [2019-05-23 09:50:02,185 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-05-23 09:50:02,185 INFO L146 ILogger]: Start removeUnreachable. Operand 80 states. [2019-05-23 09:50:02,185 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 80 states to 80 states and 118 transitions. [2019-05-23 09:50:02,186 INFO L146 ILogger]: Start accepts. Automaton has 80 states and 118 transitions. Word has length 77 [2019-05-23 09:50:02,186 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:02,186 INFO L146 ILogger]: Abstraction has 80 states and 118 transitions. [2019-05-23 09:50:02,186 INFO L146 ILogger]: Interpolant automaton has 40 states. [2019-05-23 09:50:02,186 INFO L146 ILogger]: Start isEmpty. Operand 80 states and 118 transitions. [2019-05-23 09:50:02,186 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 80 [2019-05-23 09:50:02,186 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:02,186 INFO L146 ILogger]: trace histogram [38, 38, 1, 1, 1] [2019-05-23 09:50:02,187 INFO L146 ILogger]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:02,187 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:02,187 INFO L146 ILogger]: Analyzing trace with hash -1087433531, now seen corresponding path program 38 times [2019-05-23 09:50:02,187 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:02,196 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:02,197 INFO L146 ILogger]: Trace formula consists of 160 conjuncts, 40 conjunts are in the unsatisfiable core [2019-05-23 09:50:02,198 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:02,828 INFO L146 ILogger]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:02,829 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:02,829 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2019-05-23 09:50:02,829 INFO L146 ILogger]: Interpolant automaton has 41 states [2019-05-23 09:50:02,829 INFO L146 ILogger]: Constructing interpolant automaton starting with 41 interpolants. [2019-05-23 09:50:02,830 INFO L146 ILogger]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:50:02,830 INFO L146 ILogger]: Start difference. First operand 80 states and 118 transitions. Second operand 41 states. [2019-05-23 09:50:02,892 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:02,893 INFO L146 ILogger]: Finished difference Result 82 states and 121 transitions. [2019-05-23 09:50:02,893 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-05-23 09:50:02,893 INFO L146 ILogger]: Start accepts. Automaton has 41 states. Word has length 79 [2019-05-23 09:50:02,893 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:02,894 INFO L146 ILogger]: With dead ends: 82 [2019-05-23 09:50:02,894 INFO L146 ILogger]: Without dead ends: 82 [2019-05-23 09:50:02,896 INFO L146 ILogger]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2019-05-23 09:50:02,896 INFO L146 ILogger]: Start minimizeSevpa. Operand 82 states. [2019-05-23 09:50:02,897 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-05-23 09:50:02,898 INFO L146 ILogger]: Start removeUnreachable. Operand 82 states. [2019-05-23 09:50:02,898 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2019-05-23 09:50:02,898 INFO L146 ILogger]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 79 [2019-05-23 09:50:02,898 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:02,898 INFO L146 ILogger]: Abstraction has 82 states and 121 transitions. [2019-05-23 09:50:02,898 INFO L146 ILogger]: Interpolant automaton has 41 states. [2019-05-23 09:50:02,899 INFO L146 ILogger]: Start isEmpty. Operand 82 states and 121 transitions. [2019-05-23 09:50:02,899 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 82 [2019-05-23 09:50:02,899 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:02,899 INFO L146 ILogger]: trace histogram [39, 39, 1, 1, 1] [2019-05-23 09:50:02,899 INFO L146 ILogger]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:02,900 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:02,900 INFO L146 ILogger]: Analyzing trace with hash -1346600504, now seen corresponding path program 39 times [2019-05-23 09:50:02,900 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:02,910 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:02,911 INFO L146 ILogger]: Trace formula consists of 164 conjuncts, 41 conjunts are in the unsatisfiable core [2019-05-23 09:50:02,912 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:03,572 INFO L146 ILogger]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:03,573 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:03,573 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2019-05-23 09:50:03,573 INFO L146 ILogger]: Interpolant automaton has 42 states [2019-05-23 09:50:03,573 INFO L146 ILogger]: Constructing interpolant automaton starting with 42 interpolants. [2019-05-23 09:50:03,574 INFO L146 ILogger]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:50:03,574 INFO L146 ILogger]: Start difference. First operand 82 states and 121 transitions. Second operand 42 states. [2019-05-23 09:50:03,635 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:03,635 INFO L146 ILogger]: Finished difference Result 84 states and 124 transitions. [2019-05-23 09:50:03,636 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-05-23 09:50:03,636 INFO L146 ILogger]: Start accepts. Automaton has 42 states. Word has length 81 [2019-05-23 09:50:03,636 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:03,637 INFO L146 ILogger]: With dead ends: 84 [2019-05-23 09:50:03,637 INFO L146 ILogger]: Without dead ends: 84 [2019-05-23 09:50:03,638 INFO L146 ILogger]: 0 DeclaredPredicates, 80 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-05-23 09:50:03,638 INFO L146 ILogger]: Start minimizeSevpa. Operand 84 states. [2019-05-23 09:50:03,640 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-05-23 09:50:03,640 INFO L146 ILogger]: Start removeUnreachable. Operand 84 states. [2019-05-23 09:50:03,641 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2019-05-23 09:50:03,641 INFO L146 ILogger]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 81 [2019-05-23 09:50:03,641 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:03,641 INFO L146 ILogger]: Abstraction has 84 states and 124 transitions. [2019-05-23 09:50:03,641 INFO L146 ILogger]: Interpolant automaton has 42 states. [2019-05-23 09:50:03,641 INFO L146 ILogger]: Start isEmpty. Operand 84 states and 124 transitions. [2019-05-23 09:50:03,642 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 84 [2019-05-23 09:50:03,642 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:03,642 INFO L146 ILogger]: trace histogram [40, 40, 1, 1, 1] [2019-05-23 09:50:03,642 INFO L146 ILogger]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:03,642 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:03,642 INFO L146 ILogger]: Analyzing trace with hash -1297958389, now seen corresponding path program 40 times [2019-05-23 09:50:03,643 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:03,652 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:03,653 INFO L146 ILogger]: Trace formula consists of 168 conjuncts, 42 conjunts are in the unsatisfiable core [2019-05-23 09:50:03,654 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:04,305 INFO L146 ILogger]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:04,305 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:04,305 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-05-23 09:50:04,306 INFO L146 ILogger]: Interpolant automaton has 43 states [2019-05-23 09:50:04,306 INFO L146 ILogger]: Constructing interpolant automaton starting with 43 interpolants. [2019-05-23 09:50:04,307 INFO L146 ILogger]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:50:04,307 INFO L146 ILogger]: Start difference. First operand 84 states and 124 transitions. Second operand 43 states. [2019-05-23 09:50:04,382 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:04,382 INFO L146 ILogger]: Finished difference Result 86 states and 127 transitions. [2019-05-23 09:50:04,382 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-05-23 09:50:04,382 INFO L146 ILogger]: Start accepts. Automaton has 43 states. Word has length 83 [2019-05-23 09:50:04,383 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:04,383 INFO L146 ILogger]: With dead ends: 86 [2019-05-23 09:50:04,383 INFO L146 ILogger]: Without dead ends: 86 [2019-05-23 09:50:04,384 INFO L146 ILogger]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2019-05-23 09:50:04,385 INFO L146 ILogger]: Start minimizeSevpa. Operand 86 states. [2019-05-23 09:50:04,386 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-05-23 09:50:04,386 INFO L146 ILogger]: Start removeUnreachable. Operand 86 states. [2019-05-23 09:50:04,387 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2019-05-23 09:50:04,387 INFO L146 ILogger]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 83 [2019-05-23 09:50:04,387 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:04,387 INFO L146 ILogger]: Abstraction has 86 states and 127 transitions. [2019-05-23 09:50:04,387 INFO L146 ILogger]: Interpolant automaton has 43 states. [2019-05-23 09:50:04,388 INFO L146 ILogger]: Start isEmpty. Operand 86 states and 127 transitions. [2019-05-23 09:50:04,388 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 86 [2019-05-23 09:50:04,388 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:04,388 INFO L146 ILogger]: trace histogram [41, 41, 1, 1, 1] [2019-05-23 09:50:04,389 INFO L146 ILogger]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:04,389 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:04,389 INFO L146 ILogger]: Analyzing trace with hash -1797526130, now seen corresponding path program 41 times [2019-05-23 09:50:04,389 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:04,398 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:04,399 INFO L146 ILogger]: Trace formula consists of 172 conjuncts, 43 conjunts are in the unsatisfiable core [2019-05-23 09:50:04,401 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:05,083 INFO L146 ILogger]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:05,084 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:05,084 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-05-23 09:50:05,084 INFO L146 ILogger]: Interpolant automaton has 44 states [2019-05-23 09:50:05,084 INFO L146 ILogger]: Constructing interpolant automaton starting with 44 interpolants. [2019-05-23 09:50:05,085 INFO L146 ILogger]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:50:05,085 INFO L146 ILogger]: Start difference. First operand 86 states and 127 transitions. Second operand 44 states. [2019-05-23 09:50:05,229 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:05,229 INFO L146 ILogger]: Finished difference Result 88 states and 130 transitions. [2019-05-23 09:50:05,230 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-05-23 09:50:05,230 INFO L146 ILogger]: Start accepts. Automaton has 44 states. Word has length 85 [2019-05-23 09:50:05,230 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:05,231 INFO L146 ILogger]: With dead ends: 88 [2019-05-23 09:50:05,231 INFO L146 ILogger]: Without dead ends: 88 [2019-05-23 09:50:05,232 INFO L146 ILogger]: 0 DeclaredPredicates, 84 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-05-23 09:50:05,232 INFO L146 ILogger]: Start minimizeSevpa. Operand 88 states. [2019-05-23 09:50:05,234 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-05-23 09:50:05,234 INFO L146 ILogger]: Start removeUnreachable. Operand 88 states. [2019-05-23 09:50:05,234 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2019-05-23 09:50:05,235 INFO L146 ILogger]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 85 [2019-05-23 09:50:05,235 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:05,235 INFO L146 ILogger]: Abstraction has 88 states and 130 transitions. [2019-05-23 09:50:05,235 INFO L146 ILogger]: Interpolant automaton has 44 states. [2019-05-23 09:50:05,235 INFO L146 ILogger]: Start isEmpty. Operand 88 states and 130 transitions. [2019-05-23 09:50:05,235 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 88 [2019-05-23 09:50:05,235 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:05,235 INFO L146 ILogger]: trace histogram [42, 42, 1, 1, 1] [2019-05-23 09:50:05,236 INFO L146 ILogger]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:05,236 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:05,236 INFO L146 ILogger]: Analyzing trace with hash -845788079, now seen corresponding path program 42 times [2019-05-23 09:50:05,236 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:05,244 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:05,245 INFO L146 ILogger]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2019-05-23 09:50:05,247 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:05,936 INFO L146 ILogger]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:05,936 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:05,936 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2019-05-23 09:50:05,936 INFO L146 ILogger]: Interpolant automaton has 45 states [2019-05-23 09:50:05,937 INFO L146 ILogger]: Constructing interpolant automaton starting with 45 interpolants. [2019-05-23 09:50:05,937 INFO L146 ILogger]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:50:05,938 INFO L146 ILogger]: Start difference. First operand 88 states and 130 transitions. Second operand 45 states. [2019-05-23 09:50:05,999 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:05,999 INFO L146 ILogger]: Finished difference Result 90 states and 133 transitions. [2019-05-23 09:50:06,000 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-05-23 09:50:06,000 INFO L146 ILogger]: Start accepts. Automaton has 45 states. Word has length 87 [2019-05-23 09:50:06,000 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:06,001 INFO L146 ILogger]: With dead ends: 90 [2019-05-23 09:50:06,001 INFO L146 ILogger]: Without dead ends: 90 [2019-05-23 09:50:06,002 INFO L146 ILogger]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2019-05-23 09:50:06,003 INFO L146 ILogger]: Start minimizeSevpa. Operand 90 states. [2019-05-23 09:50:06,004 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-05-23 09:50:06,004 INFO L146 ILogger]: Start removeUnreachable. Operand 90 states. [2019-05-23 09:50:06,004 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 90 states to 90 states and 133 transitions. [2019-05-23 09:50:06,004 INFO L146 ILogger]: Start accepts. Automaton has 90 states and 133 transitions. Word has length 87 [2019-05-23 09:50:06,005 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:06,005 INFO L146 ILogger]: Abstraction has 90 states and 133 transitions. [2019-05-23 09:50:06,005 INFO L146 ILogger]: Interpolant automaton has 45 states. [2019-05-23 09:50:06,005 INFO L146 ILogger]: Start isEmpty. Operand 90 states and 133 transitions. [2019-05-23 09:50:06,005 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 90 [2019-05-23 09:50:06,005 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:06,005 INFO L146 ILogger]: trace histogram [43, 43, 1, 1, 1] [2019-05-23 09:50:06,006 INFO L146 ILogger]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:06,006 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:06,006 INFO L146 ILogger]: Analyzing trace with hash -1053555116, now seen corresponding path program 43 times [2019-05-23 09:50:06,006 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:06,014 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:06,016 INFO L146 ILogger]: Trace formula consists of 180 conjuncts, 45 conjunts are in the unsatisfiable core [2019-05-23 09:50:06,017 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:06,852 INFO L146 ILogger]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:06,852 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:06,852 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2019-05-23 09:50:06,852 INFO L146 ILogger]: Interpolant automaton has 46 states [2019-05-23 09:50:06,852 INFO L146 ILogger]: Constructing interpolant automaton starting with 46 interpolants. [2019-05-23 09:50:06,853 INFO L146 ILogger]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:50:06,853 INFO L146 ILogger]: Start difference. First operand 90 states and 133 transitions. Second operand 46 states. [2019-05-23 09:50:06,913 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:06,914 INFO L146 ILogger]: Finished difference Result 92 states and 136 transitions. [2019-05-23 09:50:06,914 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-05-23 09:50:06,914 INFO L146 ILogger]: Start accepts. Automaton has 46 states. Word has length 89 [2019-05-23 09:50:06,915 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:06,915 INFO L146 ILogger]: With dead ends: 92 [2019-05-23 09:50:06,915 INFO L146 ILogger]: Without dead ends: 92 [2019-05-23 09:50:06,916 INFO L146 ILogger]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-05-23 09:50:06,916 INFO L146 ILogger]: Start minimizeSevpa. Operand 92 states. [2019-05-23 09:50:06,918 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-05-23 09:50:06,918 INFO L146 ILogger]: Start removeUnreachable. Operand 92 states. [2019-05-23 09:50:06,918 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2019-05-23 09:50:06,918 INFO L146 ILogger]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 89 [2019-05-23 09:50:06,918 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:06,918 INFO L146 ILogger]: Abstraction has 92 states and 136 transitions. [2019-05-23 09:50:06,918 INFO L146 ILogger]: Interpolant automaton has 46 states. [2019-05-23 09:50:06,918 INFO L146 ILogger]: Start isEmpty. Operand 92 states and 136 transitions. [2019-05-23 09:50:06,919 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 92 [2019-05-23 09:50:06,919 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:06,919 INFO L146 ILogger]: trace histogram [44, 44, 1, 1, 1] [2019-05-23 09:50:06,919 INFO L146 ILogger]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:06,919 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:06,919 INFO L146 ILogger]: Analyzing trace with hash 1145785239, now seen corresponding path program 44 times [2019-05-23 09:50:06,920 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:06,928 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:06,929 INFO L146 ILogger]: Trace formula consists of 184 conjuncts, 46 conjunts are in the unsatisfiable core [2019-05-23 09:50:06,931 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:07,703 INFO L146 ILogger]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:07,704 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:07,704 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2019-05-23 09:50:07,704 INFO L146 ILogger]: Interpolant automaton has 47 states [2019-05-23 09:50:07,704 INFO L146 ILogger]: Constructing interpolant automaton starting with 47 interpolants. [2019-05-23 09:50:07,705 INFO L146 ILogger]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:50:07,705 INFO L146 ILogger]: Start difference. First operand 92 states and 136 transitions. Second operand 47 states. [2019-05-23 09:50:07,939 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:07,939 INFO L146 ILogger]: Finished difference Result 94 states and 139 transitions. [2019-05-23 09:50:07,939 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-05-23 09:50:07,940 INFO L146 ILogger]: Start accepts. Automaton has 47 states. Word has length 91 [2019-05-23 09:50:07,940 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:07,940 INFO L146 ILogger]: With dead ends: 94 [2019-05-23 09:50:07,941 INFO L146 ILogger]: Without dead ends: 94 [2019-05-23 09:50:07,941 INFO L146 ILogger]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2019-05-23 09:50:07,941 INFO L146 ILogger]: Start minimizeSevpa. Operand 94 states. [2019-05-23 09:50:07,942 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-05-23 09:50:07,943 INFO L146 ILogger]: Start removeUnreachable. Operand 94 states. [2019-05-23 09:50:07,943 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 94 states to 94 states and 139 transitions. [2019-05-23 09:50:07,943 INFO L146 ILogger]: Start accepts. Automaton has 94 states and 139 transitions. Word has length 91 [2019-05-23 09:50:07,943 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:07,944 INFO L146 ILogger]: Abstraction has 94 states and 139 transitions. [2019-05-23 09:50:07,944 INFO L146 ILogger]: Interpolant automaton has 47 states. [2019-05-23 09:50:07,944 INFO L146 ILogger]: Start isEmpty. Operand 94 states and 139 transitions. [2019-05-23 09:50:07,944 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 94 [2019-05-23 09:50:07,944 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:07,945 INFO L146 ILogger]: trace histogram [45, 45, 1, 1, 1] [2019-05-23 09:50:07,945 INFO L146 ILogger]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:07,945 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:07,945 INFO L146 ILogger]: Analyzing trace with hash 1587956762, now seen corresponding path program 45 times [2019-05-23 09:50:07,946 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:07,955 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:07,956 INFO L146 ILogger]: Trace formula consists of 188 conjuncts, 47 conjunts are in the unsatisfiable core [2019-05-23 09:50:07,958 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:09,093 INFO L146 ILogger]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:09,094 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:09,094 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2019-05-23 09:50:09,094 INFO L146 ILogger]: Interpolant automaton has 48 states [2019-05-23 09:50:09,094 INFO L146 ILogger]: Constructing interpolant automaton starting with 48 interpolants. [2019-05-23 09:50:09,095 INFO L146 ILogger]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:50:09,095 INFO L146 ILogger]: Start difference. First operand 94 states and 139 transitions. Second operand 48 states. [2019-05-23 09:50:09,177 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:09,177 INFO L146 ILogger]: Finished difference Result 96 states and 142 transitions. [2019-05-23 09:50:09,177 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-05-23 09:50:09,178 INFO L146 ILogger]: Start accepts. Automaton has 48 states. Word has length 93 [2019-05-23 09:50:09,178 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:09,179 INFO L146 ILogger]: With dead ends: 96 [2019-05-23 09:50:09,179 INFO L146 ILogger]: Without dead ends: 96 [2019-05-23 09:50:09,179 INFO L146 ILogger]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-05-23 09:50:09,179 INFO L146 ILogger]: Start minimizeSevpa. Operand 96 states. [2019-05-23 09:50:09,181 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-05-23 09:50:09,182 INFO L146 ILogger]: Start removeUnreachable. Operand 96 states. [2019-05-23 09:50:09,182 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 96 states to 96 states and 142 transitions. [2019-05-23 09:50:09,182 INFO L146 ILogger]: Start accepts. Automaton has 96 states and 142 transitions. Word has length 93 [2019-05-23 09:50:09,182 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:09,183 INFO L146 ILogger]: Abstraction has 96 states and 142 transitions. [2019-05-23 09:50:09,183 INFO L146 ILogger]: Interpolant automaton has 48 states. [2019-05-23 09:50:09,183 INFO L146 ILogger]: Start isEmpty. Operand 96 states and 142 transitions. [2019-05-23 09:50:09,183 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 96 [2019-05-23 09:50:09,183 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:09,184 INFO L146 ILogger]: trace histogram [46, 46, 1, 1, 1] [2019-05-23 09:50:09,184 INFO L146 ILogger]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:09,184 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:09,184 INFO L146 ILogger]: Analyzing trace with hash 1313028061, now seen corresponding path program 46 times [2019-05-23 09:50:09,185 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:09,193 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:09,194 INFO L146 ILogger]: Trace formula consists of 192 conjuncts, 48 conjunts are in the unsatisfiable core [2019-05-23 09:50:09,196 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:10,030 INFO L146 ILogger]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:10,030 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:10,030 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2019-05-23 09:50:10,031 INFO L146 ILogger]: Interpolant automaton has 49 states [2019-05-23 09:50:10,033 INFO L146 ILogger]: Constructing interpolant automaton starting with 49 interpolants. [2019-05-23 09:50:10,033 INFO L146 ILogger]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:50:10,033 INFO L146 ILogger]: Start difference. First operand 96 states and 142 transitions. Second operand 49 states. [2019-05-23 09:50:10,301 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:10,302 INFO L146 ILogger]: Finished difference Result 98 states and 145 transitions. [2019-05-23 09:50:10,302 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-05-23 09:50:10,302 INFO L146 ILogger]: Start accepts. Automaton has 49 states. Word has length 95 [2019-05-23 09:50:10,303 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:10,303 INFO L146 ILogger]: With dead ends: 98 [2019-05-23 09:50:10,303 INFO L146 ILogger]: Without dead ends: 98 [2019-05-23 09:50:10,304 INFO L146 ILogger]: 0 DeclaredPredicates, 94 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2019-05-23 09:50:10,304 INFO L146 ILogger]: Start minimizeSevpa. Operand 98 states. [2019-05-23 09:50:10,305 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-05-23 09:50:10,305 INFO L146 ILogger]: Start removeUnreachable. Operand 98 states. [2019-05-23 09:50:10,306 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2019-05-23 09:50:10,306 INFO L146 ILogger]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 95 [2019-05-23 09:50:10,306 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:10,306 INFO L146 ILogger]: Abstraction has 98 states and 145 transitions. [2019-05-23 09:50:10,306 INFO L146 ILogger]: Interpolant automaton has 49 states. [2019-05-23 09:50:10,306 INFO L146 ILogger]: Start isEmpty. Operand 98 states and 145 transitions. [2019-05-23 09:50:10,307 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 98 [2019-05-23 09:50:10,307 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:10,307 INFO L146 ILogger]: trace histogram [47, 47, 1, 1, 1] [2019-05-23 09:50:10,307 INFO L146 ILogger]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:10,307 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:10,307 INFO L146 ILogger]: Analyzing trace with hash -900448544, now seen corresponding path program 47 times [2019-05-23 09:50:10,308 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:10,316 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:10,317 INFO L146 ILogger]: Trace formula consists of 196 conjuncts, 49 conjunts are in the unsatisfiable core [2019-05-23 09:50:10,319 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:11,263 INFO L146 ILogger]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:11,264 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:11,264 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2019-05-23 09:50:11,264 INFO L146 ILogger]: Interpolant automaton has 50 states [2019-05-23 09:50:11,264 INFO L146 ILogger]: Constructing interpolant automaton starting with 50 interpolants. [2019-05-23 09:50:11,265 INFO L146 ILogger]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:50:11,265 INFO L146 ILogger]: Start difference. First operand 98 states and 145 transitions. Second operand 50 states. [2019-05-23 09:50:11,339 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:11,340 INFO L146 ILogger]: Finished difference Result 100 states and 148 transitions. [2019-05-23 09:50:11,340 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-05-23 09:50:11,340 INFO L146 ILogger]: Start accepts. Automaton has 50 states. Word has length 97 [2019-05-23 09:50:11,340 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:11,341 INFO L146 ILogger]: With dead ends: 100 [2019-05-23 09:50:11,341 INFO L146 ILogger]: Without dead ends: 100 [2019-05-23 09:50:11,342 INFO L146 ILogger]: 0 DeclaredPredicates, 96 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-05-23 09:50:11,342 INFO L146 ILogger]: Start minimizeSevpa. Operand 100 states. [2019-05-23 09:50:11,344 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-05-23 09:50:11,344 INFO L146 ILogger]: Start removeUnreachable. Operand 100 states. [2019-05-23 09:50:11,344 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 100 states to 100 states and 148 transitions. [2019-05-23 09:50:11,345 INFO L146 ILogger]: Start accepts. Automaton has 100 states and 148 transitions. Word has length 97 [2019-05-23 09:50:11,345 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:11,345 INFO L146 ILogger]: Abstraction has 100 states and 148 transitions. [2019-05-23 09:50:11,345 INFO L146 ILogger]: Interpolant automaton has 50 states. [2019-05-23 09:50:11,345 INFO L146 ILogger]: Start isEmpty. Operand 100 states and 148 transitions. [2019-05-23 09:50:11,345 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 100 [2019-05-23 09:50:11,345 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:11,346 INFO L146 ILogger]: trace histogram [48, 48, 1, 1, 1] [2019-05-23 09:50:11,346 INFO L146 ILogger]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:11,346 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:11,346 INFO L146 ILogger]: Analyzing trace with hash -2042654429, now seen corresponding path program 48 times [2019-05-23 09:50:11,347 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:11,356 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:11,357 INFO L146 ILogger]: Trace formula consists of 200 conjuncts, 50 conjunts are in the unsatisfiable core [2019-05-23 09:50:11,358 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:12,276 INFO L146 ILogger]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:12,277 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:12,277 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-05-23 09:50:12,277 INFO L146 ILogger]: Interpolant automaton has 51 states [2019-05-23 09:50:12,277 INFO L146 ILogger]: Constructing interpolant automaton starting with 51 interpolants. [2019-05-23 09:50:12,278 INFO L146 ILogger]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:50:12,278 INFO L146 ILogger]: Start difference. First operand 100 states and 148 transitions. Second operand 51 states. [2019-05-23 09:50:12,355 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:12,355 INFO L146 ILogger]: Finished difference Result 102 states and 151 transitions. [2019-05-23 09:50:12,356 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-05-23 09:50:12,356 INFO L146 ILogger]: Start accepts. Automaton has 51 states. Word has length 99 [2019-05-23 09:50:12,356 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:12,357 INFO L146 ILogger]: With dead ends: 102 [2019-05-23 09:50:12,357 INFO L146 ILogger]: Without dead ends: 102 [2019-05-23 09:50:12,358 INFO L146 ILogger]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2019-05-23 09:50:12,358 INFO L146 ILogger]: Start minimizeSevpa. Operand 102 states. [2019-05-23 09:50:12,360 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-05-23 09:50:12,360 INFO L146 ILogger]: Start removeUnreachable. Operand 102 states. [2019-05-23 09:50:12,360 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 102 states to 102 states and 151 transitions. [2019-05-23 09:50:12,360 INFO L146 ILogger]: Start accepts. Automaton has 102 states and 151 transitions. Word has length 99 [2019-05-23 09:50:12,360 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:12,361 INFO L146 ILogger]: Abstraction has 102 states and 151 transitions. [2019-05-23 09:50:12,361 INFO L146 ILogger]: Interpolant automaton has 51 states. [2019-05-23 09:50:12,361 INFO L146 ILogger]: Start isEmpty. Operand 102 states and 151 transitions. [2019-05-23 09:50:12,361 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 102 [2019-05-23 09:50:12,361 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:12,361 INFO L146 ILogger]: trace histogram [49, 49, 1, 1, 1] [2019-05-23 09:50:12,362 INFO L146 ILogger]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:12,362 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:12,362 INFO L146 ILogger]: Analyzing trace with hash -190882138, now seen corresponding path program 49 times [2019-05-23 09:50:12,362 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:12,372 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:12,373 INFO L146 ILogger]: Trace formula consists of 204 conjuncts, 51 conjunts are in the unsatisfiable core [2019-05-23 09:50:12,375 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:13,253 INFO L146 ILogger]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:13,253 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:13,254 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-05-23 09:50:13,254 INFO L146 ILogger]: Interpolant automaton has 52 states [2019-05-23 09:50:13,254 INFO L146 ILogger]: Constructing interpolant automaton starting with 52 interpolants. [2019-05-23 09:50:13,255 INFO L146 ILogger]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:50:13,255 INFO L146 ILogger]: Start difference. First operand 102 states and 151 transitions. Second operand 52 states. [2019-05-23 09:50:13,432 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:13,433 INFO L146 ILogger]: Finished difference Result 104 states and 154 transitions. [2019-05-23 09:50:13,433 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-05-23 09:50:13,433 INFO L146 ILogger]: Start accepts. Automaton has 52 states. Word has length 101 [2019-05-23 09:50:13,433 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:13,434 INFO L146 ILogger]: With dead ends: 104 [2019-05-23 09:50:13,434 INFO L146 ILogger]: Without dead ends: 104 [2019-05-23 09:50:13,436 INFO L146 ILogger]: 0 DeclaredPredicates, 100 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-05-23 09:50:13,436 INFO L146 ILogger]: Start minimizeSevpa. Operand 104 states. [2019-05-23 09:50:13,442 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-05-23 09:50:13,442 INFO L146 ILogger]: Start removeUnreachable. Operand 104 states. [2019-05-23 09:50:13,442 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-05-23 09:50:13,443 INFO L146 ILogger]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 101 [2019-05-23 09:50:13,443 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:13,443 INFO L146 ILogger]: Abstraction has 104 states and 154 transitions. [2019-05-23 09:50:13,443 INFO L146 ILogger]: Interpolant automaton has 52 states. [2019-05-23 09:50:13,443 INFO L146 ILogger]: Start isEmpty. Operand 104 states and 154 transitions. [2019-05-23 09:50:13,444 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 104 [2019-05-23 09:50:13,444 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:13,444 INFO L146 ILogger]: trace histogram [50, 50, 1, 1, 1] [2019-05-23 09:50:13,444 INFO L146 ILogger]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:13,444 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:13,444 INFO L146 ILogger]: Analyzing trace with hash 1245828969, now seen corresponding path program 50 times [2019-05-23 09:50:13,445 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:13,455 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:13,457 INFO L146 ILogger]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core [2019-05-23 09:50:13,458 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:14,446 INFO L146 ILogger]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:14,446 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:14,447 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2019-05-23 09:50:14,447 INFO L146 ILogger]: Interpolant automaton has 53 states [2019-05-23 09:50:14,447 INFO L146 ILogger]: Constructing interpolant automaton starting with 53 interpolants. [2019-05-23 09:50:14,448 INFO L146 ILogger]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:50:14,448 INFO L146 ILogger]: Start difference. First operand 104 states and 154 transitions. Second operand 53 states. [2019-05-23 09:50:14,625 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:14,625 INFO L146 ILogger]: Finished difference Result 106 states and 157 transitions. [2019-05-23 09:50:14,625 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-05-23 09:50:14,626 INFO L146 ILogger]: Start accepts. Automaton has 53 states. Word has length 103 [2019-05-23 09:50:14,626 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:14,627 INFO L146 ILogger]: With dead ends: 106 [2019-05-23 09:50:14,627 INFO L146 ILogger]: Without dead ends: 106 [2019-05-23 09:50:14,628 INFO L146 ILogger]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2019-05-23 09:50:14,628 INFO L146 ILogger]: Start minimizeSevpa. Operand 106 states. [2019-05-23 09:50:14,629 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-05-23 09:50:14,630 INFO L146 ILogger]: Start removeUnreachable. Operand 106 states. [2019-05-23 09:50:14,630 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2019-05-23 09:50:14,630 INFO L146 ILogger]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 103 [2019-05-23 09:50:14,631 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:14,631 INFO L146 ILogger]: Abstraction has 106 states and 157 transitions. [2019-05-23 09:50:14,631 INFO L146 ILogger]: Interpolant automaton has 53 states. [2019-05-23 09:50:14,631 INFO L146 ILogger]: Start isEmpty. Operand 106 states and 157 transitions. [2019-05-23 09:50:14,632 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 106 [2019-05-23 09:50:14,632 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:14,632 INFO L146 ILogger]: trace histogram [51, 51, 1, 1, 1] [2019-05-23 09:50:14,632 INFO L146 ILogger]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:14,632 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:14,633 INFO L146 ILogger]: Analyzing trace with hash -1054266516, now seen corresponding path program 51 times [2019-05-23 09:50:14,633 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:14,643 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:14,644 INFO L146 ILogger]: Trace formula consists of 212 conjuncts, 53 conjunts are in the unsatisfiable core [2019-05-23 09:50:14,646 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:16,536 INFO L146 ILogger]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:16,537 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:16,537 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2019-05-23 09:50:16,537 INFO L146 ILogger]: Interpolant automaton has 54 states [2019-05-23 09:50:16,537 INFO L146 ILogger]: Constructing interpolant automaton starting with 54 interpolants. [2019-05-23 09:50:16,538 INFO L146 ILogger]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:50:16,538 INFO L146 ILogger]: Start difference. First operand 106 states and 157 transitions. Second operand 54 states. [2019-05-23 09:50:16,656 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:16,656 INFO L146 ILogger]: Finished difference Result 108 states and 160 transitions. [2019-05-23 09:50:16,657 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-05-23 09:50:16,657 INFO L146 ILogger]: Start accepts. Automaton has 54 states. Word has length 105 [2019-05-23 09:50:16,657 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:16,658 INFO L146 ILogger]: With dead ends: 108 [2019-05-23 09:50:16,658 INFO L146 ILogger]: Without dead ends: 108 [2019-05-23 09:50:16,659 INFO L146 ILogger]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-05-23 09:50:16,659 INFO L146 ILogger]: Start minimizeSevpa. Operand 108 states. [2019-05-23 09:50:16,661 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-05-23 09:50:16,662 INFO L146 ILogger]: Start removeUnreachable. Operand 108 states. [2019-05-23 09:50:16,662 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 108 states to 108 states and 160 transitions. [2019-05-23 09:50:16,663 INFO L146 ILogger]: Start accepts. Automaton has 108 states and 160 transitions. Word has length 105 [2019-05-23 09:50:16,663 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:16,663 INFO L146 ILogger]: Abstraction has 108 states and 160 transitions. [2019-05-23 09:50:16,663 INFO L146 ILogger]: Interpolant automaton has 54 states. [2019-05-23 09:50:16,663 INFO L146 ILogger]: Start isEmpty. Operand 108 states and 160 transitions. [2019-05-23 09:50:16,664 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 108 [2019-05-23 09:50:16,664 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:16,664 INFO L146 ILogger]: trace histogram [52, 52, 1, 1, 1] [2019-05-23 09:50:16,664 INFO L146 ILogger]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:16,664 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:16,665 INFO L146 ILogger]: Analyzing trace with hash 462129839, now seen corresponding path program 52 times [2019-05-23 09:50:16,665 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:16,675 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:16,676 INFO L146 ILogger]: Trace formula consists of 216 conjuncts, 54 conjunts are in the unsatisfiable core [2019-05-23 09:50:16,678 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:17,654 INFO L146 ILogger]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:17,655 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:17,655 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2019-05-23 09:50:17,655 INFO L146 ILogger]: Interpolant automaton has 55 states [2019-05-23 09:50:17,655 INFO L146 ILogger]: Constructing interpolant automaton starting with 55 interpolants. [2019-05-23 09:50:17,655 INFO L146 ILogger]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:50:17,656 INFO L146 ILogger]: Start difference. First operand 108 states and 160 transitions. Second operand 55 states. [2019-05-23 09:50:17,757 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:17,758 INFO L146 ILogger]: Finished difference Result 110 states and 163 transitions. [2019-05-23 09:50:17,758 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-05-23 09:50:17,758 INFO L146 ILogger]: Start accepts. Automaton has 55 states. Word has length 107 [2019-05-23 09:50:17,759 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:17,759 INFO L146 ILogger]: With dead ends: 110 [2019-05-23 09:50:17,760 INFO L146 ILogger]: Without dead ends: 110 [2019-05-23 09:50:17,761 INFO L146 ILogger]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2019-05-23 09:50:17,761 INFO L146 ILogger]: Start minimizeSevpa. Operand 110 states. [2019-05-23 09:50:17,762 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-05-23 09:50:17,762 INFO L146 ILogger]: Start removeUnreachable. Operand 110 states. [2019-05-23 09:50:17,763 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 110 states to 110 states and 163 transitions. [2019-05-23 09:50:17,763 INFO L146 ILogger]: Start accepts. Automaton has 110 states and 163 transitions. Word has length 107 [2019-05-23 09:50:17,763 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:17,763 INFO L146 ILogger]: Abstraction has 110 states and 163 transitions. [2019-05-23 09:50:17,763 INFO L146 ILogger]: Interpolant automaton has 55 states. [2019-05-23 09:50:17,764 INFO L146 ILogger]: Start isEmpty. Operand 110 states and 163 transitions. [2019-05-23 09:50:17,764 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 110 [2019-05-23 09:50:17,764 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:17,764 INFO L146 ILogger]: trace histogram [53, 53, 1, 1, 1] [2019-05-23 09:50:17,764 INFO L146 ILogger]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:17,765 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:17,765 INFO L146 ILogger]: Analyzing trace with hash 1725113650, now seen corresponding path program 53 times [2019-05-23 09:50:17,765 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:17,775 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:17,777 INFO L146 ILogger]: Trace formula consists of 220 conjuncts, 55 conjunts are in the unsatisfiable core [2019-05-23 09:50:17,778 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:18,897 INFO L146 ILogger]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:18,897 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:18,897 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2019-05-23 09:50:18,898 INFO L146 ILogger]: Interpolant automaton has 56 states [2019-05-23 09:50:18,898 INFO L146 ILogger]: Constructing interpolant automaton starting with 56 interpolants. [2019-05-23 09:50:18,898 INFO L146 ILogger]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:50:18,899 INFO L146 ILogger]: Start difference. First operand 110 states and 163 transitions. Second operand 56 states. [2019-05-23 09:50:18,987 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:18,987 INFO L146 ILogger]: Finished difference Result 112 states and 166 transitions. [2019-05-23 09:50:18,988 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-05-23 09:50:18,988 INFO L146 ILogger]: Start accepts. Automaton has 56 states. Word has length 109 [2019-05-23 09:50:18,988 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:18,988 INFO L146 ILogger]: With dead ends: 112 [2019-05-23 09:50:18,989 INFO L146 ILogger]: Without dead ends: 112 [2019-05-23 09:50:18,989 INFO L146 ILogger]: 0 DeclaredPredicates, 108 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-05-23 09:50:18,989 INFO L146 ILogger]: Start minimizeSevpa. Operand 112 states. [2019-05-23 09:50:18,990 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-05-23 09:50:18,991 INFO L146 ILogger]: Start removeUnreachable. Operand 112 states. [2019-05-23 09:50:18,991 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 112 states to 112 states and 166 transitions. [2019-05-23 09:50:18,991 INFO L146 ILogger]: Start accepts. Automaton has 112 states and 166 transitions. Word has length 109 [2019-05-23 09:50:18,991 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:18,991 INFO L146 ILogger]: Abstraction has 112 states and 166 transitions. [2019-05-23 09:50:18,991 INFO L146 ILogger]: Interpolant automaton has 56 states. [2019-05-23 09:50:18,991 INFO L146 ILogger]: Start isEmpty. Operand 112 states and 166 transitions. [2019-05-23 09:50:18,992 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 112 [2019-05-23 09:50:18,992 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:18,992 INFO L146 ILogger]: trace histogram [54, 54, 1, 1, 1] [2019-05-23 09:50:18,992 INFO L146 ILogger]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:18,992 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:18,992 INFO L146 ILogger]: Analyzing trace with hash -23188747, now seen corresponding path program 54 times [2019-05-23 09:50:18,993 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:19,003 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:19,004 INFO L146 ILogger]: Trace formula consists of 224 conjuncts, 56 conjunts are in the unsatisfiable core [2019-05-23 09:50:19,006 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:20,042 INFO L146 ILogger]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:20,042 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:20,042 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2019-05-23 09:50:20,043 INFO L146 ILogger]: Interpolant automaton has 57 states [2019-05-23 09:50:20,043 INFO L146 ILogger]: Constructing interpolant automaton starting with 57 interpolants. [2019-05-23 09:50:20,043 INFO L146 ILogger]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:50:20,043 INFO L146 ILogger]: Start difference. First operand 112 states and 166 transitions. Second operand 57 states. [2019-05-23 09:50:20,138 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:20,138 INFO L146 ILogger]: Finished difference Result 114 states and 169 transitions. [2019-05-23 09:50:20,139 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-05-23 09:50:20,139 INFO L146 ILogger]: Start accepts. Automaton has 57 states. Word has length 111 [2019-05-23 09:50:20,139 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:20,140 INFO L146 ILogger]: With dead ends: 114 [2019-05-23 09:50:20,140 INFO L146 ILogger]: Without dead ends: 114 [2019-05-23 09:50:20,141 INFO L146 ILogger]: 0 DeclaredPredicates, 110 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2019-05-23 09:50:20,141 INFO L146 ILogger]: Start minimizeSevpa. Operand 114 states. [2019-05-23 09:50:20,143 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-05-23 09:50:20,143 INFO L146 ILogger]: Start removeUnreachable. Operand 114 states. [2019-05-23 09:50:20,143 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 114 states to 114 states and 169 transitions. [2019-05-23 09:50:20,143 INFO L146 ILogger]: Start accepts. Automaton has 114 states and 169 transitions. Word has length 111 [2019-05-23 09:50:20,143 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:20,144 INFO L146 ILogger]: Abstraction has 114 states and 169 transitions. [2019-05-23 09:50:20,144 INFO L146 ILogger]: Interpolant automaton has 57 states. [2019-05-23 09:50:20,144 INFO L146 ILogger]: Start isEmpty. Operand 114 states and 169 transitions. [2019-05-23 09:50:20,144 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 114 [2019-05-23 09:50:20,144 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:20,144 INFO L146 ILogger]: trace histogram [55, 55, 1, 1, 1] [2019-05-23 09:50:20,145 INFO L146 ILogger]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:20,145 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:20,145 INFO L146 ILogger]: Analyzing trace with hash -809579528, now seen corresponding path program 55 times [2019-05-23 09:50:20,145 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:20,154 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:20,156 INFO L146 ILogger]: Trace formula consists of 228 conjuncts, 57 conjunts are in the unsatisfiable core [2019-05-23 09:50:20,157 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:21,240 INFO L146 ILogger]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:21,240 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:21,240 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2019-05-23 09:50:21,241 INFO L146 ILogger]: Interpolant automaton has 58 states [2019-05-23 09:50:21,241 INFO L146 ILogger]: Constructing interpolant automaton starting with 58 interpolants. [2019-05-23 09:50:21,241 INFO L146 ILogger]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:50:21,241 INFO L146 ILogger]: Start difference. First operand 114 states and 169 transitions. Second operand 58 states. [2019-05-23 09:50:21,609 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:21,610 INFO L146 ILogger]: Finished difference Result 116 states and 172 transitions. [2019-05-23 09:50:21,611 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-05-23 09:50:21,611 INFO L146 ILogger]: Start accepts. Automaton has 58 states. Word has length 113 [2019-05-23 09:50:21,611 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:21,612 INFO L146 ILogger]: With dead ends: 116 [2019-05-23 09:50:21,612 INFO L146 ILogger]: Without dead ends: 116 [2019-05-23 09:50:21,613 INFO L146 ILogger]: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-05-23 09:50:21,613 INFO L146 ILogger]: Start minimizeSevpa. Operand 116 states. [2019-05-23 09:50:21,614 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-05-23 09:50:21,614 INFO L146 ILogger]: Start removeUnreachable. Operand 116 states. [2019-05-23 09:50:21,614 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-05-23 09:50:21,614 INFO L146 ILogger]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 113 [2019-05-23 09:50:21,615 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:21,615 INFO L146 ILogger]: Abstraction has 116 states and 172 transitions. [2019-05-23 09:50:21,615 INFO L146 ILogger]: Interpolant automaton has 58 states. [2019-05-23 09:50:21,615 INFO L146 ILogger]: Start isEmpty. Operand 116 states and 172 transitions. [2019-05-23 09:50:21,615 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 116 [2019-05-23 09:50:21,615 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:21,615 INFO L146 ILogger]: trace histogram [56, 56, 1, 1, 1] [2019-05-23 09:50:21,616 INFO L146 ILogger]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:21,616 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:21,616 INFO L146 ILogger]: Analyzing trace with hash -616875973, now seen corresponding path program 56 times [2019-05-23 09:50:21,616 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:21,626 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:21,628 INFO L146 ILogger]: Trace formula consists of 232 conjuncts, 58 conjunts are in the unsatisfiable core [2019-05-23 09:50:21,631 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:22,773 INFO L146 ILogger]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:22,773 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:22,773 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-05-23 09:50:22,774 INFO L146 ILogger]: Interpolant automaton has 59 states [2019-05-23 09:50:22,774 INFO L146 ILogger]: Constructing interpolant automaton starting with 59 interpolants. [2019-05-23 09:50:22,775 INFO L146 ILogger]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:50:22,775 INFO L146 ILogger]: Start difference. First operand 116 states and 172 transitions. Second operand 59 states. [2019-05-23 09:50:22,866 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:22,866 INFO L146 ILogger]: Finished difference Result 118 states and 175 transitions. [2019-05-23 09:50:22,866 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-05-23 09:50:22,866 INFO L146 ILogger]: Start accepts. Automaton has 59 states. Word has length 115 [2019-05-23 09:50:22,867 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:22,868 INFO L146 ILogger]: With dead ends: 118 [2019-05-23 09:50:22,868 INFO L146 ILogger]: Without dead ends: 118 [2019-05-23 09:50:22,868 INFO L146 ILogger]: 0 DeclaredPredicates, 114 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2019-05-23 09:50:22,869 INFO L146 ILogger]: Start minimizeSevpa. Operand 118 states. [2019-05-23 09:50:22,871 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 118 to 118. [2019-05-23 09:50:22,871 INFO L146 ILogger]: Start removeUnreachable. Operand 118 states. [2019-05-23 09:50:22,871 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 118 states to 118 states and 175 transitions. [2019-05-23 09:50:22,871 INFO L146 ILogger]: Start accepts. Automaton has 118 states and 175 transitions. Word has length 115 [2019-05-23 09:50:22,872 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:22,872 INFO L146 ILogger]: Abstraction has 118 states and 175 transitions. [2019-05-23 09:50:22,872 INFO L146 ILogger]: Interpolant automaton has 59 states. [2019-05-23 09:50:22,872 INFO L146 ILogger]: Start isEmpty. Operand 118 states and 175 transitions. [2019-05-23 09:50:22,872 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 118 [2019-05-23 09:50:22,873 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:22,873 INFO L146 ILogger]: trace histogram [57, 57, 1, 1, 1] [2019-05-23 09:50:22,873 INFO L146 ILogger]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:22,873 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:22,873 INFO L146 ILogger]: Analyzing trace with hash -112353346, now seen corresponding path program 57 times [2019-05-23 09:50:22,874 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:22,884 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:22,886 INFO L146 ILogger]: Trace formula consists of 236 conjuncts, 59 conjunts are in the unsatisfiable core [2019-05-23 09:50:22,888 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:24,095 INFO L146 ILogger]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:24,096 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:24,096 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-05-23 09:50:24,096 INFO L146 ILogger]: Interpolant automaton has 60 states [2019-05-23 09:50:24,097 INFO L146 ILogger]: Constructing interpolant automaton starting with 60 interpolants. [2019-05-23 09:50:24,097 INFO L146 ILogger]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:50:24,097 INFO L146 ILogger]: Start difference. First operand 118 states and 175 transitions. Second operand 60 states. [2019-05-23 09:50:24,196 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:24,196 INFO L146 ILogger]: Finished difference Result 120 states and 178 transitions. [2019-05-23 09:50:24,197 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-05-23 09:50:24,197 INFO L146 ILogger]: Start accepts. Automaton has 60 states. Word has length 117 [2019-05-23 09:50:24,197 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:24,198 INFO L146 ILogger]: With dead ends: 120 [2019-05-23 09:50:24,198 INFO L146 ILogger]: Without dead ends: 120 [2019-05-23 09:50:24,199 INFO L146 ILogger]: 0 DeclaredPredicates, 116 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-05-23 09:50:24,199 INFO L146 ILogger]: Start minimizeSevpa. Operand 120 states. [2019-05-23 09:50:24,202 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-05-23 09:50:24,202 INFO L146 ILogger]: Start removeUnreachable. Operand 120 states. [2019-05-23 09:50:24,202 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 120 states to 120 states and 178 transitions. [2019-05-23 09:50:24,202 INFO L146 ILogger]: Start accepts. Automaton has 120 states and 178 transitions. Word has length 117 [2019-05-23 09:50:24,203 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:24,203 INFO L146 ILogger]: Abstraction has 120 states and 178 transitions. [2019-05-23 09:50:24,203 INFO L146 ILogger]: Interpolant automaton has 60 states. [2019-05-23 09:50:24,203 INFO L146 ILogger]: Start isEmpty. Operand 120 states and 178 transitions. [2019-05-23 09:50:24,203 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 120 [2019-05-23 09:50:24,204 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:24,204 INFO L146 ILogger]: trace histogram [58, 58, 1, 1, 1] [2019-05-23 09:50:24,204 INFO L146 ILogger]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:24,204 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:24,204 INFO L146 ILogger]: Analyzing trace with hash -597413247, now seen corresponding path program 58 times [2019-05-23 09:50:24,205 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:24,216 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:24,217 INFO L146 ILogger]: Trace formula consists of 240 conjuncts, 60 conjunts are in the unsatisfiable core [2019-05-23 09:50:24,219 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:25,438 INFO L146 ILogger]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:25,438 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:25,438 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2019-05-23 09:50:25,438 INFO L146 ILogger]: Interpolant automaton has 61 states [2019-05-23 09:50:25,439 INFO L146 ILogger]: Constructing interpolant automaton starting with 61 interpolants. [2019-05-23 09:50:25,439 INFO L146 ILogger]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:50:25,439 INFO L146 ILogger]: Start difference. First operand 120 states and 178 transitions. Second operand 61 states. [2019-05-23 09:50:25,540 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:25,541 INFO L146 ILogger]: Finished difference Result 122 states and 181 transitions. [2019-05-23 09:50:25,541 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-05-23 09:50:25,541 INFO L146 ILogger]: Start accepts. Automaton has 61 states. Word has length 119 [2019-05-23 09:50:25,541 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:25,542 INFO L146 ILogger]: With dead ends: 122 [2019-05-23 09:50:25,542 INFO L146 ILogger]: Without dead ends: 122 [2019-05-23 09:50:25,543 INFO L146 ILogger]: 0 DeclaredPredicates, 118 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2019-05-23 09:50:25,543 INFO L146 ILogger]: Start minimizeSevpa. Operand 122 states. [2019-05-23 09:50:25,545 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 122 to 122. [2019-05-23 09:50:25,545 INFO L146 ILogger]: Start removeUnreachable. Operand 122 states. [2019-05-23 09:50:25,545 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 122 states to 122 states and 181 transitions. [2019-05-23 09:50:25,545 INFO L146 ILogger]: Start accepts. Automaton has 122 states and 181 transitions. Word has length 119 [2019-05-23 09:50:25,545 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:25,545 INFO L146 ILogger]: Abstraction has 122 states and 181 transitions. [2019-05-23 09:50:25,546 INFO L146 ILogger]: Interpolant automaton has 61 states. [2019-05-23 09:50:25,546 INFO L146 ILogger]: Start isEmpty. Operand 122 states and 181 transitions. [2019-05-23 09:50:25,546 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 122 [2019-05-23 09:50:25,546 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:25,546 INFO L146 ILogger]: trace histogram [59, 59, 1, 1, 1] [2019-05-23 09:50:25,546 INFO L146 ILogger]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:25,546 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:25,547 INFO L146 ILogger]: Analyzing trace with hash 1411457156, now seen corresponding path program 59 times [2019-05-23 09:50:25,547 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:25,557 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:25,559 INFO L146 ILogger]: Trace formula consists of 244 conjuncts, 61 conjunts are in the unsatisfiable core [2019-05-23 09:50:25,561 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:26,945 INFO L146 ILogger]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:26,945 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:26,945 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2019-05-23 09:50:26,945 INFO L146 ILogger]: Interpolant automaton has 62 states [2019-05-23 09:50:26,946 INFO L146 ILogger]: Constructing interpolant automaton starting with 62 interpolants. [2019-05-23 09:50:26,946 INFO L146 ILogger]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:50:26,946 INFO L146 ILogger]: Start difference. First operand 122 states and 181 transitions. Second operand 62 states. [2019-05-23 09:50:27,044 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:27,044 INFO L146 ILogger]: Finished difference Result 124 states and 184 transitions. [2019-05-23 09:50:27,044 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-05-23 09:50:27,045 INFO L146 ILogger]: Start accepts. Automaton has 62 states. Word has length 121 [2019-05-23 09:50:27,045 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:27,045 INFO L146 ILogger]: With dead ends: 124 [2019-05-23 09:50:27,045 INFO L146 ILogger]: Without dead ends: 124 [2019-05-23 09:50:27,046 INFO L146 ILogger]: 0 DeclaredPredicates, 120 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-05-23 09:50:27,046 INFO L146 ILogger]: Start minimizeSevpa. Operand 124 states. [2019-05-23 09:50:27,047 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-05-23 09:50:27,047 INFO L146 ILogger]: Start removeUnreachable. Operand 124 states. [2019-05-23 09:50:27,048 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2019-05-23 09:50:27,048 INFO L146 ILogger]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 121 [2019-05-23 09:50:27,048 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:27,048 INFO L146 ILogger]: Abstraction has 124 states and 184 transitions. [2019-05-23 09:50:27,048 INFO L146 ILogger]: Interpolant automaton has 62 states. [2019-05-23 09:50:27,048 INFO L146 ILogger]: Start isEmpty. Operand 124 states and 184 transitions. [2019-05-23 09:50:27,049 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 124 [2019-05-23 09:50:27,049 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:27,049 INFO L146 ILogger]: trace histogram [60, 60, 1, 1, 1] [2019-05-23 09:50:27,049 INFO L146 ILogger]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:27,049 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:27,049 INFO L146 ILogger]: Analyzing trace with hash -799368761, now seen corresponding path program 60 times [2019-05-23 09:50:27,050 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:27,061 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:27,062 INFO L146 ILogger]: Trace formula consists of 248 conjuncts, 62 conjunts are in the unsatisfiable core [2019-05-23 09:50:27,064 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:28,386 INFO L146 ILogger]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:28,387 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:28,387 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2019-05-23 09:50:28,387 INFO L146 ILogger]: Interpolant automaton has 63 states [2019-05-23 09:50:28,387 INFO L146 ILogger]: Constructing interpolant automaton starting with 63 interpolants. [2019-05-23 09:50:28,388 INFO L146 ILogger]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:50:28,388 INFO L146 ILogger]: Start difference. First operand 124 states and 184 transitions. Second operand 63 states. [2019-05-23 09:50:28,497 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:28,497 INFO L146 ILogger]: Finished difference Result 126 states and 187 transitions. [2019-05-23 09:50:28,497 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-05-23 09:50:28,497 INFO L146 ILogger]: Start accepts. Automaton has 63 states. Word has length 123 [2019-05-23 09:50:28,498 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:28,498 INFO L146 ILogger]: With dead ends: 126 [2019-05-23 09:50:28,499 INFO L146 ILogger]: Without dead ends: 126 [2019-05-23 09:50:28,499 INFO L146 ILogger]: 0 DeclaredPredicates, 122 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2019-05-23 09:50:28,499 INFO L146 ILogger]: Start minimizeSevpa. Operand 126 states. [2019-05-23 09:50:28,500 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 126 to 126. [2019-05-23 09:50:28,501 INFO L146 ILogger]: Start removeUnreachable. Operand 126 states. [2019-05-23 09:50:28,501 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 126 states to 126 states and 187 transitions. [2019-05-23 09:50:28,501 INFO L146 ILogger]: Start accepts. Automaton has 126 states and 187 transitions. Word has length 123 [2019-05-23 09:50:28,501 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:28,501 INFO L146 ILogger]: Abstraction has 126 states and 187 transitions. [2019-05-23 09:50:28,501 INFO L146 ILogger]: Interpolant automaton has 63 states. [2019-05-23 09:50:28,502 INFO L146 ILogger]: Start isEmpty. Operand 126 states and 187 transitions. [2019-05-23 09:50:28,502 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 126 [2019-05-23 09:50:28,502 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:28,502 INFO L146 ILogger]: trace histogram [61, 61, 1, 1, 1] [2019-05-23 09:50:28,502 INFO L146 ILogger]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:28,502 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:28,503 INFO L146 ILogger]: Analyzing trace with hash 605736522, now seen corresponding path program 61 times [2019-05-23 09:50:28,503 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:28,511 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:28,513 INFO L146 ILogger]: Trace formula consists of 252 conjuncts, 63 conjunts are in the unsatisfiable core [2019-05-23 09:50:28,514 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:29,853 INFO L146 ILogger]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:29,853 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:29,854 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2019-05-23 09:50:29,854 INFO L146 ILogger]: Interpolant automaton has 64 states [2019-05-23 09:50:29,854 INFO L146 ILogger]: Constructing interpolant automaton starting with 64 interpolants. [2019-05-23 09:50:29,854 INFO L146 ILogger]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:50:29,854 INFO L146 ILogger]: Start difference. First operand 126 states and 187 transitions. Second operand 64 states. [2019-05-23 09:50:29,972 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:29,972 INFO L146 ILogger]: Finished difference Result 128 states and 190 transitions. [2019-05-23 09:50:29,972 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-05-23 09:50:29,972 INFO L146 ILogger]: Start accepts. Automaton has 64 states. Word has length 125 [2019-05-23 09:50:29,973 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:29,973 INFO L146 ILogger]: With dead ends: 128 [2019-05-23 09:50:29,973 INFO L146 ILogger]: Without dead ends: 128 [2019-05-23 09:50:29,974 INFO L146 ILogger]: 0 DeclaredPredicates, 124 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-05-23 09:50:29,974 INFO L146 ILogger]: Start minimizeSevpa. Operand 128 states. [2019-05-23 09:50:29,976 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 128 to 128. [2019-05-23 09:50:29,976 INFO L146 ILogger]: Start removeUnreachable. Operand 128 states. [2019-05-23 09:50:29,976 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-05-23 09:50:29,976 INFO L146 ILogger]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 125 [2019-05-23 09:50:29,977 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:29,977 INFO L146 ILogger]: Abstraction has 128 states and 190 transitions. [2019-05-23 09:50:29,977 INFO L146 ILogger]: Interpolant automaton has 64 states. [2019-05-23 09:50:29,977 INFO L146 ILogger]: Start isEmpty. Operand 128 states and 190 transitions. [2019-05-23 09:50:29,977 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 128 [2019-05-23 09:50:29,977 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:29,978 INFO L146 ILogger]: trace histogram [62, 62, 1, 1, 1] [2019-05-23 09:50:29,978 INFO L146 ILogger]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:29,978 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:29,978 INFO L146 ILogger]: Analyzing trace with hash -2002784755, now seen corresponding path program 62 times [2019-05-23 09:50:29,979 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:29,987 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:29,989 INFO L146 ILogger]: Trace formula consists of 256 conjuncts, 64 conjunts are in the unsatisfiable core [2019-05-23 09:50:29,990 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:32,189 INFO L146 ILogger]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:32,189 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:32,190 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2019-05-23 09:50:32,190 INFO L146 ILogger]: Interpolant automaton has 65 states [2019-05-23 09:50:32,190 INFO L146 ILogger]: Constructing interpolant automaton starting with 65 interpolants. [2019-05-23 09:50:32,191 INFO L146 ILogger]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:50:32,191 INFO L146 ILogger]: Start difference. First operand 128 states and 190 transitions. Second operand 65 states. [2019-05-23 09:50:32,306 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:32,306 INFO L146 ILogger]: Finished difference Result 130 states and 193 transitions. [2019-05-23 09:50:32,307 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-05-23 09:50:32,307 INFO L146 ILogger]: Start accepts. Automaton has 65 states. Word has length 127 [2019-05-23 09:50:32,307 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:32,308 INFO L146 ILogger]: With dead ends: 130 [2019-05-23 09:50:32,308 INFO L146 ILogger]: Without dead ends: 130 [2019-05-23 09:50:32,308 INFO L146 ILogger]: 0 DeclaredPredicates, 126 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2019-05-23 09:50:32,309 INFO L146 ILogger]: Start minimizeSevpa. Operand 130 states. [2019-05-23 09:50:32,310 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-05-23 09:50:32,310 INFO L146 ILogger]: Start removeUnreachable. Operand 130 states. [2019-05-23 09:50:32,310 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2019-05-23 09:50:32,310 INFO L146 ILogger]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 127 [2019-05-23 09:50:32,311 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:32,311 INFO L146 ILogger]: Abstraction has 130 states and 193 transitions. [2019-05-23 09:50:32,311 INFO L146 ILogger]: Interpolant automaton has 65 states. [2019-05-23 09:50:32,311 INFO L146 ILogger]: Start isEmpty. Operand 130 states and 193 transitions. [2019-05-23 09:50:32,311 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 130 [2019-05-23 09:50:32,311 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:32,311 INFO L146 ILogger]: trace histogram [63, 63, 1, 1, 1] [2019-05-23 09:50:32,312 INFO L146 ILogger]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:32,312 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:32,312 INFO L146 ILogger]: Analyzing trace with hash -530831088, now seen corresponding path program 63 times [2019-05-23 09:50:32,312 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:32,322 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:32,324 INFO L146 ILogger]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2019-05-23 09:50:32,326 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:35,037 INFO L146 ILogger]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:35,037 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:35,037 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2019-05-23 09:50:35,037 INFO L146 ILogger]: Interpolant automaton has 66 states [2019-05-23 09:50:35,038 INFO L146 ILogger]: Constructing interpolant automaton starting with 66 interpolants. [2019-05-23 09:50:35,038 INFO L146 ILogger]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:50:35,038 INFO L146 ILogger]: Start difference. First operand 130 states and 193 transitions. Second operand 66 states. [2019-05-23 09:50:35,183 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:35,183 INFO L146 ILogger]: Finished difference Result 132 states and 196 transitions. [2019-05-23 09:50:35,183 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-05-23 09:50:35,184 INFO L146 ILogger]: Start accepts. Automaton has 66 states. Word has length 129 [2019-05-23 09:50:35,184 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:35,185 INFO L146 ILogger]: With dead ends: 132 [2019-05-23 09:50:35,185 INFO L146 ILogger]: Without dead ends: 132 [2019-05-23 09:50:35,185 INFO L146 ILogger]: 0 DeclaredPredicates, 128 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-05-23 09:50:35,186 INFO L146 ILogger]: Start minimizeSevpa. Operand 132 states. [2019-05-23 09:50:35,188 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-05-23 09:50:35,188 INFO L146 ILogger]: Start removeUnreachable. Operand 132 states. [2019-05-23 09:50:35,188 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 132 states to 132 states and 196 transitions. [2019-05-23 09:50:35,189 INFO L146 ILogger]: Start accepts. Automaton has 132 states and 196 transitions. Word has length 129 [2019-05-23 09:50:35,189 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:35,189 INFO L146 ILogger]: Abstraction has 132 states and 196 transitions. [2019-05-23 09:50:35,189 INFO L146 ILogger]: Interpolant automaton has 66 states. [2019-05-23 09:50:35,189 INFO L146 ILogger]: Start isEmpty. Operand 132 states and 196 transitions. [2019-05-23 09:50:35,190 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 132 [2019-05-23 09:50:35,190 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:35,190 INFO L146 ILogger]: trace histogram [64, 64, 1, 1, 1] [2019-05-23 09:50:35,190 INFO L146 ILogger]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:35,190 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:35,190 INFO L146 ILogger]: Analyzing trace with hash 972402515, now seen corresponding path program 64 times [2019-05-23 09:50:35,191 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:35,202 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:35,204 INFO L146 ILogger]: Trace formula consists of 264 conjuncts, 66 conjunts are in the unsatisfiable core [2019-05-23 09:50:35,206 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:36,696 INFO L146 ILogger]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:36,696 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:36,696 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-05-23 09:50:36,696 INFO L146 ILogger]: Interpolant automaton has 67 states [2019-05-23 09:50:36,697 INFO L146 ILogger]: Constructing interpolant automaton starting with 67 interpolants. [2019-05-23 09:50:36,697 INFO L146 ILogger]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:50:36,697 INFO L146 ILogger]: Start difference. First operand 132 states and 196 transitions. Second operand 67 states. [2019-05-23 09:50:36,830 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:36,830 INFO L146 ILogger]: Finished difference Result 134 states and 199 transitions. [2019-05-23 09:50:36,830 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-05-23 09:50:36,830 INFO L146 ILogger]: Start accepts. Automaton has 67 states. Word has length 131 [2019-05-23 09:50:36,831 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:36,831 INFO L146 ILogger]: With dead ends: 134 [2019-05-23 09:50:36,832 INFO L146 ILogger]: Without dead ends: 134 [2019-05-23 09:50:36,832 INFO L146 ILogger]: 0 DeclaredPredicates, 130 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2019-05-23 09:50:36,832 INFO L146 ILogger]: Start minimizeSevpa. Operand 134 states. [2019-05-23 09:50:36,834 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 134 to 134. [2019-05-23 09:50:36,834 INFO L146 ILogger]: Start removeUnreachable. Operand 134 states. [2019-05-23 09:50:36,835 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 134 states to 134 states and 199 transitions. [2019-05-23 09:50:36,835 INFO L146 ILogger]: Start accepts. Automaton has 134 states and 199 transitions. Word has length 131 [2019-05-23 09:50:36,835 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:36,835 INFO L146 ILogger]: Abstraction has 134 states and 199 transitions. [2019-05-23 09:50:36,835 INFO L146 ILogger]: Interpolant automaton has 67 states. [2019-05-23 09:50:36,835 INFO L146 ILogger]: Start isEmpty. Operand 134 states and 199 transitions. [2019-05-23 09:50:36,836 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 134 [2019-05-23 09:50:36,836 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:36,836 INFO L146 ILogger]: trace histogram [65, 65, 1, 1, 1] [2019-05-23 09:50:36,836 INFO L146 ILogger]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:36,837 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:36,837 INFO L146 ILogger]: Analyzing trace with hash -1824083754, now seen corresponding path program 65 times [2019-05-23 09:50:36,837 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:36,848 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:36,850 INFO L146 ILogger]: Trace formula consists of 268 conjuncts, 67 conjunts are in the unsatisfiable core [2019-05-23 09:50:36,851 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:38,347 INFO L146 ILogger]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:38,348 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:38,348 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-05-23 09:50:38,348 INFO L146 ILogger]: Interpolant automaton has 68 states [2019-05-23 09:50:38,349 INFO L146 ILogger]: Constructing interpolant automaton starting with 68 interpolants. [2019-05-23 09:50:38,349 INFO L146 ILogger]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:50:38,349 INFO L146 ILogger]: Start difference. First operand 134 states and 199 transitions. Second operand 68 states. [2019-05-23 09:50:38,484 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:38,484 INFO L146 ILogger]: Finished difference Result 136 states and 202 transitions. [2019-05-23 09:50:38,485 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-05-23 09:50:38,485 INFO L146 ILogger]: Start accepts. Automaton has 68 states. Word has length 133 [2019-05-23 09:50:38,485 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:38,486 INFO L146 ILogger]: With dead ends: 136 [2019-05-23 09:50:38,486 INFO L146 ILogger]: Without dead ends: 136 [2019-05-23 09:50:38,486 INFO L146 ILogger]: 0 DeclaredPredicates, 132 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-05-23 09:50:38,487 INFO L146 ILogger]: Start minimizeSevpa. Operand 136 states. [2019-05-23 09:50:38,488 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-05-23 09:50:38,489 INFO L146 ILogger]: Start removeUnreachable. Operand 136 states. [2019-05-23 09:50:38,489 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2019-05-23 09:50:38,489 INFO L146 ILogger]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 133 [2019-05-23 09:50:38,489 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:38,490 INFO L146 ILogger]: Abstraction has 136 states and 202 transitions. [2019-05-23 09:50:38,490 INFO L146 ILogger]: Interpolant automaton has 68 states. [2019-05-23 09:50:38,490 INFO L146 ILogger]: Start isEmpty. Operand 136 states and 202 transitions. [2019-05-23 09:50:38,490 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 136 [2019-05-23 09:50:38,490 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:38,491 INFO L146 ILogger]: trace histogram [66, 66, 1, 1, 1] [2019-05-23 09:50:38,491 INFO L146 ILogger]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:38,491 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:38,491 INFO L146 ILogger]: Analyzing trace with hash -597860967, now seen corresponding path program 66 times [2019-05-23 09:50:38,491 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:38,503 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:38,505 INFO L146 ILogger]: Trace formula consists of 272 conjuncts, 68 conjunts are in the unsatisfiable core [2019-05-23 09:50:38,507 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:41,927 INFO L146 ILogger]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:41,927 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:41,928 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2019-05-23 09:50:41,928 INFO L146 ILogger]: Interpolant automaton has 69 states [2019-05-23 09:50:41,928 INFO L146 ILogger]: Constructing interpolant automaton starting with 69 interpolants. [2019-05-23 09:50:41,929 INFO L146 ILogger]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:50:41,929 INFO L146 ILogger]: Start difference. First operand 136 states and 202 transitions. Second operand 69 states. [2019-05-23 09:50:42,141 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:42,141 INFO L146 ILogger]: Finished difference Result 138 states and 205 transitions. [2019-05-23 09:50:42,142 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-05-23 09:50:42,142 INFO L146 ILogger]: Start accepts. Automaton has 69 states. Word has length 135 [2019-05-23 09:50:42,142 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:42,143 INFO L146 ILogger]: With dead ends: 138 [2019-05-23 09:50:42,143 INFO L146 ILogger]: Without dead ends: 138 [2019-05-23 09:50:42,143 INFO L146 ILogger]: 0 DeclaredPredicates, 134 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2019-05-23 09:50:42,144 INFO L146 ILogger]: Start minimizeSevpa. Operand 138 states. [2019-05-23 09:50:42,145 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 138 to 138. [2019-05-23 09:50:42,146 INFO L146 ILogger]: Start removeUnreachable. Operand 138 states. [2019-05-23 09:50:42,146 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 138 states to 138 states and 205 transitions. [2019-05-23 09:50:42,146 INFO L146 ILogger]: Start accepts. Automaton has 138 states and 205 transitions. Word has length 135 [2019-05-23 09:50:42,146 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:42,146 INFO L146 ILogger]: Abstraction has 138 states and 205 transitions. [2019-05-23 09:50:42,146 INFO L146 ILogger]: Interpolant automaton has 69 states. [2019-05-23 09:50:42,146 INFO L146 ILogger]: Start isEmpty. Operand 138 states and 205 transitions. [2019-05-23 09:50:42,147 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 138 [2019-05-23 09:50:42,147 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:42,147 INFO L146 ILogger]: trace histogram [67, 67, 1, 1, 1] [2019-05-23 09:50:42,147 INFO L146 ILogger]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:42,147 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:42,147 INFO L146 ILogger]: Analyzing trace with hash 981198236, now seen corresponding path program 67 times [2019-05-23 09:50:42,148 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:42,156 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:42,157 INFO L146 ILogger]: Trace formula consists of 276 conjuncts, 69 conjunts are in the unsatisfiable core [2019-05-23 09:50:42,158 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:43,712 INFO L146 ILogger]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:43,713 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:43,713 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2019-05-23 09:50:43,713 INFO L146 ILogger]: Interpolant automaton has 70 states [2019-05-23 09:50:43,714 INFO L146 ILogger]: Constructing interpolant automaton starting with 70 interpolants. [2019-05-23 09:50:43,714 INFO L146 ILogger]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:50:43,714 INFO L146 ILogger]: Start difference. First operand 138 states and 205 transitions. Second operand 70 states. [2019-05-23 09:50:43,882 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:43,883 INFO L146 ILogger]: Finished difference Result 140 states and 208 transitions. [2019-05-23 09:50:43,883 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-05-23 09:50:43,883 INFO L146 ILogger]: Start accepts. Automaton has 70 states. Word has length 137 [2019-05-23 09:50:43,883 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:43,884 INFO L146 ILogger]: With dead ends: 140 [2019-05-23 09:50:43,884 INFO L146 ILogger]: Without dead ends: 140 [2019-05-23 09:50:43,885 INFO L146 ILogger]: 0 DeclaredPredicates, 136 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-05-23 09:50:43,885 INFO L146 ILogger]: Start minimizeSevpa. Operand 140 states. [2019-05-23 09:50:43,887 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-05-23 09:50:43,887 INFO L146 ILogger]: Start removeUnreachable. Operand 140 states. [2019-05-23 09:50:43,887 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 140 states to 140 states and 208 transitions. [2019-05-23 09:50:43,887 INFO L146 ILogger]: Start accepts. Automaton has 140 states and 208 transitions. Word has length 137 [2019-05-23 09:50:43,887 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:43,887 INFO L146 ILogger]: Abstraction has 140 states and 208 transitions. [2019-05-23 09:50:43,888 INFO L146 ILogger]: Interpolant automaton has 70 states. [2019-05-23 09:50:43,888 INFO L146 ILogger]: Start isEmpty. Operand 140 states and 208 transitions. [2019-05-23 09:50:43,888 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 140 [2019-05-23 09:50:43,888 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:43,889 INFO L146 ILogger]: trace histogram [68, 68, 1, 1, 1] [2019-05-23 09:50:43,889 INFO L146 ILogger]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:43,889 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:43,889 INFO L146 ILogger]: Analyzing trace with hash -1961330465, now seen corresponding path program 68 times [2019-05-23 09:50:43,890 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:43,900 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:43,902 INFO L146 ILogger]: Trace formula consists of 280 conjuncts, 70 conjunts are in the unsatisfiable core [2019-05-23 09:50:43,904 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:45,544 INFO L146 ILogger]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:45,545 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:45,545 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2019-05-23 09:50:45,545 INFO L146 ILogger]: Interpolant automaton has 71 states [2019-05-23 09:50:45,546 INFO L146 ILogger]: Constructing interpolant automaton starting with 71 interpolants. [2019-05-23 09:50:45,546 INFO L146 ILogger]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:50:45,546 INFO L146 ILogger]: Start difference. First operand 140 states and 208 transitions. Second operand 71 states. [2019-05-23 09:50:45,767 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:45,767 INFO L146 ILogger]: Finished difference Result 142 states and 211 transitions. [2019-05-23 09:50:45,767 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-05-23 09:50:45,767 INFO L146 ILogger]: Start accepts. Automaton has 71 states. Word has length 139 [2019-05-23 09:50:45,768 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:45,768 INFO L146 ILogger]: With dead ends: 142 [2019-05-23 09:50:45,769 INFO L146 ILogger]: Without dead ends: 142 [2019-05-23 09:50:45,769 INFO L146 ILogger]: 0 DeclaredPredicates, 138 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2019-05-23 09:50:45,769 INFO L146 ILogger]: Start minimizeSevpa. Operand 142 states. [2019-05-23 09:50:45,771 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 142 to 142. [2019-05-23 09:50:45,771 INFO L146 ILogger]: Start removeUnreachable. Operand 142 states. [2019-05-23 09:50:45,772 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 142 states to 142 states and 211 transitions. [2019-05-23 09:50:45,772 INFO L146 ILogger]: Start accepts. Automaton has 142 states and 211 transitions. Word has length 139 [2019-05-23 09:50:45,772 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:45,772 INFO L146 ILogger]: Abstraction has 142 states and 211 transitions. [2019-05-23 09:50:45,772 INFO L146 ILogger]: Interpolant automaton has 71 states. [2019-05-23 09:50:45,772 INFO L146 ILogger]: Start isEmpty. Operand 142 states and 211 transitions. [2019-05-23 09:50:45,773 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 142 [2019-05-23 09:50:45,773 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:45,773 INFO L146 ILogger]: trace histogram [69, 69, 1, 1, 1] [2019-05-23 09:50:45,773 INFO L146 ILogger]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:45,773 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:45,773 INFO L146 ILogger]: Analyzing trace with hash 652035938, now seen corresponding path program 69 times [2019-05-23 09:50:45,774 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:45,784 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:45,786 INFO L146 ILogger]: Trace formula consists of 284 conjuncts, 71 conjunts are in the unsatisfiable core [2019-05-23 09:50:45,788 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:47,626 INFO L146 ILogger]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:47,626 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:47,626 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2019-05-23 09:50:47,627 INFO L146 ILogger]: Interpolant automaton has 72 states [2019-05-23 09:50:47,627 INFO L146 ILogger]: Constructing interpolant automaton starting with 72 interpolants. [2019-05-23 09:50:47,627 INFO L146 ILogger]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:50:47,627 INFO L146 ILogger]: Start difference. First operand 142 states and 211 transitions. Second operand 72 states. [2019-05-23 09:50:47,805 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:47,805 INFO L146 ILogger]: Finished difference Result 144 states and 214 transitions. [2019-05-23 09:50:47,805 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-05-23 09:50:47,805 INFO L146 ILogger]: Start accepts. Automaton has 72 states. Word has length 141 [2019-05-23 09:50:47,806 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:47,807 INFO L146 ILogger]: With dead ends: 144 [2019-05-23 09:50:47,807 INFO L146 ILogger]: Without dead ends: 144 [2019-05-23 09:50:47,807 INFO L146 ILogger]: 0 DeclaredPredicates, 140 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-05-23 09:50:47,808 INFO L146 ILogger]: Start minimizeSevpa. Operand 144 states. [2019-05-23 09:50:47,810 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-05-23 09:50:47,810 INFO L146 ILogger]: Start removeUnreachable. Operand 144 states. [2019-05-23 09:50:47,810 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 144 states to 144 states and 214 transitions. [2019-05-23 09:50:47,810 INFO L146 ILogger]: Start accepts. Automaton has 144 states and 214 transitions. Word has length 141 [2019-05-23 09:50:47,810 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:47,811 INFO L146 ILogger]: Abstraction has 144 states and 214 transitions. [2019-05-23 09:50:47,811 INFO L146 ILogger]: Interpolant automaton has 72 states. [2019-05-23 09:50:47,811 INFO L146 ILogger]: Start isEmpty. Operand 144 states and 214 transitions. [2019-05-23 09:50:47,811 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 144 [2019-05-23 09:50:47,811 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:47,811 INFO L146 ILogger]: trace histogram [70, 70, 1, 1, 1] [2019-05-23 09:50:47,812 INFO L146 ILogger]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:47,812 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:47,812 INFO L146 ILogger]: Analyzing trace with hash -458718939, now seen corresponding path program 70 times [2019-05-23 09:50:47,813 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:47,824 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:47,825 INFO L146 ILogger]: Trace formula consists of 288 conjuncts, 72 conjunts are in the unsatisfiable core [2019-05-23 09:50:47,827 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:49,581 INFO L146 ILogger]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:49,581 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:49,581 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2019-05-23 09:50:49,581 INFO L146 ILogger]: Interpolant automaton has 73 states [2019-05-23 09:50:49,582 INFO L146 ILogger]: Constructing interpolant automaton starting with 73 interpolants. [2019-05-23 09:50:49,582 INFO L146 ILogger]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:50:49,582 INFO L146 ILogger]: Start difference. First operand 144 states and 214 transitions. Second operand 73 states. [2019-05-23 09:50:49,765 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:49,766 INFO L146 ILogger]: Finished difference Result 146 states and 217 transitions. [2019-05-23 09:50:49,766 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-05-23 09:50:49,766 INFO L146 ILogger]: Start accepts. Automaton has 73 states. Word has length 143 [2019-05-23 09:50:49,766 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:49,767 INFO L146 ILogger]: With dead ends: 146 [2019-05-23 09:50:49,767 INFO L146 ILogger]: Without dead ends: 146 [2019-05-23 09:50:49,768 INFO L146 ILogger]: 0 DeclaredPredicates, 142 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2019-05-23 09:50:49,768 INFO L146 ILogger]: Start minimizeSevpa. Operand 146 states. [2019-05-23 09:50:49,770 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-05-23 09:50:49,770 INFO L146 ILogger]: Start removeUnreachable. Operand 146 states. [2019-05-23 09:50:49,770 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 146 states to 146 states and 217 transitions. [2019-05-23 09:50:49,770 INFO L146 ILogger]: Start accepts. Automaton has 146 states and 217 transitions. Word has length 143 [2019-05-23 09:50:49,770 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:49,771 INFO L146 ILogger]: Abstraction has 146 states and 217 transitions. [2019-05-23 09:50:49,771 INFO L146 ILogger]: Interpolant automaton has 73 states. [2019-05-23 09:50:49,771 INFO L146 ILogger]: Start isEmpty. Operand 146 states and 217 transitions. [2019-05-23 09:50:49,771 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 146 [2019-05-23 09:50:49,771 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:49,771 INFO L146 ILogger]: trace histogram [71, 71, 1, 1, 1] [2019-05-23 09:50:49,772 INFO L146 ILogger]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:49,772 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:49,772 INFO L146 ILogger]: Analyzing trace with hash 1552700968, now seen corresponding path program 71 times [2019-05-23 09:50:49,772 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:49,782 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:49,784 INFO L146 ILogger]: Trace formula consists of 292 conjuncts, 73 conjunts are in the unsatisfiable core [2019-05-23 09:50:49,785 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:51,696 INFO L146 ILogger]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:51,696 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:51,696 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2019-05-23 09:50:51,696 INFO L146 ILogger]: Interpolant automaton has 74 states [2019-05-23 09:50:51,697 INFO L146 ILogger]: Constructing interpolant automaton starting with 74 interpolants. [2019-05-23 09:50:51,697 INFO L146 ILogger]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:50:51,697 INFO L146 ILogger]: Start difference. First operand 146 states and 217 transitions. Second operand 74 states. [2019-05-23 09:50:51,867 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:51,867 INFO L146 ILogger]: Finished difference Result 148 states and 220 transitions. [2019-05-23 09:50:51,867 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-05-23 09:50:51,868 INFO L146 ILogger]: Start accepts. Automaton has 74 states. Word has length 145 [2019-05-23 09:50:51,868 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:51,868 INFO L146 ILogger]: With dead ends: 148 [2019-05-23 09:50:51,868 INFO L146 ILogger]: Without dead ends: 148 [2019-05-23 09:50:51,869 INFO L146 ILogger]: 0 DeclaredPredicates, 144 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-05-23 09:50:51,869 INFO L146 ILogger]: Start minimizeSevpa. Operand 148 states. [2019-05-23 09:50:51,870 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-05-23 09:50:51,870 INFO L146 ILogger]: Start removeUnreachable. Operand 148 states. [2019-05-23 09:50:51,871 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2019-05-23 09:50:51,871 INFO L146 ILogger]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 145 [2019-05-23 09:50:51,871 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:51,871 INFO L146 ILogger]: Abstraction has 148 states and 220 transitions. [2019-05-23 09:50:51,871 INFO L146 ILogger]: Interpolant automaton has 74 states. [2019-05-23 09:50:51,871 INFO L146 ILogger]: Start isEmpty. Operand 148 states and 220 transitions. [2019-05-23 09:50:51,872 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 148 [2019-05-23 09:50:51,872 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:51,872 INFO L146 ILogger]: trace histogram [72, 72, 1, 1, 1] [2019-05-23 09:50:51,872 INFO L146 ILogger]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:51,873 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:51,873 INFO L146 ILogger]: Analyzing trace with hash 1791948395, now seen corresponding path program 72 times [2019-05-23 09:50:51,873 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:51,884 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:51,886 INFO L146 ILogger]: Trace formula consists of 296 conjuncts, 74 conjunts are in the unsatisfiable core [2019-05-23 09:50:51,888 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:53,789 INFO L146 ILogger]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:53,789 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:53,789 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-05-23 09:50:53,789 INFO L146 ILogger]: Interpolant automaton has 75 states [2019-05-23 09:50:53,790 INFO L146 ILogger]: Constructing interpolant automaton starting with 75 interpolants. [2019-05-23 09:50:53,790 INFO L146 ILogger]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:50:53,790 INFO L146 ILogger]: Start difference. First operand 148 states and 220 transitions. Second operand 75 states. [2019-05-23 09:50:53,990 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:53,990 INFO L146 ILogger]: Finished difference Result 150 states and 223 transitions. [2019-05-23 09:50:53,990 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-05-23 09:50:53,991 INFO L146 ILogger]: Start accepts. Automaton has 75 states. Word has length 147 [2019-05-23 09:50:53,991 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:53,992 INFO L146 ILogger]: With dead ends: 150 [2019-05-23 09:50:53,992 INFO L146 ILogger]: Without dead ends: 150 [2019-05-23 09:50:53,993 INFO L146 ILogger]: 0 DeclaredPredicates, 146 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2019-05-23 09:50:53,993 INFO L146 ILogger]: Start minimizeSevpa. Operand 150 states. [2019-05-23 09:50:53,994 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 150 to 150. [2019-05-23 09:50:53,995 INFO L146 ILogger]: Start removeUnreachable. Operand 150 states. [2019-05-23 09:50:53,995 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 150 states to 150 states and 223 transitions. [2019-05-23 09:50:53,995 INFO L146 ILogger]: Start accepts. Automaton has 150 states and 223 transitions. Word has length 147 [2019-05-23 09:50:53,995 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:53,995 INFO L146 ILogger]: Abstraction has 150 states and 223 transitions. [2019-05-23 09:50:53,995 INFO L146 ILogger]: Interpolant automaton has 75 states. [2019-05-23 09:50:53,996 INFO L146 ILogger]: Start isEmpty. Operand 150 states and 223 transitions. [2019-05-23 09:50:53,996 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 150 [2019-05-23 09:50:53,996 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:53,996 INFO L146 ILogger]: trace histogram [73, 73, 1, 1, 1] [2019-05-23 09:50:53,997 INFO L146 ILogger]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:53,997 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:53,997 INFO L146 ILogger]: Analyzing trace with hash -219508242, now seen corresponding path program 73 times [2019-05-23 09:50:53,998 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:54,008 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:54,010 INFO L146 ILogger]: Trace formula consists of 300 conjuncts, 75 conjunts are in the unsatisfiable core [2019-05-23 09:50:54,012 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:55,844 INFO L146 ILogger]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:55,844 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:55,844 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2019-05-23 09:50:55,845 INFO L146 ILogger]: Interpolant automaton has 76 states [2019-05-23 09:50:55,845 INFO L146 ILogger]: Constructing interpolant automaton starting with 76 interpolants. [2019-05-23 09:50:55,845 INFO L146 ILogger]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:50:55,845 INFO L146 ILogger]: Start difference. First operand 150 states and 223 transitions. Second operand 76 states. [2019-05-23 09:50:56,030 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:56,030 INFO L146 ILogger]: Finished difference Result 152 states and 226 transitions. [2019-05-23 09:50:56,030 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-05-23 09:50:56,031 INFO L146 ILogger]: Start accepts. Automaton has 76 states. Word has length 149 [2019-05-23 09:50:56,031 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:56,032 INFO L146 ILogger]: With dead ends: 152 [2019-05-23 09:50:56,032 INFO L146 ILogger]: Without dead ends: 152 [2019-05-23 09:50:56,033 INFO L146 ILogger]: 0 DeclaredPredicates, 148 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-05-23 09:50:56,033 INFO L146 ILogger]: Start minimizeSevpa. Operand 152 states. [2019-05-23 09:50:56,035 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-05-23 09:50:56,035 INFO L146 ILogger]: Start removeUnreachable. Operand 152 states. [2019-05-23 09:50:56,035 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2019-05-23 09:50:56,035 INFO L146 ILogger]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 149 [2019-05-23 09:50:56,036 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:56,036 INFO L146 ILogger]: Abstraction has 152 states and 226 transitions. [2019-05-23 09:50:56,036 INFO L146 ILogger]: Interpolant automaton has 76 states. [2019-05-23 09:50:56,036 INFO L146 ILogger]: Start isEmpty. Operand 152 states and 226 transitions. [2019-05-23 09:50:56,036 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 152 [2019-05-23 09:50:56,037 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:56,037 INFO L146 ILogger]: trace histogram [74, 74, 1, 1, 1] [2019-05-23 09:50:56,037 INFO L146 ILogger]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:56,037 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:56,037 INFO L146 ILogger]: Analyzing trace with hash -494053199, now seen corresponding path program 74 times [2019-05-23 09:50:56,038 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:56,050 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:56,052 INFO L146 ILogger]: Trace formula consists of 304 conjuncts, 76 conjunts are in the unsatisfiable core [2019-05-23 09:50:56,054 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:50:58,049 INFO L146 ILogger]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:50:58,049 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:50:58,049 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2019-05-23 09:50:58,050 INFO L146 ILogger]: Interpolant automaton has 77 states [2019-05-23 09:50:58,050 INFO L146 ILogger]: Constructing interpolant automaton starting with 77 interpolants. [2019-05-23 09:50:58,050 INFO L146 ILogger]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:50:58,050 INFO L146 ILogger]: Start difference. First operand 152 states and 226 transitions. Second operand 77 states. [2019-05-23 09:50:58,242 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:50:58,242 INFO L146 ILogger]: Finished difference Result 154 states and 229 transitions. [2019-05-23 09:50:58,242 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-05-23 09:50:58,243 INFO L146 ILogger]: Start accepts. Automaton has 77 states. Word has length 151 [2019-05-23 09:50:58,243 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:50:58,244 INFO L146 ILogger]: With dead ends: 154 [2019-05-23 09:50:58,244 INFO L146 ILogger]: Without dead ends: 154 [2019-05-23 09:50:58,244 INFO L146 ILogger]: 0 DeclaredPredicates, 150 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2019-05-23 09:50:58,245 INFO L146 ILogger]: Start minimizeSevpa. Operand 154 states. [2019-05-23 09:50:58,247 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 154 to 154. [2019-05-23 09:50:58,247 INFO L146 ILogger]: Start removeUnreachable. Operand 154 states. [2019-05-23 09:50:58,247 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 154 states to 154 states and 229 transitions. [2019-05-23 09:50:58,247 INFO L146 ILogger]: Start accepts. Automaton has 154 states and 229 transitions. Word has length 151 [2019-05-23 09:50:58,247 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:50:58,247 INFO L146 ILogger]: Abstraction has 154 states and 229 transitions. [2019-05-23 09:50:58,247 INFO L146 ILogger]: Interpolant automaton has 77 states. [2019-05-23 09:50:58,247 INFO L146 ILogger]: Start isEmpty. Operand 154 states and 229 transitions. [2019-05-23 09:50:58,248 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 154 [2019-05-23 09:50:58,248 INFO L146 ILogger]: Found error trace [2019-05-23 09:50:58,248 INFO L146 ILogger]: trace histogram [75, 75, 1, 1, 1] [2019-05-23 09:50:58,248 INFO L146 ILogger]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:50:58,248 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:50:58,248 INFO L146 ILogger]: Analyzing trace with hash 1956215476, now seen corresponding path program 75 times [2019-05-23 09:50:58,249 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:50:58,258 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:50:58,259 INFO L146 ILogger]: Trace formula consists of 308 conjuncts, 77 conjunts are in the unsatisfiable core [2019-05-23 09:50:58,261 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:00,206 INFO L146 ILogger]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:00,206 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:00,206 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2019-05-23 09:51:00,206 INFO L146 ILogger]: Interpolant automaton has 78 states [2019-05-23 09:51:00,207 INFO L146 ILogger]: Constructing interpolant automaton starting with 78 interpolants. [2019-05-23 09:51:00,207 INFO L146 ILogger]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:51:00,207 INFO L146 ILogger]: Start difference. First operand 154 states and 229 transitions. Second operand 78 states. [2019-05-23 09:51:00,426 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:00,427 INFO L146 ILogger]: Finished difference Result 156 states and 232 transitions. [2019-05-23 09:51:00,427 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-05-23 09:51:00,427 INFO L146 ILogger]: Start accepts. Automaton has 78 states. Word has length 153 [2019-05-23 09:51:00,427 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:00,428 INFO L146 ILogger]: With dead ends: 156 [2019-05-23 09:51:00,428 INFO L146 ILogger]: Without dead ends: 156 [2019-05-23 09:51:00,429 INFO L146 ILogger]: 0 DeclaredPredicates, 152 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-05-23 09:51:00,429 INFO L146 ILogger]: Start minimizeSevpa. Operand 156 states. [2019-05-23 09:51:00,431 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 156 to 156. [2019-05-23 09:51:00,431 INFO L146 ILogger]: Start removeUnreachable. Operand 156 states. [2019-05-23 09:51:00,431 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 156 states to 156 states and 232 transitions. [2019-05-23 09:51:00,431 INFO L146 ILogger]: Start accepts. Automaton has 156 states and 232 transitions. Word has length 153 [2019-05-23 09:51:00,432 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:00,432 INFO L146 ILogger]: Abstraction has 156 states and 232 transitions. [2019-05-23 09:51:00,432 INFO L146 ILogger]: Interpolant automaton has 78 states. [2019-05-23 09:51:00,432 INFO L146 ILogger]: Start isEmpty. Operand 156 states and 232 transitions. [2019-05-23 09:51:00,433 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 156 [2019-05-23 09:51:00,433 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:00,433 INFO L146 ILogger]: trace histogram [76, 76, 1, 1, 1] [2019-05-23 09:51:00,433 INFO L146 ILogger]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:00,433 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:00,433 INFO L146 ILogger]: Analyzing trace with hash -1272633353, now seen corresponding path program 76 times [2019-05-23 09:51:00,434 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:00,447 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:00,449 INFO L146 ILogger]: Trace formula consists of 312 conjuncts, 78 conjunts are in the unsatisfiable core [2019-05-23 09:51:00,451 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:02,770 INFO L146 ILogger]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:02,771 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:02,771 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2019-05-23 09:51:02,771 INFO L146 ILogger]: Interpolant automaton has 79 states [2019-05-23 09:51:02,771 INFO L146 ILogger]: Constructing interpolant automaton starting with 79 interpolants. [2019-05-23 09:51:02,772 INFO L146 ILogger]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:51:02,772 INFO L146 ILogger]: Start difference. First operand 156 states and 232 transitions. Second operand 79 states. [2019-05-23 09:51:02,983 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:02,983 INFO L146 ILogger]: Finished difference Result 158 states and 235 transitions. [2019-05-23 09:51:02,983 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-05-23 09:51:02,983 INFO L146 ILogger]: Start accepts. Automaton has 79 states. Word has length 155 [2019-05-23 09:51:02,984 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:02,985 INFO L146 ILogger]: With dead ends: 158 [2019-05-23 09:51:02,985 INFO L146 ILogger]: Without dead ends: 158 [2019-05-23 09:51:02,985 INFO L146 ILogger]: 0 DeclaredPredicates, 154 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2019-05-23 09:51:02,986 INFO L146 ILogger]: Start minimizeSevpa. Operand 158 states. [2019-05-23 09:51:02,988 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 158 to 158. [2019-05-23 09:51:02,988 INFO L146 ILogger]: Start removeUnreachable. Operand 158 states. [2019-05-23 09:51:02,988 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 158 states to 158 states and 235 transitions. [2019-05-23 09:51:02,988 INFO L146 ILogger]: Start accepts. Automaton has 158 states and 235 transitions. Word has length 155 [2019-05-23 09:51:02,988 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:02,988 INFO L146 ILogger]: Abstraction has 158 states and 235 transitions. [2019-05-23 09:51:02,989 INFO L146 ILogger]: Interpolant automaton has 79 states. [2019-05-23 09:51:02,989 INFO L146 ILogger]: Start isEmpty. Operand 158 states and 235 transitions. [2019-05-23 09:51:02,989 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 158 [2019-05-23 09:51:02,989 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:02,989 INFO L146 ILogger]: trace histogram [77, 77, 1, 1, 1] [2019-05-23 09:51:02,990 INFO L146 ILogger]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:02,990 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:02,990 INFO L146 ILogger]: Analyzing trace with hash 1064996986, now seen corresponding path program 77 times [2019-05-23 09:51:02,990 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:03,000 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:03,002 INFO L146 ILogger]: Trace formula consists of 316 conjuncts, 79 conjunts are in the unsatisfiable core [2019-05-23 09:51:03,004 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:05,005 INFO L146 ILogger]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:05,005 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:05,005 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2019-05-23 09:51:05,006 INFO L146 ILogger]: Interpolant automaton has 80 states [2019-05-23 09:51:05,006 INFO L146 ILogger]: Constructing interpolant automaton starting with 80 interpolants. [2019-05-23 09:51:05,006 INFO L146 ILogger]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:51:05,006 INFO L146 ILogger]: Start difference. First operand 158 states and 235 transitions. Second operand 80 states. [2019-05-23 09:51:05,244 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:05,245 INFO L146 ILogger]: Finished difference Result 160 states and 238 transitions. [2019-05-23 09:51:05,245 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-05-23 09:51:05,245 INFO L146 ILogger]: Start accepts. Automaton has 80 states. Word has length 157 [2019-05-23 09:51:05,245 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:05,246 INFO L146 ILogger]: With dead ends: 160 [2019-05-23 09:51:05,246 INFO L146 ILogger]: Without dead ends: 160 [2019-05-23 09:51:05,247 INFO L146 ILogger]: 0 DeclaredPredicates, 156 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-05-23 09:51:05,247 INFO L146 ILogger]: Start minimizeSevpa. Operand 160 states. [2019-05-23 09:51:05,248 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 160 to 160. [2019-05-23 09:51:05,248 INFO L146 ILogger]: Start removeUnreachable. Operand 160 states. [2019-05-23 09:51:05,248 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 160 states to 160 states and 238 transitions. [2019-05-23 09:51:05,248 INFO L146 ILogger]: Start accepts. Automaton has 160 states and 238 transitions. Word has length 157 [2019-05-23 09:51:05,249 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:05,249 INFO L146 ILogger]: Abstraction has 160 states and 238 transitions. [2019-05-23 09:51:05,249 INFO L146 ILogger]: Interpolant automaton has 80 states. [2019-05-23 09:51:05,249 INFO L146 ILogger]: Start isEmpty. Operand 160 states and 238 transitions. [2019-05-23 09:51:05,249 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 160 [2019-05-23 09:51:05,249 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:05,249 INFO L146 ILogger]: trace histogram [78, 78, 1, 1, 1] [2019-05-23 09:51:05,250 INFO L146 ILogger]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:05,250 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:05,250 INFO L146 ILogger]: Analyzing trace with hash 1259856957, now seen corresponding path program 78 times [2019-05-23 09:51:05,250 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:05,263 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:05,265 INFO L146 ILogger]: Trace formula consists of 320 conjuncts, 80 conjunts are in the unsatisfiable core [2019-05-23 09:51:05,267 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:07,841 INFO L146 ILogger]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:07,841 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:07,841 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2019-05-23 09:51:07,842 INFO L146 ILogger]: Interpolant automaton has 81 states [2019-05-23 09:51:07,842 INFO L146 ILogger]: Constructing interpolant automaton starting with 81 interpolants. [2019-05-23 09:51:07,843 INFO L146 ILogger]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:51:07,843 INFO L146 ILogger]: Start difference. First operand 160 states and 238 transitions. Second operand 81 states. [2019-05-23 09:51:08,074 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:08,074 INFO L146 ILogger]: Finished difference Result 162 states and 241 transitions. [2019-05-23 09:51:08,074 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-05-23 09:51:08,074 INFO L146 ILogger]: Start accepts. Automaton has 81 states. Word has length 159 [2019-05-23 09:51:08,074 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:08,075 INFO L146 ILogger]: With dead ends: 162 [2019-05-23 09:51:08,075 INFO L146 ILogger]: Without dead ends: 162 [2019-05-23 09:51:08,075 INFO L146 ILogger]: 0 DeclaredPredicates, 158 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2019-05-23 09:51:08,076 INFO L146 ILogger]: Start minimizeSevpa. Operand 162 states. [2019-05-23 09:51:08,077 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-05-23 09:51:08,077 INFO L146 ILogger]: Start removeUnreachable. Operand 162 states. [2019-05-23 09:51:08,077 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 162 states to 162 states and 241 transitions. [2019-05-23 09:51:08,077 INFO L146 ILogger]: Start accepts. Automaton has 162 states and 241 transitions. Word has length 159 [2019-05-23 09:51:08,078 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:08,078 INFO L146 ILogger]: Abstraction has 162 states and 241 transitions. [2019-05-23 09:51:08,078 INFO L146 ILogger]: Interpolant automaton has 81 states. [2019-05-23 09:51:08,078 INFO L146 ILogger]: Start isEmpty. Operand 162 states and 241 transitions. [2019-05-23 09:51:08,079 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 162 [2019-05-23 09:51:08,079 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:08,079 INFO L146 ILogger]: trace histogram [79, 79, 1, 1, 1] [2019-05-23 09:51:08,079 INFO L146 ILogger]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:08,079 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:08,080 INFO L146 ILogger]: Analyzing trace with hash -458271936, now seen corresponding path program 79 times [2019-05-23 09:51:08,080 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:08,092 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:08,094 INFO L146 ILogger]: Trace formula consists of 324 conjuncts, 81 conjunts are in the unsatisfiable core [2019-05-23 09:51:08,096 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:10,254 INFO L146 ILogger]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:10,255 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:10,255 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2019-05-23 09:51:10,255 INFO L146 ILogger]: Interpolant automaton has 82 states [2019-05-23 09:51:10,255 INFO L146 ILogger]: Constructing interpolant automaton starting with 82 interpolants. [2019-05-23 09:51:10,256 INFO L146 ILogger]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:51:10,256 INFO L146 ILogger]: Start difference. First operand 162 states and 241 transitions. Second operand 82 states. [2019-05-23 09:51:10,492 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:10,492 INFO L146 ILogger]: Finished difference Result 164 states and 244 transitions. [2019-05-23 09:51:10,492 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-05-23 09:51:10,492 INFO L146 ILogger]: Start accepts. Automaton has 82 states. Word has length 161 [2019-05-23 09:51:10,493 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:10,494 INFO L146 ILogger]: With dead ends: 164 [2019-05-23 09:51:10,494 INFO L146 ILogger]: Without dead ends: 164 [2019-05-23 09:51:10,495 INFO L146 ILogger]: 0 DeclaredPredicates, 160 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-05-23 09:51:10,495 INFO L146 ILogger]: Start minimizeSevpa. Operand 164 states. [2019-05-23 09:51:10,497 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-05-23 09:51:10,497 INFO L146 ILogger]: Start removeUnreachable. Operand 164 states. [2019-05-23 09:51:10,497 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 164 states to 164 states and 244 transitions. [2019-05-23 09:51:10,497 INFO L146 ILogger]: Start accepts. Automaton has 164 states and 244 transitions. Word has length 161 [2019-05-23 09:51:10,497 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:10,498 INFO L146 ILogger]: Abstraction has 164 states and 244 transitions. [2019-05-23 09:51:10,498 INFO L146 ILogger]: Interpolant automaton has 82 states. [2019-05-23 09:51:10,498 INFO L146 ILogger]: Start isEmpty. Operand 164 states and 244 transitions. [2019-05-23 09:51:10,498 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 164 [2019-05-23 09:51:10,499 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:10,499 INFO L146 ILogger]: trace histogram [80, 80, 1, 1, 1] [2019-05-23 09:51:10,499 INFO L146 ILogger]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:10,499 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:10,499 INFO L146 ILogger]: Analyzing trace with hash 1982270851, now seen corresponding path program 80 times [2019-05-23 09:51:10,500 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:10,511 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:10,514 INFO L146 ILogger]: Trace formula consists of 328 conjuncts, 82 conjunts are in the unsatisfiable core [2019-05-23 09:51:10,515 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:12,699 INFO L146 ILogger]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:12,700 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:12,700 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-05-23 09:51:12,700 INFO L146 ILogger]: Interpolant automaton has 83 states [2019-05-23 09:51:12,701 INFO L146 ILogger]: Constructing interpolant automaton starting with 83 interpolants. [2019-05-23 09:51:12,701 INFO L146 ILogger]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:51:12,701 INFO L146 ILogger]: Start difference. First operand 164 states and 244 transitions. Second operand 83 states. [2019-05-23 09:51:12,939 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:12,939 INFO L146 ILogger]: Finished difference Result 166 states and 247 transitions. [2019-05-23 09:51:12,940 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-05-23 09:51:12,940 INFO L146 ILogger]: Start accepts. Automaton has 83 states. Word has length 163 [2019-05-23 09:51:12,940 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:12,941 INFO L146 ILogger]: With dead ends: 166 [2019-05-23 09:51:12,941 INFO L146 ILogger]: Without dead ends: 166 [2019-05-23 09:51:12,941 INFO L146 ILogger]: 0 DeclaredPredicates, 162 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2019-05-23 09:51:12,942 INFO L146 ILogger]: Start minimizeSevpa. Operand 166 states. [2019-05-23 09:51:12,943 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 166 to 166. [2019-05-23 09:51:12,943 INFO L146 ILogger]: Start removeUnreachable. Operand 166 states. [2019-05-23 09:51:12,944 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 166 states to 166 states and 247 transitions. [2019-05-23 09:51:12,944 INFO L146 ILogger]: Start accepts. Automaton has 166 states and 247 transitions. Word has length 163 [2019-05-23 09:51:12,944 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:12,944 INFO L146 ILogger]: Abstraction has 166 states and 247 transitions. [2019-05-23 09:51:12,944 INFO L146 ILogger]: Interpolant automaton has 83 states. [2019-05-23 09:51:12,944 INFO L146 ILogger]: Start isEmpty. Operand 166 states and 247 transitions. [2019-05-23 09:51:12,944 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 166 [2019-05-23 09:51:12,945 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:12,945 INFO L146 ILogger]: trace histogram [81, 81, 1, 1, 1] [2019-05-23 09:51:12,945 INFO L146 ILogger]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:12,945 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:12,945 INFO L146 ILogger]: Analyzing trace with hash -2003221754, now seen corresponding path program 81 times [2019-05-23 09:51:12,946 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:12,955 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:12,956 INFO L146 ILogger]: Trace formula consists of 332 conjuncts, 83 conjunts are in the unsatisfiable core [2019-05-23 09:51:12,958 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:15,569 INFO L146 ILogger]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:15,569 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:15,570 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2019-05-23 09:51:15,570 INFO L146 ILogger]: Interpolant automaton has 84 states [2019-05-23 09:51:15,570 INFO L146 ILogger]: Constructing interpolant automaton starting with 84 interpolants. [2019-05-23 09:51:15,570 INFO L146 ILogger]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:51:15,571 INFO L146 ILogger]: Start difference. First operand 166 states and 247 transitions. Second operand 84 states. [2019-05-23 09:51:15,805 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:15,805 INFO L146 ILogger]: Finished difference Result 168 states and 250 transitions. [2019-05-23 09:51:15,805 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-05-23 09:51:15,805 INFO L146 ILogger]: Start accepts. Automaton has 84 states. Word has length 165 [2019-05-23 09:51:15,806 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:15,807 INFO L146 ILogger]: With dead ends: 168 [2019-05-23 09:51:15,807 INFO L146 ILogger]: Without dead ends: 168 [2019-05-23 09:51:15,807 INFO L146 ILogger]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-05-23 09:51:15,808 INFO L146 ILogger]: Start minimizeSevpa. Operand 168 states. [2019-05-23 09:51:15,809 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-05-23 09:51:15,810 INFO L146 ILogger]: Start removeUnreachable. Operand 168 states. [2019-05-23 09:51:15,810 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 168 states to 168 states and 250 transitions. [2019-05-23 09:51:15,810 INFO L146 ILogger]: Start accepts. Automaton has 168 states and 250 transitions. Word has length 165 [2019-05-23 09:51:15,810 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:15,811 INFO L146 ILogger]: Abstraction has 168 states and 250 transitions. [2019-05-23 09:51:15,811 INFO L146 ILogger]: Interpolant automaton has 84 states. [2019-05-23 09:51:15,811 INFO L146 ILogger]: Start isEmpty. Operand 168 states and 250 transitions. [2019-05-23 09:51:15,811 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 168 [2019-05-23 09:51:15,811 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:15,811 INFO L146 ILogger]: trace histogram [82, 82, 1, 1, 1] [2019-05-23 09:51:15,812 INFO L146 ILogger]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:15,812 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:15,812 INFO L146 ILogger]: Analyzing trace with hash -950787127, now seen corresponding path program 82 times [2019-05-23 09:51:15,812 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:15,822 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:15,823 INFO L146 ILogger]: Trace formula consists of 336 conjuncts, 84 conjunts are in the unsatisfiable core [2019-05-23 09:51:15,825 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:18,109 INFO L146 ILogger]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:18,109 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:18,109 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2019-05-23 09:51:18,109 INFO L146 ILogger]: Interpolant automaton has 85 states [2019-05-23 09:51:18,110 INFO L146 ILogger]: Constructing interpolant automaton starting with 85 interpolants. [2019-05-23 09:51:18,110 INFO L146 ILogger]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:51:18,110 INFO L146 ILogger]: Start difference. First operand 168 states and 250 transitions. Second operand 85 states. [2019-05-23 09:51:18,373 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:18,373 INFO L146 ILogger]: Finished difference Result 170 states and 253 transitions. [2019-05-23 09:51:18,373 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-05-23 09:51:18,373 INFO L146 ILogger]: Start accepts. Automaton has 85 states. Word has length 167 [2019-05-23 09:51:18,374 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:18,374 INFO L146 ILogger]: With dead ends: 170 [2019-05-23 09:51:18,375 INFO L146 ILogger]: Without dead ends: 170 [2019-05-23 09:51:18,375 INFO L146 ILogger]: 0 DeclaredPredicates, 166 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2019-05-23 09:51:18,375 INFO L146 ILogger]: Start minimizeSevpa. Operand 170 states. [2019-05-23 09:51:18,377 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 170 to 170. [2019-05-23 09:51:18,377 INFO L146 ILogger]: Start removeUnreachable. Operand 170 states. [2019-05-23 09:51:18,378 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 170 states to 170 states and 253 transitions. [2019-05-23 09:51:18,378 INFO L146 ILogger]: Start accepts. Automaton has 170 states and 253 transitions. Word has length 167 [2019-05-23 09:51:18,378 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:18,378 INFO L146 ILogger]: Abstraction has 170 states and 253 transitions. [2019-05-23 09:51:18,378 INFO L146 ILogger]: Interpolant automaton has 85 states. [2019-05-23 09:51:18,379 INFO L146 ILogger]: Start isEmpty. Operand 170 states and 253 transitions. [2019-05-23 09:51:18,379 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 170 [2019-05-23 09:51:18,379 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:18,379 INFO L146 ILogger]: trace histogram [83, 83, 1, 1, 1] [2019-05-23 09:51:18,380 INFO L146 ILogger]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:18,380 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:18,380 INFO L146 ILogger]: Analyzing trace with hash 1121574860, now seen corresponding path program 83 times [2019-05-23 09:51:18,381 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:18,393 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:18,395 INFO L146 ILogger]: Trace formula consists of 340 conjuncts, 85 conjunts are in the unsatisfiable core [2019-05-23 09:51:18,397 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:20,747 INFO L146 ILogger]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:20,747 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:20,747 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2019-05-23 09:51:20,748 INFO L146 ILogger]: Interpolant automaton has 86 states [2019-05-23 09:51:20,748 INFO L146 ILogger]: Constructing interpolant automaton starting with 86 interpolants. [2019-05-23 09:51:20,748 INFO L146 ILogger]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:51:20,749 INFO L146 ILogger]: Start difference. First operand 170 states and 253 transitions. Second operand 86 states. [2019-05-23 09:51:21,008 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:21,008 INFO L146 ILogger]: Finished difference Result 172 states and 256 transitions. [2019-05-23 09:51:21,009 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-05-23 09:51:21,009 INFO L146 ILogger]: Start accepts. Automaton has 86 states. Word has length 169 [2019-05-23 09:51:21,009 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:21,010 INFO L146 ILogger]: With dead ends: 172 [2019-05-23 09:51:21,010 INFO L146 ILogger]: Without dead ends: 172 [2019-05-23 09:51:21,011 INFO L146 ILogger]: 0 DeclaredPredicates, 168 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-05-23 09:51:21,011 INFO L146 ILogger]: Start minimizeSevpa. Operand 172 states. [2019-05-23 09:51:21,013 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 172 to 172. [2019-05-23 09:51:21,013 INFO L146 ILogger]: Start removeUnreachable. Operand 172 states. [2019-05-23 09:51:21,013 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 172 states to 172 states and 256 transitions. [2019-05-23 09:51:21,013 INFO L146 ILogger]: Start accepts. Automaton has 172 states and 256 transitions. Word has length 169 [2019-05-23 09:51:21,013 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:21,013 INFO L146 ILogger]: Abstraction has 172 states and 256 transitions. [2019-05-23 09:51:21,014 INFO L146 ILogger]: Interpolant automaton has 86 states. [2019-05-23 09:51:21,014 INFO L146 ILogger]: Start isEmpty. Operand 172 states and 256 transitions. [2019-05-23 09:51:21,014 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 172 [2019-05-23 09:51:21,014 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:21,014 INFO L146 ILogger]: trace histogram [84, 84, 1, 1, 1] [2019-05-23 09:51:21,014 INFO L146 ILogger]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:21,015 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:21,015 INFO L146 ILogger]: Analyzing trace with hash -203380977, now seen corresponding path program 84 times [2019-05-23 09:51:21,015 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:21,024 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:21,026 INFO L146 ILogger]: Trace formula consists of 344 conjuncts, 86 conjunts are in the unsatisfiable core [2019-05-23 09:51:21,027 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:23,498 INFO L146 ILogger]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:23,499 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:23,499 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2019-05-23 09:51:23,499 INFO L146 ILogger]: Interpolant automaton has 87 states [2019-05-23 09:51:23,500 INFO L146 ILogger]: Constructing interpolant automaton starting with 87 interpolants. [2019-05-23 09:51:23,500 INFO L146 ILogger]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:51:23,500 INFO L146 ILogger]: Start difference. First operand 172 states and 256 transitions. Second operand 87 states. [2019-05-23 09:51:23,764 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:23,764 INFO L146 ILogger]: Finished difference Result 174 states and 259 transitions. [2019-05-23 09:51:23,764 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-05-23 09:51:23,765 INFO L146 ILogger]: Start accepts. Automaton has 87 states. Word has length 171 [2019-05-23 09:51:23,765 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:23,766 INFO L146 ILogger]: With dead ends: 174 [2019-05-23 09:51:23,766 INFO L146 ILogger]: Without dead ends: 174 [2019-05-23 09:51:23,766 INFO L146 ILogger]: 0 DeclaredPredicates, 170 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2019-05-23 09:51:23,767 INFO L146 ILogger]: Start minimizeSevpa. Operand 174 states. [2019-05-23 09:51:23,769 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 174 to 174. [2019-05-23 09:51:23,769 INFO L146 ILogger]: Start removeUnreachable. Operand 174 states. [2019-05-23 09:51:23,770 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 174 states to 174 states and 259 transitions. [2019-05-23 09:51:23,770 INFO L146 ILogger]: Start accepts. Automaton has 174 states and 259 transitions. Word has length 171 [2019-05-23 09:51:23,770 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:23,770 INFO L146 ILogger]: Abstraction has 174 states and 259 transitions. [2019-05-23 09:51:23,770 INFO L146 ILogger]: Interpolant automaton has 87 states. [2019-05-23 09:51:23,770 INFO L146 ILogger]: Start isEmpty. Operand 174 states and 259 transitions. [2019-05-23 09:51:23,771 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 174 [2019-05-23 09:51:23,771 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:23,771 INFO L146 ILogger]: trace histogram [85, 85, 1, 1, 1] [2019-05-23 09:51:23,772 INFO L146 ILogger]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:23,772 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:23,772 INFO L146 ILogger]: Analyzing trace with hash 2119346578, now seen corresponding path program 85 times [2019-05-23 09:51:23,772 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:23,782 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:23,784 INFO L146 ILogger]: Trace formula consists of 348 conjuncts, 87 conjunts are in the unsatisfiable core [2019-05-23 09:51:23,785 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:26,244 INFO L146 ILogger]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:26,244 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:26,244 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2019-05-23 09:51:26,245 INFO L146 ILogger]: Interpolant automaton has 88 states [2019-05-23 09:51:26,245 INFO L146 ILogger]: Constructing interpolant automaton starting with 88 interpolants. [2019-05-23 09:51:26,246 INFO L146 ILogger]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:51:26,246 INFO L146 ILogger]: Start difference. First operand 174 states and 259 transitions. Second operand 88 states. [2019-05-23 09:51:26,520 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:26,520 INFO L146 ILogger]: Finished difference Result 176 states and 262 transitions. [2019-05-23 09:51:26,520 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-05-23 09:51:26,520 INFO L146 ILogger]: Start accepts. Automaton has 88 states. Word has length 173 [2019-05-23 09:51:26,520 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:26,521 INFO L146 ILogger]: With dead ends: 176 [2019-05-23 09:51:26,521 INFO L146 ILogger]: Without dead ends: 176 [2019-05-23 09:51:26,522 INFO L146 ILogger]: 0 DeclaredPredicates, 172 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-05-23 09:51:26,522 INFO L146 ILogger]: Start minimizeSevpa. Operand 176 states. [2019-05-23 09:51:26,525 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 176 to 176. [2019-05-23 09:51:26,525 INFO L146 ILogger]: Start removeUnreachable. Operand 176 states. [2019-05-23 09:51:26,525 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 176 states to 176 states and 262 transitions. [2019-05-23 09:51:26,526 INFO L146 ILogger]: Start accepts. Automaton has 176 states and 262 transitions. Word has length 173 [2019-05-23 09:51:26,526 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:26,526 INFO L146 ILogger]: Abstraction has 176 states and 262 transitions. [2019-05-23 09:51:26,526 INFO L146 ILogger]: Interpolant automaton has 88 states. [2019-05-23 09:51:26,526 INFO L146 ILogger]: Start isEmpty. Operand 176 states and 262 transitions. [2019-05-23 09:51:26,527 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 176 [2019-05-23 09:51:26,527 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:26,527 INFO L146 ILogger]: trace histogram [86, 86, 1, 1, 1] [2019-05-23 09:51:26,527 INFO L146 ILogger]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:26,527 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:26,528 INFO L146 ILogger]: Analyzing trace with hash 877533013, now seen corresponding path program 86 times [2019-05-23 09:51:26,528 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:26,541 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:26,543 INFO L146 ILogger]: Trace formula consists of 352 conjuncts, 88 conjunts are in the unsatisfiable core [2019-05-23 09:51:26,545 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:29,040 INFO L146 ILogger]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:29,040 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:29,040 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2019-05-23 09:51:29,041 INFO L146 ILogger]: Interpolant automaton has 89 states [2019-05-23 09:51:29,041 INFO L146 ILogger]: Constructing interpolant automaton starting with 89 interpolants. [2019-05-23 09:51:29,042 INFO L146 ILogger]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:51:29,042 INFO L146 ILogger]: Start difference. First operand 176 states and 262 transitions. Second operand 89 states. [2019-05-23 09:51:29,799 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:29,799 INFO L146 ILogger]: Finished difference Result 178 states and 265 transitions. [2019-05-23 09:51:29,800 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-05-23 09:51:29,800 INFO L146 ILogger]: Start accepts. Automaton has 89 states. Word has length 175 [2019-05-23 09:51:29,800 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:29,801 INFO L146 ILogger]: With dead ends: 178 [2019-05-23 09:51:29,802 INFO L146 ILogger]: Without dead ends: 178 [2019-05-23 09:51:29,802 INFO L146 ILogger]: 0 DeclaredPredicates, 174 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2019-05-23 09:51:29,803 INFO L146 ILogger]: Start minimizeSevpa. Operand 178 states. [2019-05-23 09:51:29,805 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 178 to 178. [2019-05-23 09:51:29,806 INFO L146 ILogger]: Start removeUnreachable. Operand 178 states. [2019-05-23 09:51:29,806 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 178 states to 178 states and 265 transitions. [2019-05-23 09:51:29,806 INFO L146 ILogger]: Start accepts. Automaton has 178 states and 265 transitions. Word has length 175 [2019-05-23 09:51:29,807 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:29,807 INFO L146 ILogger]: Abstraction has 178 states and 265 transitions. [2019-05-23 09:51:29,807 INFO L146 ILogger]: Interpolant automaton has 89 states. [2019-05-23 09:51:29,807 INFO L146 ILogger]: Start isEmpty. Operand 178 states and 265 transitions. [2019-05-23 09:51:29,808 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 178 [2019-05-23 09:51:29,809 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:29,809 INFO L146 ILogger]: trace histogram [87, 87, 1, 1, 1] [2019-05-23 09:51:29,809 INFO L146 ILogger]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:29,809 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:29,810 INFO L146 ILogger]: Analyzing trace with hash 1495605336, now seen corresponding path program 87 times [2019-05-23 09:51:29,810 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:29,830 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:29,834 INFO L146 ILogger]: Trace formula consists of 356 conjuncts, 89 conjunts are in the unsatisfiable core [2019-05-23 09:51:29,837 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:32,626 INFO L146 ILogger]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:32,626 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:32,626 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2019-05-23 09:51:32,627 INFO L146 ILogger]: Interpolant automaton has 90 states [2019-05-23 09:51:32,627 INFO L146 ILogger]: Constructing interpolant automaton starting with 90 interpolants. [2019-05-23 09:51:32,627 INFO L146 ILogger]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:51:32,627 INFO L146 ILogger]: Start difference. First operand 178 states and 265 transitions. Second operand 90 states. [2019-05-23 09:51:32,925 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:32,925 INFO L146 ILogger]: Finished difference Result 180 states and 268 transitions. [2019-05-23 09:51:32,926 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-05-23 09:51:32,926 INFO L146 ILogger]: Start accepts. Automaton has 90 states. Word has length 177 [2019-05-23 09:51:32,926 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:32,927 INFO L146 ILogger]: With dead ends: 180 [2019-05-23 09:51:32,927 INFO L146 ILogger]: Without dead ends: 180 [2019-05-23 09:51:32,928 INFO L146 ILogger]: 0 DeclaredPredicates, 176 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-05-23 09:51:32,928 INFO L146 ILogger]: Start minimizeSevpa. Operand 180 states. [2019-05-23 09:51:32,930 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-05-23 09:51:32,930 INFO L146 ILogger]: Start removeUnreachable. Operand 180 states. [2019-05-23 09:51:32,930 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 180 states to 180 states and 268 transitions. [2019-05-23 09:51:32,931 INFO L146 ILogger]: Start accepts. Automaton has 180 states and 268 transitions. Word has length 177 [2019-05-23 09:51:32,931 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:32,931 INFO L146 ILogger]: Abstraction has 180 states and 268 transitions. [2019-05-23 09:51:32,931 INFO L146 ILogger]: Interpolant automaton has 90 states. [2019-05-23 09:51:32,931 INFO L146 ILogger]: Start isEmpty. Operand 180 states and 268 transitions. [2019-05-23 09:51:32,931 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 180 [2019-05-23 09:51:32,931 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:32,932 INFO L146 ILogger]: trace histogram [88, 88, 1, 1, 1] [2019-05-23 09:51:32,932 INFO L146 ILogger]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:32,932 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:32,932 INFO L146 ILogger]: Analyzing trace with hash -1537346405, now seen corresponding path program 88 times [2019-05-23 09:51:32,933 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:32,942 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:32,944 INFO L146 ILogger]: Trace formula consists of 360 conjuncts, 90 conjunts are in the unsatisfiable core [2019-05-23 09:51:32,945 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:35,557 INFO L146 ILogger]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:35,557 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:35,557 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-05-23 09:51:35,558 INFO L146 ILogger]: Interpolant automaton has 91 states [2019-05-23 09:51:35,558 INFO L146 ILogger]: Constructing interpolant automaton starting with 91 interpolants. [2019-05-23 09:51:35,558 INFO L146 ILogger]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:51:35,559 INFO L146 ILogger]: Start difference. First operand 180 states and 268 transitions. Second operand 91 states. [2019-05-23 09:51:35,847 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:35,848 INFO L146 ILogger]: Finished difference Result 182 states and 271 transitions. [2019-05-23 09:51:35,848 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-05-23 09:51:35,848 INFO L146 ILogger]: Start accepts. Automaton has 91 states. Word has length 179 [2019-05-23 09:51:35,848 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:35,849 INFO L146 ILogger]: With dead ends: 182 [2019-05-23 09:51:35,850 INFO L146 ILogger]: Without dead ends: 182 [2019-05-23 09:51:35,850 INFO L146 ILogger]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2019-05-23 09:51:35,850 INFO L146 ILogger]: Start minimizeSevpa. Operand 182 states. [2019-05-23 09:51:35,852 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 182 to 182. [2019-05-23 09:51:35,852 INFO L146 ILogger]: Start removeUnreachable. Operand 182 states. [2019-05-23 09:51:35,853 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 182 states to 182 states and 271 transitions. [2019-05-23 09:51:35,853 INFO L146 ILogger]: Start accepts. Automaton has 182 states and 271 transitions. Word has length 179 [2019-05-23 09:51:35,853 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:35,853 INFO L146 ILogger]: Abstraction has 182 states and 271 transitions. [2019-05-23 09:51:35,853 INFO L146 ILogger]: Interpolant automaton has 91 states. [2019-05-23 09:51:35,853 INFO L146 ILogger]: Start isEmpty. Operand 182 states and 271 transitions. [2019-05-23 09:51:35,854 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 182 [2019-05-23 09:51:35,854 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:35,854 INFO L146 ILogger]: trace histogram [89, 89, 1, 1, 1] [2019-05-23 09:51:35,854 INFO L146 ILogger]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:35,854 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:35,854 INFO L146 ILogger]: Analyzing trace with hash 78824478, now seen corresponding path program 89 times [2019-05-23 09:51:35,855 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:35,869 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:35,871 INFO L146 ILogger]: Trace formula consists of 364 conjuncts, 91 conjunts are in the unsatisfiable core [2019-05-23 09:51:35,873 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:38,622 INFO L146 ILogger]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:38,622 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:38,622 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2019-05-23 09:51:38,623 INFO L146 ILogger]: Interpolant automaton has 92 states [2019-05-23 09:51:38,623 INFO L146 ILogger]: Constructing interpolant automaton starting with 92 interpolants. [2019-05-23 09:51:38,623 INFO L146 ILogger]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:51:38,623 INFO L146 ILogger]: Start difference. First operand 182 states and 271 transitions. Second operand 92 states. [2019-05-23 09:51:38,934 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:38,935 INFO L146 ILogger]: Finished difference Result 184 states and 274 transitions. [2019-05-23 09:51:38,935 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-05-23 09:51:38,935 INFO L146 ILogger]: Start accepts. Automaton has 92 states. Word has length 181 [2019-05-23 09:51:38,935 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:38,936 INFO L146 ILogger]: With dead ends: 184 [2019-05-23 09:51:38,937 INFO L146 ILogger]: Without dead ends: 184 [2019-05-23 09:51:38,937 INFO L146 ILogger]: 0 DeclaredPredicates, 180 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-05-23 09:51:38,937 INFO L146 ILogger]: Start minimizeSevpa. Operand 184 states. [2019-05-23 09:51:38,939 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 184 to 184. [2019-05-23 09:51:38,939 INFO L146 ILogger]: Start removeUnreachable. Operand 184 states. [2019-05-23 09:51:38,940 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 184 states to 184 states and 274 transitions. [2019-05-23 09:51:38,940 INFO L146 ILogger]: Start accepts. Automaton has 184 states and 274 transitions. Word has length 181 [2019-05-23 09:51:38,940 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:38,940 INFO L146 ILogger]: Abstraction has 184 states and 274 transitions. [2019-05-23 09:51:38,940 INFO L146 ILogger]: Interpolant automaton has 92 states. [2019-05-23 09:51:38,940 INFO L146 ILogger]: Start isEmpty. Operand 184 states and 274 transitions. [2019-05-23 09:51:38,941 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 184 [2019-05-23 09:51:38,941 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:38,941 INFO L146 ILogger]: trace histogram [90, 90, 1, 1, 1] [2019-05-23 09:51:38,941 INFO L146 ILogger]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:38,941 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:38,941 INFO L146 ILogger]: Analyzing trace with hash -1559118111, now seen corresponding path program 90 times [2019-05-23 09:51:38,942 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:38,951 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:38,953 INFO L146 ILogger]: Trace formula consists of 368 conjuncts, 92 conjunts are in the unsatisfiable core [2019-05-23 09:51:38,955 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:41,698 INFO L146 ILogger]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:41,699 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:41,699 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2019-05-23 09:51:41,699 INFO L146 ILogger]: Interpolant automaton has 93 states [2019-05-23 09:51:41,700 INFO L146 ILogger]: Constructing interpolant automaton starting with 93 interpolants. [2019-05-23 09:51:41,700 INFO L146 ILogger]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:51:41,700 INFO L146 ILogger]: Start difference. First operand 184 states and 274 transitions. Second operand 93 states. [2019-05-23 09:51:42,045 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:42,046 INFO L146 ILogger]: Finished difference Result 186 states and 277 transitions. [2019-05-23 09:51:42,046 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-05-23 09:51:42,046 INFO L146 ILogger]: Start accepts. Automaton has 93 states. Word has length 183 [2019-05-23 09:51:42,046 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:42,047 INFO L146 ILogger]: With dead ends: 186 [2019-05-23 09:51:42,048 INFO L146 ILogger]: Without dead ends: 186 [2019-05-23 09:51:42,048 INFO L146 ILogger]: 0 DeclaredPredicates, 182 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2019-05-23 09:51:42,048 INFO L146 ILogger]: Start minimizeSevpa. Operand 186 states. [2019-05-23 09:51:42,050 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-05-23 09:51:42,051 INFO L146 ILogger]: Start removeUnreachable. Operand 186 states. [2019-05-23 09:51:42,051 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 186 states to 186 states and 277 transitions. [2019-05-23 09:51:42,051 INFO L146 ILogger]: Start accepts. Automaton has 186 states and 277 transitions. Word has length 183 [2019-05-23 09:51:42,051 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:42,051 INFO L146 ILogger]: Abstraction has 186 states and 277 transitions. [2019-05-23 09:51:42,052 INFO L146 ILogger]: Interpolant automaton has 93 states. [2019-05-23 09:51:42,052 INFO L146 ILogger]: Start isEmpty. Operand 186 states and 277 transitions. [2019-05-23 09:51:42,052 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 186 [2019-05-23 09:51:42,052 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:42,053 INFO L146 ILogger]: trace histogram [91, 91, 1, 1, 1] [2019-05-23 09:51:42,053 INFO L146 ILogger]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:42,053 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:42,053 INFO L146 ILogger]: Analyzing trace with hash 631051492, now seen corresponding path program 91 times [2019-05-23 09:51:42,054 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:42,067 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:42,070 INFO L146 ILogger]: Trace formula consists of 372 conjuncts, 93 conjunts are in the unsatisfiable core [2019-05-23 09:51:42,071 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:44,867 INFO L146 ILogger]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:44,868 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:44,868 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2019-05-23 09:51:44,868 INFO L146 ILogger]: Interpolant automaton has 94 states [2019-05-23 09:51:44,869 INFO L146 ILogger]: Constructing interpolant automaton starting with 94 interpolants. [2019-05-23 09:51:44,869 INFO L146 ILogger]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:51:44,869 INFO L146 ILogger]: Start difference. First operand 186 states and 277 transitions. Second operand 94 states. [2019-05-23 09:51:45,209 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:45,210 INFO L146 ILogger]: Finished difference Result 188 states and 280 transitions. [2019-05-23 09:51:45,210 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-05-23 09:51:45,210 INFO L146 ILogger]: Start accepts. Automaton has 94 states. Word has length 185 [2019-05-23 09:51:45,210 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:45,211 INFO L146 ILogger]: With dead ends: 188 [2019-05-23 09:51:45,211 INFO L146 ILogger]: Without dead ends: 188 [2019-05-23 09:51:45,212 INFO L146 ILogger]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-05-23 09:51:45,212 INFO L146 ILogger]: Start minimizeSevpa. Operand 188 states. [2019-05-23 09:51:45,214 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-05-23 09:51:45,214 INFO L146 ILogger]: Start removeUnreachable. Operand 188 states. [2019-05-23 09:51:45,215 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 188 states to 188 states and 280 transitions. [2019-05-23 09:51:45,215 INFO L146 ILogger]: Start accepts. Automaton has 188 states and 280 transitions. Word has length 185 [2019-05-23 09:51:45,215 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:45,215 INFO L146 ILogger]: Abstraction has 188 states and 280 transitions. [2019-05-23 09:51:45,215 INFO L146 ILogger]: Interpolant automaton has 94 states. [2019-05-23 09:51:45,215 INFO L146 ILogger]: Start isEmpty. Operand 188 states and 280 transitions. [2019-05-23 09:51:45,216 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 188 [2019-05-23 09:51:45,216 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:45,216 INFO L146 ILogger]: trace histogram [92, 92, 1, 1, 1] [2019-05-23 09:51:45,217 INFO L146 ILogger]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:45,217 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:45,217 INFO L146 ILogger]: Analyzing trace with hash 850064935, now seen corresponding path program 92 times [2019-05-23 09:51:45,217 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:45,232 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:45,234 INFO L146 ILogger]: Trace formula consists of 376 conjuncts, 94 conjunts are in the unsatisfiable core [2019-05-23 09:51:45,236 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:48,125 INFO L146 ILogger]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:48,125 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:48,125 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2019-05-23 09:51:48,125 INFO L146 ILogger]: Interpolant automaton has 95 states [2019-05-23 09:51:48,126 INFO L146 ILogger]: Constructing interpolant automaton starting with 95 interpolants. [2019-05-23 09:51:48,126 INFO L146 ILogger]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:51:48,126 INFO L146 ILogger]: Start difference. First operand 188 states and 280 transitions. Second operand 95 states. [2019-05-23 09:51:48,479 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:48,480 INFO L146 ILogger]: Finished difference Result 190 states and 283 transitions. [2019-05-23 09:51:48,480 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-05-23 09:51:48,480 INFO L146 ILogger]: Start accepts. Automaton has 95 states. Word has length 187 [2019-05-23 09:51:48,480 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:48,481 INFO L146 ILogger]: With dead ends: 190 [2019-05-23 09:51:48,482 INFO L146 ILogger]: Without dead ends: 190 [2019-05-23 09:51:48,482 INFO L146 ILogger]: 0 DeclaredPredicates, 186 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2019-05-23 09:51:48,482 INFO L146 ILogger]: Start minimizeSevpa. Operand 190 states. [2019-05-23 09:51:48,484 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 190 to 190. [2019-05-23 09:51:48,484 INFO L146 ILogger]: Start removeUnreachable. Operand 190 states. [2019-05-23 09:51:48,485 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 190 states to 190 states and 283 transitions. [2019-05-23 09:51:48,485 INFO L146 ILogger]: Start accepts. Automaton has 190 states and 283 transitions. Word has length 187 [2019-05-23 09:51:48,485 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:48,485 INFO L146 ILogger]: Abstraction has 190 states and 283 transitions. [2019-05-23 09:51:48,485 INFO L146 ILogger]: Interpolant automaton has 95 states. [2019-05-23 09:51:48,485 INFO L146 ILogger]: Start isEmpty. Operand 190 states and 283 transitions. [2019-05-23 09:51:48,486 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 190 [2019-05-23 09:51:48,486 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:48,486 INFO L146 ILogger]: trace histogram [93, 93, 1, 1, 1] [2019-05-23 09:51:48,486 INFO L146 ILogger]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:48,487 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:48,487 INFO L146 ILogger]: Analyzing trace with hash 868586154, now seen corresponding path program 93 times [2019-05-23 09:51:48,487 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:48,502 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:48,504 INFO L146 ILogger]: Trace formula consists of 380 conjuncts, 95 conjunts are in the unsatisfiable core [2019-05-23 09:51:48,506 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:51,419 INFO L146 ILogger]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:51,419 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:51,419 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2019-05-23 09:51:51,419 INFO L146 ILogger]: Interpolant automaton has 96 states [2019-05-23 09:51:51,420 INFO L146 ILogger]: Constructing interpolant automaton starting with 96 interpolants. [2019-05-23 09:51:51,420 INFO L146 ILogger]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:51:51,420 INFO L146 ILogger]: Start difference. First operand 190 states and 283 transitions. Second operand 96 states. [2019-05-23 09:51:51,762 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:51,762 INFO L146 ILogger]: Finished difference Result 192 states and 286 transitions. [2019-05-23 09:51:51,762 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-05-23 09:51:51,763 INFO L146 ILogger]: Start accepts. Automaton has 96 states. Word has length 189 [2019-05-23 09:51:51,763 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:51,764 INFO L146 ILogger]: With dead ends: 192 [2019-05-23 09:51:51,764 INFO L146 ILogger]: Without dead ends: 192 [2019-05-23 09:51:51,765 INFO L146 ILogger]: 0 DeclaredPredicates, 188 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-05-23 09:51:51,765 INFO L146 ILogger]: Start minimizeSevpa. Operand 192 states. [2019-05-23 09:51:51,767 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 192 to 192. [2019-05-23 09:51:51,767 INFO L146 ILogger]: Start removeUnreachable. Operand 192 states. [2019-05-23 09:51:51,767 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2019-05-23 09:51:51,767 INFO L146 ILogger]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 189 [2019-05-23 09:51:51,767 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:51,768 INFO L146 ILogger]: Abstraction has 192 states and 286 transitions. [2019-05-23 09:51:51,768 INFO L146 ILogger]: Interpolant automaton has 96 states. [2019-05-23 09:51:51,768 INFO L146 ILogger]: Start isEmpty. Operand 192 states and 286 transitions. [2019-05-23 09:51:51,768 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 192 [2019-05-23 09:51:51,768 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:51,768 INFO L146 ILogger]: trace histogram [94, 94, 1, 1, 1] [2019-05-23 09:51:51,769 INFO L146 ILogger]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:51,769 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:51,769 INFO L146 ILogger]: Analyzing trace with hash 1487608429, now seen corresponding path program 94 times [2019-05-23 09:51:51,769 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:51,783 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:51,785 INFO L146 ILogger]: Trace formula consists of 384 conjuncts, 96 conjunts are in the unsatisfiable core [2019-05-23 09:51:51,786 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:55,250 INFO L146 ILogger]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:55,251 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:55,251 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2019-05-23 09:51:55,251 INFO L146 ILogger]: Interpolant automaton has 97 states [2019-05-23 09:51:55,252 INFO L146 ILogger]: Constructing interpolant automaton starting with 97 interpolants. [2019-05-23 09:51:55,252 INFO L146 ILogger]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:51:55,252 INFO L146 ILogger]: Start difference. First operand 192 states and 286 transitions. Second operand 97 states. [2019-05-23 09:51:55,628 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:55,628 INFO L146 ILogger]: Finished difference Result 194 states and 289 transitions. [2019-05-23 09:51:55,629 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-05-23 09:51:55,629 INFO L146 ILogger]: Start accepts. Automaton has 97 states. Word has length 191 [2019-05-23 09:51:55,629 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:55,630 INFO L146 ILogger]: With dead ends: 194 [2019-05-23 09:51:55,630 INFO L146 ILogger]: Without dead ends: 194 [2019-05-23 09:51:55,630 INFO L146 ILogger]: 0 DeclaredPredicates, 190 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2019-05-23 09:51:55,630 INFO L146 ILogger]: Start minimizeSevpa. Operand 194 states. [2019-05-23 09:51:55,632 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 194 to 194. [2019-05-23 09:51:55,632 INFO L146 ILogger]: Start removeUnreachable. Operand 194 states. [2019-05-23 09:51:55,633 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 194 states to 194 states and 289 transitions. [2019-05-23 09:51:55,633 INFO L146 ILogger]: Start accepts. Automaton has 194 states and 289 transitions. Word has length 191 [2019-05-23 09:51:55,633 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:55,633 INFO L146 ILogger]: Abstraction has 194 states and 289 transitions. [2019-05-23 09:51:55,633 INFO L146 ILogger]: Interpolant automaton has 97 states. [2019-05-23 09:51:55,633 INFO L146 ILogger]: Start isEmpty. Operand 194 states and 289 transitions. [2019-05-23 09:51:55,634 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 194 [2019-05-23 09:51:55,634 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:55,634 INFO L146 ILogger]: trace histogram [95, 95, 1, 1, 1] [2019-05-23 09:51:55,634 INFO L146 ILogger]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:55,634 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:55,634 INFO L146 ILogger]: Analyzing trace with hash -632439440, now seen corresponding path program 95 times [2019-05-23 09:51:55,635 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:55,645 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:55,646 INFO L146 ILogger]: Trace formula consists of 388 conjuncts, 97 conjunts are in the unsatisfiable core [2019-05-23 09:51:55,648 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:51:58,684 INFO L146 ILogger]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:51:58,684 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:51:58,684 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2019-05-23 09:51:58,685 INFO L146 ILogger]: Interpolant automaton has 98 states [2019-05-23 09:51:58,685 INFO L146 ILogger]: Constructing interpolant automaton starting with 98 interpolants. [2019-05-23 09:51:58,685 INFO L146 ILogger]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:51:58,685 INFO L146 ILogger]: Start difference. First operand 194 states and 289 transitions. Second operand 98 states. [2019-05-23 09:51:59,146 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:51:59,146 INFO L146 ILogger]: Finished difference Result 196 states and 292 transitions. [2019-05-23 09:51:59,146 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-05-23 09:51:59,146 INFO L146 ILogger]: Start accepts. Automaton has 98 states. Word has length 193 [2019-05-23 09:51:59,147 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:51:59,148 INFO L146 ILogger]: With dead ends: 196 [2019-05-23 09:51:59,148 INFO L146 ILogger]: Without dead ends: 196 [2019-05-23 09:51:59,149 INFO L146 ILogger]: 0 DeclaredPredicates, 192 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-05-23 09:51:59,149 INFO L146 ILogger]: Start minimizeSevpa. Operand 196 states. [2019-05-23 09:51:59,150 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-05-23 09:51:59,150 INFO L146 ILogger]: Start removeUnreachable. Operand 196 states. [2019-05-23 09:51:59,151 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 196 states to 196 states and 292 transitions. [2019-05-23 09:51:59,151 INFO L146 ILogger]: Start accepts. Automaton has 196 states and 292 transitions. Word has length 193 [2019-05-23 09:51:59,151 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:51:59,151 INFO L146 ILogger]: Abstraction has 196 states and 292 transitions. [2019-05-23 09:51:59,151 INFO L146 ILogger]: Interpolant automaton has 98 states. [2019-05-23 09:51:59,151 INFO L146 ILogger]: Start isEmpty. Operand 196 states and 292 transitions. [2019-05-23 09:51:59,152 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 196 [2019-05-23 09:51:59,152 INFO L146 ILogger]: Found error trace [2019-05-23 09:51:59,152 INFO L146 ILogger]: trace histogram [96, 96, 1, 1, 1] [2019-05-23 09:51:59,153 INFO L146 ILogger]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:51:59,153 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:51:59,153 INFO L146 ILogger]: Analyzing trace with hash 2111024051, now seen corresponding path program 96 times [2019-05-23 09:51:59,153 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:51:59,164 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:51:59,166 INFO L146 ILogger]: Trace formula consists of 392 conjuncts, 98 conjunts are in the unsatisfiable core [2019-05-23 09:51:59,167 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:02,249 INFO L146 ILogger]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:02,249 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:02,249 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-05-23 09:52:02,249 INFO L146 ILogger]: Interpolant automaton has 99 states [2019-05-23 09:52:02,250 INFO L146 ILogger]: Constructing interpolant automaton starting with 99 interpolants. [2019-05-23 09:52:02,250 INFO L146 ILogger]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:52:02,250 INFO L146 ILogger]: Start difference. First operand 196 states and 292 transitions. Second operand 99 states. [2019-05-23 09:52:02,633 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:02,634 INFO L146 ILogger]: Finished difference Result 198 states and 295 transitions. [2019-05-23 09:52:02,634 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-05-23 09:52:02,634 INFO L146 ILogger]: Start accepts. Automaton has 99 states. Word has length 195 [2019-05-23 09:52:02,634 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:02,635 INFO L146 ILogger]: With dead ends: 198 [2019-05-23 09:52:02,635 INFO L146 ILogger]: Without dead ends: 198 [2019-05-23 09:52:02,636 INFO L146 ILogger]: 0 DeclaredPredicates, 194 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2019-05-23 09:52:02,636 INFO L146 ILogger]: Start minimizeSevpa. Operand 198 states. [2019-05-23 09:52:02,638 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 198 to 198. [2019-05-23 09:52:02,638 INFO L146 ILogger]: Start removeUnreachable. Operand 198 states. [2019-05-23 09:52:02,638 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 198 states to 198 states and 295 transitions. [2019-05-23 09:52:02,638 INFO L146 ILogger]: Start accepts. Automaton has 198 states and 295 transitions. Word has length 195 [2019-05-23 09:52:02,639 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:02,639 INFO L146 ILogger]: Abstraction has 198 states and 295 transitions. [2019-05-23 09:52:02,639 INFO L146 ILogger]: Interpolant automaton has 99 states. [2019-05-23 09:52:02,639 INFO L146 ILogger]: Start isEmpty. Operand 198 states and 295 transitions. [2019-05-23 09:52:02,640 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 198 [2019-05-23 09:52:02,640 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:02,640 INFO L146 ILogger]: trace histogram [97, 97, 1, 1, 1] [2019-05-23 09:52:02,640 INFO L146 ILogger]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:02,640 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:02,640 INFO L146 ILogger]: Analyzing trace with hash 1469519158, now seen corresponding path program 97 times [2019-05-23 09:52:02,641 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:02,656 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:02,659 INFO L146 ILogger]: Trace formula consists of 396 conjuncts, 99 conjunts are in the unsatisfiable core [2019-05-23 09:52:02,661 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:05,800 INFO L146 ILogger]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:05,800 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:05,800 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2019-05-23 09:52:05,800 INFO L146 ILogger]: Interpolant automaton has 100 states [2019-05-23 09:52:05,801 INFO L146 ILogger]: Constructing interpolant automaton starting with 100 interpolants. [2019-05-23 09:52:05,801 INFO L146 ILogger]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:52:05,801 INFO L146 ILogger]: Start difference. First operand 198 states and 295 transitions. Second operand 100 states. [2019-05-23 09:52:06,230 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:06,230 INFO L146 ILogger]: Finished difference Result 200 states and 298 transitions. [2019-05-23 09:52:06,230 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-05-23 09:52:06,231 INFO L146 ILogger]: Start accepts. Automaton has 100 states. Word has length 197 [2019-05-23 09:52:06,231 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:06,232 INFO L146 ILogger]: With dead ends: 200 [2019-05-23 09:52:06,232 INFO L146 ILogger]: Without dead ends: 200 [2019-05-23 09:52:06,233 INFO L146 ILogger]: 0 DeclaredPredicates, 196 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-05-23 09:52:06,233 INFO L146 ILogger]: Start minimizeSevpa. Operand 200 states. [2019-05-23 09:52:06,235 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-05-23 09:52:06,235 INFO L146 ILogger]: Start removeUnreachable. Operand 200 states. [2019-05-23 09:52:06,235 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 200 states to 200 states and 298 transitions. [2019-05-23 09:52:06,236 INFO L146 ILogger]: Start accepts. Automaton has 200 states and 298 transitions. Word has length 197 [2019-05-23 09:52:06,236 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:06,236 INFO L146 ILogger]: Abstraction has 200 states and 298 transitions. [2019-05-23 09:52:06,236 INFO L146 ILogger]: Interpolant automaton has 100 states. [2019-05-23 09:52:06,236 INFO L146 ILogger]: Start isEmpty. Operand 200 states and 298 transitions. [2019-05-23 09:52:06,236 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 200 [2019-05-23 09:52:06,237 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:06,237 INFO L146 ILogger]: trace histogram [98, 98, 1, 1, 1] [2019-05-23 09:52:06,237 INFO L146 ILogger]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:06,237 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:06,237 INFO L146 ILogger]: Analyzing trace with hash -836359687, now seen corresponding path program 98 times [2019-05-23 09:52:06,238 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:06,248 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:06,250 INFO L146 ILogger]: Trace formula consists of 400 conjuncts, 100 conjunts are in the unsatisfiable core [2019-05-23 09:52:06,251 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:09,443 INFO L146 ILogger]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:09,443 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:09,443 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2019-05-23 09:52:09,444 INFO L146 ILogger]: Interpolant automaton has 101 states [2019-05-23 09:52:09,444 INFO L146 ILogger]: Constructing interpolant automaton starting with 101 interpolants. [2019-05-23 09:52:09,444 INFO L146 ILogger]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:52:09,444 INFO L146 ILogger]: Start difference. First operand 200 states and 298 transitions. Second operand 101 states. [2019-05-23 09:52:09,888 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:09,888 INFO L146 ILogger]: Finished difference Result 202 states and 301 transitions. [2019-05-23 09:52:09,888 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-05-23 09:52:09,888 INFO L146 ILogger]: Start accepts. Automaton has 101 states. Word has length 199 [2019-05-23 09:52:09,889 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:09,890 INFO L146 ILogger]: With dead ends: 202 [2019-05-23 09:52:09,890 INFO L146 ILogger]: Without dead ends: 202 [2019-05-23 09:52:09,890 INFO L146 ILogger]: 0 DeclaredPredicates, 198 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2019-05-23 09:52:09,891 INFO L146 ILogger]: Start minimizeSevpa. Operand 202 states. [2019-05-23 09:52:09,893 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 202 to 202. [2019-05-23 09:52:09,893 INFO L146 ILogger]: Start removeUnreachable. Operand 202 states. [2019-05-23 09:52:09,893 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 202 states to 202 states and 301 transitions. [2019-05-23 09:52:09,893 INFO L146 ILogger]: Start accepts. Automaton has 202 states and 301 transitions. Word has length 199 [2019-05-23 09:52:09,893 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:09,894 INFO L146 ILogger]: Abstraction has 202 states and 301 transitions. [2019-05-23 09:52:09,894 INFO L146 ILogger]: Interpolant automaton has 101 states. [2019-05-23 09:52:09,894 INFO L146 ILogger]: Start isEmpty. Operand 202 states and 301 transitions. [2019-05-23 09:52:09,894 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 202 [2019-05-23 09:52:09,894 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:09,894 INFO L146 ILogger]: trace histogram [99, 99, 1, 1, 1] [2019-05-23 09:52:09,895 INFO L146 ILogger]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:09,895 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:09,895 INFO L146 ILogger]: Analyzing trace with hash -582804996, now seen corresponding path program 99 times [2019-05-23 09:52:09,895 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:09,911 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:09,913 INFO L146 ILogger]: Trace formula consists of 404 conjuncts, 101 conjunts are in the unsatisfiable core [2019-05-23 09:52:09,915 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:13,257 INFO L146 ILogger]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-05-23 09:52:13,257 INFO L146 ILogger]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-05-23 09:52:13,258 INFO L146 ILogger]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2019-05-23 09:52:13,258 INFO L146 ILogger]: Interpolant automaton has 102 states [2019-05-23 09:52:13,258 INFO L146 ILogger]: Constructing interpolant automaton starting with 102 interpolants. [2019-05-23 09:52:13,259 INFO L146 ILogger]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:52:13,259 INFO L146 ILogger]: Start difference. First operand 202 states and 301 transitions. Second operand 102 states. [2019-05-23 09:52:13,676 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:13,676 INFO L146 ILogger]: Finished difference Result 204 states and 304 transitions. [2019-05-23 09:52:13,677 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-05-23 09:52:13,677 INFO L146 ILogger]: Start accepts. Automaton has 102 states. Word has length 201 [2019-05-23 09:52:13,677 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:13,678 INFO L146 ILogger]: With dead ends: 204 [2019-05-23 09:52:13,678 INFO L146 ILogger]: Without dead ends: 204 [2019-05-23 09:52:13,679 INFO L146 ILogger]: 0 DeclaredPredicates, 200 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-05-23 09:52:13,679 INFO L146 ILogger]: Start minimizeSevpa. Operand 204 states. [2019-05-23 09:52:13,681 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 204 to 204. [2019-05-23 09:52:13,681 INFO L146 ILogger]: Start removeUnreachable. Operand 204 states. [2019-05-23 09:52:13,681 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 204 states to 204 states and 304 transitions. [2019-05-23 09:52:13,681 INFO L146 ILogger]: Start accepts. Automaton has 204 states and 304 transitions. Word has length 201 [2019-05-23 09:52:13,682 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:13,682 INFO L146 ILogger]: Abstraction has 204 states and 304 transitions. [2019-05-23 09:52:13,682 INFO L146 ILogger]: Interpolant automaton has 102 states. [2019-05-23 09:52:13,682 INFO L146 ILogger]: Start isEmpty. Operand 204 states and 304 transitions. [2019-05-23 09:52:13,682 INFO L146 ILogger]: Finished isEmpty. Found accepting run of length 204 [2019-05-23 09:52:13,683 INFO L146 ILogger]: Found error trace [2019-05-23 09:52:13,683 INFO L146 ILogger]: trace histogram [100, 100, 1, 1, 1] [2019-05-23 09:52:13,683 INFO L146 ILogger]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-05-23 09:52:13,683 INFO L146 ILogger]: Initialized classic predicate unifier [2019-05-23 09:52:13,683 INFO L146 ILogger]: Analyzing trace with hash -1729882817, now seen corresponding path program 100 times [2019-05-23 09:52:13,684 INFO L146 ILogger]: Using refinement strategy FixedRefinementStrategy [2019-05-23 09:52:13,705 INFO L146 ILogger]: Conjunction of SSA is unsat [2019-05-23 09:52:13,709 INFO L146 ILogger]: Trace formula consists of 408 conjuncts, 6 conjunts are in the unsatisfiable core [2019-05-23 09:52:13,712 INFO L146 ILogger]: Computing forward predicates... [2019-05-23 09:52:13,803 INFO L146 ILogger]: Checked inductivity of 10000 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 9801 trivial. 0 not checked. [2019-05-23 09:52:13,804 INFO L146 ILogger]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-05-23 09:52:13,804 INFO L146 ILogger]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-05-23 09:52:13,804 INFO L146 ILogger]: Interpolant automaton has 5 states [2019-05-23 09:52:13,804 INFO L146 ILogger]: Constructing interpolant automaton starting with 5 interpolants. [2019-05-23 09:52:13,805 INFO L146 ILogger]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:52:13,805 INFO L146 ILogger]: Start difference. First operand 204 states and 304 transitions. Second operand 5 states. [2019-05-23 09:52:13,817 INFO L146 ILogger]: Subtrahend was deterministic. Have not used determinization. [2019-05-23 09:52:13,818 INFO L146 ILogger]: Finished difference Result 203 states and 203 transitions. [2019-05-23 09:52:13,818 INFO L146 ILogger]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-05-23 09:52:13,818 INFO L146 ILogger]: Start accepts. Automaton has 5 states. Word has length 203 [2019-05-23 09:52:13,818 INFO L146 ILogger]: Finished accepts. some prefix is accepted. [2019-05-23 09:52:13,818 INFO L146 ILogger]: With dead ends: 203 [2019-05-23 09:52:13,818 INFO L146 ILogger]: Without dead ends: 0 [2019-05-23 09:52:13,818 INFO L146 ILogger]: 0 DeclaredPredicates, 202 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-05-23 09:52:13,819 INFO L146 ILogger]: Start minimizeSevpa. Operand 0 states. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Start removeUnreachable. Operand 0 states. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 203 [2019-05-23 09:52:13,819 INFO L146 ILogger]: Finished accepts. word is rejected. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Abstraction has 0 states and 0 transitions. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Interpolant automaton has 5 states. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Start isEmpty. Operand 0 states and 0 transitions. [2019-05-23 09:52:13,819 INFO L146 ILogger]: Finished isEmpty. No accepting run. [2019-05-23 09:52:13,823 INFO L146 ILogger]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-05-23 09:52:13,824 INFO L146 ILogger]: Adding new model CountTillBound-Jupiter.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.05 09:52:13 BasicIcfg [2019-05-23 09:52:13,824 INFO L146 ILogger]: ------------------------ END TraceAbstraction---------------------------- [2019-05-23 09:52:13,826 INFO L146 ILogger]: Toolchain (without parser) took 149534.36 ms. Allocated memory was 142.1 MB in the beginning and 594.0 MB in the end (delta: 451.9 MB). Free memory was 111.8 MB in the beginning and 282.0 MB in the end (delta: -170.1 MB). Peak memory consumption was 281.8 MB. Max. memory is 7.1 GB. [2019-05-23 09:52:13,826 INFO L146 ILogger]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory is still 112.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-05-23 09:52:13,827 INFO L146 ILogger]: Boogie Procedure Inliner took 32.11 ms. Allocated memory is still 142.1 MB. Free memory was 111.8 MB in the beginning and 109.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-05-23 09:52:13,828 INFO L146 ILogger]: Boogie Preprocessor took 19.77 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 108.7 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. [2019-05-23 09:52:13,828 INFO L146 ILogger]: RCFGBuilder took 237.90 ms. Allocated memory is still 142.1 MB. Free memory was 108.7 MB in the beginning and 99.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2019-05-23 09:52:13,829 INFO L146 ILogger]: IcfgTransformer took 28.86 ms. Allocated memory is still 142.1 MB. Free memory was 99.5 MB in the beginning and 97.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-05-23 09:52:13,829 INFO L146 ILogger]: TraceAbstraction took 149211.13 ms. Allocated memory was 142.1 MB in the beginning and 594.0 MB in the end (delta: 451.9 MB). Free memory was 97.7 MB in the beginning and 282.0 MB in the end (delta: -184.3 MB). Peak memory consumption was 267.6 MB. Max. memory is 7.1 GB. [2019-05-23 09:52:13,832 INFO L146 ILogger]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory is still 112.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.11 ms. Allocated memory is still 142.1 MB. Free memory was 111.8 MB in the beginning and 109.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.77 ms. Allocated memory is still 142.1 MB. Free memory was 109.6 MB in the beginning and 108.7 MB in the end (delta: 900.1 kB). Peak memory consumption was 900.1 kB. Max. memory is 7.1 GB. * RCFGBuilder took 237.90 ms. Allocated memory is still 142.1 MB. Free memory was 108.7 MB in the beginning and 99.5 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * IcfgTransformer took 28.86 ms. Allocated memory is still 142.1 MB. Free memory was 99.5 MB in the beginning and 97.7 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 149211.13 ms. Allocated memory was 142.1 MB in the beginning and 594.0 MB in the end (delta: 451.9 MB). Free memory was 97.7 MB in the beginning and 282.0 MB in the end (delta: -184.3 MB). Peak memory consumption was 267.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 27]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 149.1s OverallTime, 101 OverallIterations, 100 TraceHistogramMax, 16.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 502 SDtfs, 12045 SDslu, 10100 SDs, 0 SdLazy, 6771 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10302 GetRequests, 5249 SyntacticMatches, 0 SemanticMatches, 5053 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 128.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 101 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 131.2s InterpolantComputationTime, 10403 NumberOfCodeBlocks, 10403 NumberOfCodeBlocksAsserted, 101 NumberOfCheckSat, 10302 ConstructedInterpolants, 0 QuantifiedInterpolants, 4165442 SizeOfPredicates, 100 NumberOfNonLiveVariables, 21008 ConjunctsInSsa, 5156 ConjunctsInUnsatCore, 101 InterpolantComputations, 2 PerfectInterpolantSequences, 10000/338350 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...