java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:16:04,412 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:16:04,415 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:16:04,429 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:16:04,429 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:16:04,431 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:16:04,432 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:16:04,434 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:16:04,436 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:16:04,437 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:16:04,438 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:16:04,438 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:16:04,439 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:16:04,440 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:16:04,442 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:16:04,442 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:16:04,443 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:16:04,445 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:16:04,447 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:16:04,449 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:16:04,450 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:16:04,451 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:16:04,454 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:16:04,454 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:16:04,454 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:16:04,455 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:16:04,457 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:16:04,458 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:16:04,459 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:16:04,460 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:16:04,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:16:04,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:16:04,461 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:16:04,461 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:16:04,462 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:16:04,463 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:16:04,463 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:16:04,472 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:16:04,472 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:16:04,473 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:16:04,474 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:16:04,474 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:16:04,474 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:16:04,474 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:16:04,475 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:16:04,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:16:04,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:16:04,537 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:16:04,539 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:16:04,540 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:16:04,541 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl [2018-09-26 08:16:04,541 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/gj2007.c.i_4.bpl' [2018-09-26 08:16:04,608 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:16:04,612 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:16:04,613 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:04,615 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:16:04,615 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:16:04,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:16:04,657 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:16:04,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:16:04,658 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:16:04,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:16:04,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:16:04,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:16:04,678 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:16:04,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/1) ... [2018-09-26 08:16:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:16:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:16:04,947 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:16:04,948 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:04 BoogieIcfgContainer [2018-09-26 08:16:04,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:16:04,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:16:04,949 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:16:04,953 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:16:04,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:16:04" (1/2) ... [2018-09-26 08:16:04,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11542491 and model type gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:16:04, skipping insertion in model container [2018-09-26 08:16:04,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:16:04" (2/2) ... [2018-09-26 08:16:04,957 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007.c.i_4.bpl [2018-09-26 08:16:04,968 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:16:04,979 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:16:05,029 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:16:05,030 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:16:05,031 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:16:05,031 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:16:05,031 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:16:05,031 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:16:05,032 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:16:05,032 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:16:05,032 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:16:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:16:05,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:16:05,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,059 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:16:05,060 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,067 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:16:05,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,147 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:16:05,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:16:05,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:16:05,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:16:05,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:16:05,173 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:16:05,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,205 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-09-26 08:16:05,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:16:05,207 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:16:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,219 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:16:05,219 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:16:05,223 INFO L605 BasicCegarLoop]: 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 [2018-09-26 08:16:05,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:16:05,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2018-09-26 08:16:05,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:16:05,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:16:05,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2018-09-26 08:16:05,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,275 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:16:05,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:16:05,276 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:16:05,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:16:05,277 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,277 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-09-26 08:16:05,277 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1808054743, now seen corresponding path program 1 times [2018-09-26 08:16:05,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:16:05,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:16:05,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:16:05,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:16:05,311 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 4 states. [2018-09-26 08:16:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,335 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:16:05,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:16:05,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-09-26 08:16:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,338 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:16:05,338 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:16:05,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:16:05,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:16:05,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2018-09-26 08:16:05,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:16:05,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:16:05,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2018-09-26 08:16:05,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,346 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:16:05,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:16:05,347 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:16:05,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:16:05,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,348 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2018-09-26 08:16:05,349 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,349 INFO L82 PathProgramCache]: Analyzing trace with hash 576136647, now seen corresponding path program 2 times [2018-09-26 08:16:05,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,398 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:16:05,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:16:05,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:16:05,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:16:05,404 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 5 states. [2018-09-26 08:16:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,441 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:16:05,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:16:05,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-09-26 08:16:05,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,443 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:16:05,443 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:16:05,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:16:05,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:16:05,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-09-26 08:16:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:16:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:16:05,453 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2018-09-26 08:16:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,453 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:16:05,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:16:05,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:16:05,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:16:05,457 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,457 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2018-09-26 08:16:05,458 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash 999683031, now seen corresponding path program 3 times [2018-09-26 08:16:05,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,524 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:16:05,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:16:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:16:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:05,526 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-09-26 08:16:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,560 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:16:05,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:16:05,561 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-09-26 08:16:05,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,562 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:16:05,562 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:16:05,566 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:16:05,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:16:05,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-09-26 08:16:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:16:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:16:05,576 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 13 [2018-09-26 08:16:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,576 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:16:05,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:16:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:16:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:16:05,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,581 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1] [2018-09-26 08:16:05,581 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,582 INFO L82 PathProgramCache]: Analyzing trace with hash 256093127, now seen corresponding path program 4 times [2018-09-26 08:16:05,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,641 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,642 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:16:05,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:16:05,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:16:05,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:16:05,644 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 7 states. [2018-09-26 08:16:05,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,699 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:16:05,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:16:05,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-09-26 08:16:05,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,701 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:16:05,701 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:16:05,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:16:05,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:16:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-09-26 08:16:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:16:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:16:05,708 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 16 [2018-09-26 08:16:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,708 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:16:05,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:16:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:16:05,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:16:05,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,710 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1] [2018-09-26 08:16:05,710 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1410575831, now seen corresponding path program 5 times [2018-09-26 08:16:05,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:16:05,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:16:05,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:16:05,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:05,787 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 8 states. [2018-09-26 08:16:05,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,859 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:16:05,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:16:05,859 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-09-26 08:16:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,862 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:16:05,862 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:16:05,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:16:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:16:05,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-09-26 08:16:05,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:16:05,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:16:05,874 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 19 [2018-09-26 08:16:05,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,875 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:16:05,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:16:05,875 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:16:05,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:16:05,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,876 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1] [2018-09-26 08:16:05,876 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,877 INFO L82 PathProgramCache]: Analyzing trace with hash 506704327, now seen corresponding path program 6 times [2018-09-26 08:16:05,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:05,942 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:05,943 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:05,943 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:16:05,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:16:05,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:16:05,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:05,945 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-09-26 08:16:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:05,986 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:16:05,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:16:05,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-09-26 08:16:05,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:05,987 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:16:05,987 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:16:05,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:16:05,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:16:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-09-26 08:16:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:16:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:16:05,994 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 22 [2018-09-26 08:16:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:05,995 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:16:05,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:16:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:16:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:16:05,996 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:05,996 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2018-09-26 08:16:05,996 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:05,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1579292713, now seen corresponding path program 7 times [2018-09-26 08:16:05,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,064 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,064 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:16:06,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:16:06,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:16:06,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:06,067 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2018-09-26 08:16:06,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,108 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:16:06,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:16:06,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-09-26 08:16:06,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,110 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:16:06,110 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:16:06,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:16:06,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:16:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-09-26 08:16:06,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:16:06,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:16:06,118 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 25 [2018-09-26 08:16:06,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,118 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:16:06,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:16:06,119 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:16:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:16:06,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,120 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1] [2018-09-26 08:16:06,120 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1635305529, now seen corresponding path program 8 times [2018-09-26 08:16:06,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,184 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,185 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,185 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:16:06,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:16:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:16:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:06,187 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 11 states. [2018-09-26 08:16:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,221 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:16:06,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:16:06,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2018-09-26 08:16:06,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,222 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:16:06,222 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:16:06,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:16:06,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:16:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-09-26 08:16:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:16:06,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:16:06,230 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 28 [2018-09-26 08:16:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,230 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:16:06,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:16:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:16:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:16:06,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,232 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1] [2018-09-26 08:16:06,232 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash 429171159, now seen corresponding path program 9 times [2018-09-26 08:16:06,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,314 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,314 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:16:06,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:16:06,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:16:06,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:06,316 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 12 states. [2018-09-26 08:16:06,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,367 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:16:06,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:16:06,370 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-09-26 08:16:06,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,371 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:16:06,371 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:16:06,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:16:06,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:16:06,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-09-26 08:16:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:16:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:16:06,379 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 31 [2018-09-26 08:16:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,379 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:16:06,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:16:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:16:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:16:06,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,381 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1] [2018-09-26 08:16:06,381 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,382 INFO L82 PathProgramCache]: Analyzing trace with hash -677495353, now seen corresponding path program 10 times [2018-09-26 08:16:06,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,449 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:16:06,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:16:06,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:16:06,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:06,452 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 13 states. [2018-09-26 08:16:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,505 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:16:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:16:06,506 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 34 [2018-09-26 08:16:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,507 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:16:06,508 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:16:06,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:16:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:16:06,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-09-26 08:16:06,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:16:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:16:06,517 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 34 [2018-09-26 08:16:06,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,517 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:16:06,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:16:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:16:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:16:06,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,519 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1] [2018-09-26 08:16:06,519 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1210590249, now seen corresponding path program 11 times [2018-09-26 08:16:06,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,593 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,594 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,594 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:16:06,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:16:06,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:16:06,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:06,596 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 14 states. [2018-09-26 08:16:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,636 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:16:06,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:16:06,637 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-09-26 08:16:06,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,638 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:16:06,638 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:16:06,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:16:06,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:16:06,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-09-26 08:16:06,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:16:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:16:06,648 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 37 [2018-09-26 08:16:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,649 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:16:06,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:16:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:16:06,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:16:06,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,650 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1] [2018-09-26 08:16:06,651 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,651 INFO L82 PathProgramCache]: Analyzing trace with hash 148423623, now seen corresponding path program 12 times [2018-09-26 08:16:06,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,714 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,714 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:16:06,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:16:06,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:16:06,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:06,716 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2018-09-26 08:16:06,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,742 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:16:06,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:16:06,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-09-26 08:16:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,744 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:16:06,744 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:16:06,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:16:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:16:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-09-26 08:16:06,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:16:06,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:16:06,751 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 40 [2018-09-26 08:16:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,752 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:16:06,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:16:06,752 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:16:06,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:16:06,753 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,753 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1] [2018-09-26 08:16:06,754 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,754 INFO L82 PathProgramCache]: Analyzing trace with hash -2126015017, now seen corresponding path program 13 times [2018-09-26 08:16:06,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,828 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,828 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:16:06,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:16:06,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:16:06,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:06,829 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 16 states. [2018-09-26 08:16:06,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:06,860 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:16:06,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:16:06,861 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 43 [2018-09-26 08:16:06,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:06,862 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:16:06,862 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:16:06,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:16:06,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:16:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-09-26 08:16:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:16:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:16:06,870 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 43 [2018-09-26 08:16:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:06,871 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:16:06,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:16:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:16:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:16:06,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:06,872 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1] [2018-09-26 08:16:06,873 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:06,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:06,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1771489735, now seen corresponding path program 14 times [2018-09-26 08:16:06,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:06,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:06,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:16:06,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:16:06,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:16:06,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:06,956 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 17 states. [2018-09-26 08:16:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,009 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:16:07,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:16:07,010 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 46 [2018-09-26 08:16:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,011 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:16:07,011 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:16:07,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:16:07,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:16:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-26 08:16:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:16:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:16:07,021 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 46 [2018-09-26 08:16:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,022 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:16:07,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:16:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:16:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:16:07,023 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,023 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1] [2018-09-26 08:16:07,024 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2105290793, now seen corresponding path program 15 times [2018-09-26 08:16:07,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,148 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:16:07,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:16:07,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:16:07,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:07,154 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-09-26 08:16:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,208 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:16:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:16:07,208 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 49 [2018-09-26 08:16:07,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,209 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:16:07,210 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:16:07,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:16:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:16:07,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-09-26 08:16:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:16:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:16:07,225 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-09-26 08:16:07,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,225 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:16:07,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:16:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:16:07,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:16:07,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,229 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1] [2018-09-26 08:16:07,230 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,230 INFO L82 PathProgramCache]: Analyzing trace with hash 691556295, now seen corresponding path program 16 times [2018-09-26 08:16:07,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:16:07,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:16:07,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:16:07,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:07,369 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 19 states. [2018-09-26 08:16:07,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,407 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:16:07,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:16:07,408 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 52 [2018-09-26 08:16:07,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,409 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:16:07,409 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:16:07,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:16:07,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:16:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-09-26 08:16:07,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:16:07,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:16:07,420 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-09-26 08:16:07,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,421 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:16:07,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:16:07,421 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:16:07,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:16:07,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,422 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1] [2018-09-26 08:16:07,423 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,423 INFO L82 PathProgramCache]: Analyzing trace with hash -802387497, now seen corresponding path program 17 times [2018-09-26 08:16:07,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:16:07,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:16:07,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:16:07,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:07,533 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 20 states. [2018-09-26 08:16:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,566 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:16:07,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:16:07,566 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 55 [2018-09-26 08:16:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,567 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:16:07,567 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:16:07,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:16:07,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:16:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-09-26 08:16:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:16:07,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:16:07,574 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-09-26 08:16:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,574 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:16:07,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:16:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:16:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:16:07,575 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,576 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1] [2018-09-26 08:16:07,576 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1864193479, now seen corresponding path program 18 times [2018-09-26 08:16:07,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,719 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:16:07,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:16:07,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:16:07,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:07,721 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 21 states. [2018-09-26 08:16:07,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,759 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:16:07,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:16:07,759 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 58 [2018-09-26 08:16:07,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,760 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:16:07,760 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:16:07,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:16:07,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:16:07,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-09-26 08:16:07,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:16:07,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:16:07,777 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-09-26 08:16:07,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,778 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:16:07,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:16:07,778 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:16:07,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:16:07,779 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,779 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1] [2018-09-26 08:16:07,779 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,780 INFO L82 PathProgramCache]: Analyzing trace with hash -2032024617, now seen corresponding path program 19 times [2018-09-26 08:16:07,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:07,910 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:07,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:07,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:16:07,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:16:07,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:16:07,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:07,912 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 22 states. [2018-09-26 08:16:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:07,955 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:16:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:16:07,955 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 61 [2018-09-26 08:16:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:07,956 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:16:07,957 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:16:07,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:16:07,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:16:07,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-09-26 08:16:07,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:16:07,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:16:07,964 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-09-26 08:16:07,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:07,964 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:16:07,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:16:07,964 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:16:07,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:16:07,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:07,966 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1] [2018-09-26 08:16:07,966 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:07,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:07,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1520819143, now seen corresponding path program 20 times [2018-09-26 08:16:07,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:08,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:08,115 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:16:08,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:16:08,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:16:08,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:08,116 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 23 states. [2018-09-26 08:16:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:08,166 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:16:08,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:16:08,166 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 64 [2018-09-26 08:16:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:08,167 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:16:08,167 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:16:08,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:16:08,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:16:08,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-09-26 08:16:08,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:16:08,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:16:08,183 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-09-26 08:16:08,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:08,185 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:16:08,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:16:08,186 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:16:08,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:16:08,189 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:08,189 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1] [2018-09-26 08:16:08,190 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:08,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:08,190 INFO L82 PathProgramCache]: Analyzing trace with hash -884769321, now seen corresponding path program 21 times [2018-09-26 08:16:08,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:08,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:08,335 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:08,335 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:08,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:16:08,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:16:08,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:16:08,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:16:08,337 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 24 states. [2018-09-26 08:16:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:08,386 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:16:08,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:16:08,387 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-09-26 08:16:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:08,387 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:16:08,388 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:16:08,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:16:08,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:16:08,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-09-26 08:16:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:16:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:16:08,395 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-09-26 08:16:08,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:08,396 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:16:08,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:16:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:16:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:16:08,397 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:08,397 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1] [2018-09-26 08:16:08,397 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:08,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:08,398 INFO L82 PathProgramCache]: Analyzing trace with hash 53600711, now seen corresponding path program 22 times [2018-09-26 08:16:08,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:08,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:08,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:16:08,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:16:08,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:16:08,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:08,546 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 25 states. [2018-09-26 08:16:08,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:08,587 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:16:08,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:16:08,587 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 70 [2018-09-26 08:16:08,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:08,588 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:16:08,588 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:16:08,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:16:08,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:16:08,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-09-26 08:16:08,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:16:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:16:08,594 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-09-26 08:16:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:08,595 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:16:08,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:16:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:16:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:16:08,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:08,596 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1] [2018-09-26 08:16:08,596 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:08,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -906905641, now seen corresponding path program 23 times [2018-09-26 08:16:08,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:08,762 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:08,763 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:08,763 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:16:08,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:16:08,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:16:08,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:16:08,766 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 26 states. [2018-09-26 08:16:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:08,821 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:16:08,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:16:08,822 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 73 [2018-09-26 08:16:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:08,823 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:16:08,823 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:16:08,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:16:08,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:16:08,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-09-26 08:16:08,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:16:08,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:16:08,829 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-09-26 08:16:08,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:08,830 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:16:08,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:16:08,830 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:16:08,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:16:08,831 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:08,831 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1] [2018-09-26 08:16:08,832 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:08,832 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:08,832 INFO L82 PathProgramCache]: Analyzing trace with hash 2015455175, now seen corresponding path program 24 times [2018-09-26 08:16:08,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:08,988 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:08,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:08,989 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:16:08,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:16:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:16:08,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:16:08,990 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 27 states. [2018-09-26 08:16:09,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:09,027 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:16:09,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:16:09,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 76 [2018-09-26 08:16:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:09,028 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:16:09,029 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:16:09,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:16:09,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:16:09,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-09-26 08:16:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:16:09,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:16:09,034 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-09-26 08:16:09,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:09,035 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:16:09,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:16:09,035 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:16:09,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:16:09,036 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:09,036 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1] [2018-09-26 08:16:09,037 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:09,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:09,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1215532585, now seen corresponding path program 25 times [2018-09-26 08:16:09,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:09,259 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:09,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:16:09,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:16:09,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:16:09,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:16:09,261 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 28 states. [2018-09-26 08:16:09,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:09,305 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:16:09,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:16:09,306 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 79 [2018-09-26 08:16:09,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:09,306 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:16:09,306 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:16:09,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:16:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:16:09,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-09-26 08:16:09,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:16:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:16:09,311 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-09-26 08:16:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:09,312 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:16:09,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:16:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:16:09,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:16:09,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:09,313 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1] [2018-09-26 08:16:09,313 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:09,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:09,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1059820089, now seen corresponding path program 26 times [2018-09-26 08:16:09,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:09,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:09,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:09,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:16:09,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:16:09,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:16:09,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:16:09,485 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 29 states. [2018-09-26 08:16:09,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:09,529 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:16:09,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:16:09,529 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 82 [2018-09-26 08:16:09,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:09,530 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:16:09,530 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:16:09,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:16:09,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:16:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-09-26 08:16:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:16:09,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:16:09,536 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-09-26 08:16:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:09,536 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:16:09,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:16:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:16:09,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:16:09,538 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:09,538 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1] [2018-09-26 08:16:09,538 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:09,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash -793531433, now seen corresponding path program 27 times [2018-09-26 08:16:09,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:09,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:09,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:09,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:09,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:16:09,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:16:09,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:16:09,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:16:09,693 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 30 states. [2018-09-26 08:16:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:09,733 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:16:09,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:16:09,733 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 85 [2018-09-26 08:16:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:09,734 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:16:09,734 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:16:09,735 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:16:09,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:16:09,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-09-26 08:16:09,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:16:09,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:16:09,739 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-09-26 08:16:09,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:09,739 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:16:09,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:16:09,740 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:16:09,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:16:09,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:09,740 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1] [2018-09-26 08:16:09,741 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:09,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:09,741 INFO L82 PathProgramCache]: Analyzing trace with hash -592776249, now seen corresponding path program 28 times [2018-09-26 08:16:09,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:09,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:09,885 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:09,885 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:16:09,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:16:09,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:16:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:09,887 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 31 states. [2018-09-26 08:16:09,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:09,927 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:16:09,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:16:09,927 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 88 [2018-09-26 08:16:09,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:09,928 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:16:09,928 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:16:09,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:16:09,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:16:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-09-26 08:16:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:16:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:16:09,934 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-09-26 08:16:09,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:09,935 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:16:09,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:16:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:16:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:16:09,936 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:09,936 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1] [2018-09-26 08:16:09,936 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:09,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:09,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1510434263, now seen corresponding path program 29 times [2018-09-26 08:16:09,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:10,088 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:10,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:16:10,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:16:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:16:10,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:16:10,089 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2018-09-26 08:16:10,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:10,131 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:16:10,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:16:10,131 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-09-26 08:16:10,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:10,132 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:16:10,132 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:16:10,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:16:10,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:16:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-09-26 08:16:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:16:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:16:10,137 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-09-26 08:16:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:10,138 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:16:10,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:16:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:16:10,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:16:10,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:10,139 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1] [2018-09-26 08:16:10,139 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:10,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1023084089, now seen corresponding path program 30 times [2018-09-26 08:16:10,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:10,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:10,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:10,285 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:10,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:16:10,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:16:10,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:16:10,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:16:10,287 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 33 states. [2018-09-26 08:16:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:10,332 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:16:10,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:16:10,332 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 94 [2018-09-26 08:16:10,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:10,334 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:16:10,334 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:16:10,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:16:10,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:16:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-09-26 08:16:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:16:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:16:10,342 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-09-26 08:16:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:10,342 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:16:10,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:16:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:16:10,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:16:10,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:10,344 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1] [2018-09-26 08:16:10,344 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:10,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:10,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1608015913, now seen corresponding path program 31 times [2018-09-26 08:16:10,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:10,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:10,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:10,515 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:16:10,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:16:10,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:16:10,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:16:10,517 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 34 states. [2018-09-26 08:16:10,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:10,593 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:16:10,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:16:10,593 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 97 [2018-09-26 08:16:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:10,594 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:16:10,594 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:16:10,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:16:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:16:10,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-09-26 08:16:10,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:16:10,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:16:10,601 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-09-26 08:16:10,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:10,602 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:16:10,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:16:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:16:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:16:10,604 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:10,604 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1] [2018-09-26 08:16:10,604 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:10,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1665302471, now seen corresponding path program 32 times [2018-09-26 08:16:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:10,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:10,792 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:10,792 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:16:10,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:16:10,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:16:10,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:16:10,797 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 35 states. [2018-09-26 08:16:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:10,848 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:16:10,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:16:10,848 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 100 [2018-09-26 08:16:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:10,849 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:16:10,849 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:16:10,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:16:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:16:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-09-26 08:16:10,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:16:10,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:16:10,856 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-09-26 08:16:10,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:10,856 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:16:10,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:16:10,856 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:16:10,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:16:10,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:10,858 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1] [2018-09-26 08:16:10,858 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:10,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash -139175465, now seen corresponding path program 33 times [2018-09-26 08:16:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:11,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:11,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:16:11,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:16:11,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:16:11,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:16:11,100 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 36 states. [2018-09-26 08:16:11,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:11,146 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:16:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:16:11,147 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 103 [2018-09-26 08:16:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:11,148 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:16:11,148 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:16:11,149 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:16:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:16:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-09-26 08:16:11,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:16:11,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:16:11,154 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-09-26 08:16:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:11,155 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:16:11,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:16:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:16:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:16:11,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:11,156 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1] [2018-09-26 08:16:11,156 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:11,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:11,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1530690105, now seen corresponding path program 34 times [2018-09-26 08:16:11,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:11,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:11,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:11,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:16:11,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:16:11,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:16:11,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:11,428 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 37 states. [2018-09-26 08:16:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:11,484 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:16:11,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:16:11,485 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 106 [2018-09-26 08:16:11,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:11,486 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:16:11,486 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:16:11,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:16:11,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:16:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-09-26 08:16:11,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:16:11,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:16:11,493 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-09-26 08:16:11,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:11,494 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:16:11,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:16:11,494 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:16:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:16:11,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:11,495 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1] [2018-09-26 08:16:11,495 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:11,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1118989353, now seen corresponding path program 35 times [2018-09-26 08:16:11,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:11,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:11,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:11,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:16:11,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:16:11,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:16:11,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:16:11,764 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 38 states. [2018-09-26 08:16:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:11,809 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:16:11,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:16:11,810 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 109 [2018-09-26 08:16:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:11,811 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:16:11,811 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:16:11,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:16:11,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:16:11,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-09-26 08:16:11,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:16:11,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:16:11,816 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-09-26 08:16:11,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:11,817 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:16:11,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:16:11,817 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:16:11,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:16:11,818 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:11,818 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1] [2018-09-26 08:16:11,818 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:11,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:11,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1726483399, now seen corresponding path program 36 times [2018-09-26 08:16:11,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:12,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:12,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:12,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:16:12,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:16:12,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:16:12,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:16:12,012 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 39 states. [2018-09-26 08:16:12,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:12,070 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:16:12,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:16:12,070 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 112 [2018-09-26 08:16:12,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:12,071 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:16:12,071 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:16:12,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:16:12,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:16:12,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-09-26 08:16:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:16:12,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:16:12,080 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-09-26 08:16:12,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:12,081 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:16:12,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:16:12,081 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:16:12,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:16:12,082 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:12,084 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1] [2018-09-26 08:16:12,084 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:12,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:12,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1435717079, now seen corresponding path program 37 times [2018-09-26 08:16:12,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:12,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:12,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:12,306 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:12,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:16:12,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:16:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:16:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:16:12,308 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 40 states. [2018-09-26 08:16:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:12,377 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:16:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:16:12,377 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 115 [2018-09-26 08:16:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:12,378 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:16:12,378 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:16:12,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:16:12,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:16:12,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-09-26 08:16:12,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:16:12,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:16:12,386 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-09-26 08:16:12,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:12,387 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:16:12,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:16:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:16:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:16:12,388 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:12,389 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1] [2018-09-26 08:16:12,389 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:12,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:12,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2129653305, now seen corresponding path program 38 times [2018-09-26 08:16:12,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:12,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:12,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:12,614 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:12,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:16:12,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:16:12,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:16:12,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:16:12,617 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 41 states. [2018-09-26 08:16:12,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:12,679 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:16:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:16:12,679 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 118 [2018-09-26 08:16:12,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:12,680 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:16:12,680 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:16:12,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:16:12,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:16:12,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-09-26 08:16:12,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:16:12,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:16:12,687 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-09-26 08:16:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:12,687 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:16:12,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:16:12,688 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:16:12,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:16:12,689 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:12,689 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1] [2018-09-26 08:16:12,689 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:12,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:12,690 INFO L82 PathProgramCache]: Analyzing trace with hash 757434327, now seen corresponding path program 39 times [2018-09-26 08:16:12,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:12,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:12,927 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:12,927 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:16:12,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:16:12,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:16:12,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:16:12,929 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 42 states. [2018-09-26 08:16:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:12,996 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:16:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:16:12,996 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 121 [2018-09-26 08:16:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:12,998 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:16:12,998 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:16:12,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:16:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:16:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-09-26 08:16:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:16:13,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:16:13,006 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-09-26 08:16:13,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:13,006 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:16:13,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:16:13,007 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:16:13,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:16:13,008 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:13,008 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1] [2018-09-26 08:16:13,009 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:13,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:13,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1029990457, now seen corresponding path program 40 times [2018-09-26 08:16:13,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:13,256 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:13,256 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:16:13,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:16:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:16:13,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:16:13,258 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 43 states. [2018-09-26 08:16:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:13,324 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:16:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:16:13,325 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 124 [2018-09-26 08:16:13,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:13,326 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:16:13,326 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:16:13,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:16:13,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:16:13,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-09-26 08:16:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:16:13,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:16:13,332 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-09-26 08:16:13,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:13,333 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:16:13,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:16:13,333 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:16:13,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:16:13,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:13,334 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1] [2018-09-26 08:16:13,334 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:13,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:13,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1197194793, now seen corresponding path program 41 times [2018-09-26 08:16:13,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:13,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:13,598 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:13,598 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:16:13,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:16:13,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:16:13,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:16:13,600 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 44 states. [2018-09-26 08:16:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:13,674 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:16:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:16:13,675 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 127 [2018-09-26 08:16:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:13,676 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:16:13,676 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:16:13,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:16:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:16:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-09-26 08:16:13,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:16:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:16:13,683 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-09-26 08:16:13,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:13,684 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:16:13,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:16:13,684 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:16:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:16:13,685 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:13,685 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1] [2018-09-26 08:16:13,686 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:13,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:13,686 INFO L82 PathProgramCache]: Analyzing trace with hash -219505209, now seen corresponding path program 42 times [2018-09-26 08:16:13,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:13,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:13,988 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:13,988 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:16:13,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:16:13,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:16:13,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:16:13,991 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 45 states. [2018-09-26 08:16:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,077 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:16:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:16:14,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 130 [2018-09-26 08:16:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,079 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:16:14,079 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:16:14,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:16:14,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:16:14,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-09-26 08:16:14,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:16:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:16:14,088 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-09-26 08:16:14,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,088 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:16:14,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:16:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:16:14,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:16:14,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,090 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1] [2018-09-26 08:16:14,090 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1957657559, now seen corresponding path program 43 times [2018-09-26 08:16:14,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,423 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,423 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:16:14,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:16:14,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:16:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:16:14,425 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 46 states. [2018-09-26 08:16:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,503 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:16:14,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:16:14,504 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 133 [2018-09-26 08:16:14,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,505 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:16:14,505 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:16:14,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:16:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:16:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-09-26 08:16:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:16:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:16:14,512 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-09-26 08:16:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,512 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:16:14,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:16:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:16:14,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:16:14,514 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,514 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1] [2018-09-26 08:16:14,514 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,515 INFO L82 PathProgramCache]: Analyzing trace with hash -782425145, now seen corresponding path program 44 times [2018-09-26 08:16:14,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:14,783 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:14,784 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:16:14,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:16:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:16:14,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:16:14,786 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 47 states. [2018-09-26 08:16:14,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:14,848 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:16:14,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:16:14,849 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 136 [2018-09-26 08:16:14,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:14,850 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:16:14,850 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:16:14,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:16:14,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:16:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-09-26 08:16:14,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:16:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:16:14,857 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-09-26 08:16:14,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:14,858 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:16:14,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:16:14,858 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:16:14,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:16:14,860 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:14,860 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1] [2018-09-26 08:16:14,860 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:14,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:14,861 INFO L82 PathProgramCache]: Analyzing trace with hash -437832233, now seen corresponding path program 45 times [2018-09-26 08:16:14,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,158 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:16:15,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:16:15,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:16:15,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:16:15,159 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 48 states. [2018-09-26 08:16:15,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,243 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:16:15,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:16:15,243 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 139 [2018-09-26 08:16:15,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,244 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:16:15,244 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:16:15,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:16:15,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:16:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-09-26 08:16:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:16:15,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:16:15,252 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-09-26 08:16:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,252 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:16:15,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:16:15,252 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:16:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:16:15,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,257 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1] [2018-09-26 08:16:15,257 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 357771719, now seen corresponding path program 46 times [2018-09-26 08:16:15,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,524 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:16:15,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:16:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:16:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:16:15,526 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 49 states. [2018-09-26 08:16:15,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,609 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:16:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:16:15,609 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 142 [2018-09-26 08:16:15,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,610 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:16:15,611 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:16:15,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:16:15,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:16:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-09-26 08:16:15,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:16:15,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:16:15,618 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-09-26 08:16:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:15,618 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:16:15,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:16:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:16:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:16:15,620 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:15,620 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1] [2018-09-26 08:16:15,620 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:15,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:15,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1729400873, now seen corresponding path program 47 times [2018-09-26 08:16:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:15,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:15,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:16:15,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:16:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:16:15,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:16:15,913 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 50 states. [2018-09-26 08:16:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:15,996 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:16:15,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:16:15,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 145 [2018-09-26 08:16:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:15,998 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:16:15,998 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:16:15,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:16:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:16:16,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-09-26 08:16:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:16:16,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:16:16,008 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-09-26 08:16:16,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,008 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:16:16,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:16:16,008 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:16:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:16:16,010 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,010 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1] [2018-09-26 08:16:16,010 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1848422343, now seen corresponding path program 48 times [2018-09-26 08:16:16,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:16:16,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:16:16,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:16:16,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:16:16,297 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 51 states. [2018-09-26 08:16:16,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,384 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:16:16,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:16:16,384 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 148 [2018-09-26 08:16:16,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,386 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:16:16,386 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:16:16,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:16:16,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:16:16,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-09-26 08:16:16,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:16:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:16:16,393 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-09-26 08:16:16,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,394 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:16:16,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:16:16,394 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:16:16,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:16:16,395 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,396 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1] [2018-09-26 08:16:16,396 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash 576465367, now seen corresponding path program 49 times [2018-09-26 08:16:16,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:16,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:16,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:16:16,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:16:16,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:16:16,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:16:16,668 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 52 states. [2018-09-26 08:16:16,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:16,746 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:16:16,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:16:16,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 151 [2018-09-26 08:16:16,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:16,748 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:16:16,748 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:16:16,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:16:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:16:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-09-26 08:16:16,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:16:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:16:16,756 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-09-26 08:16:16,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:16,757 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:16:16,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:16:16,757 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:16:16,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:16:16,759 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:16,760 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1] [2018-09-26 08:16:16,760 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:16,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:16,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2092321337, now seen corresponding path program 50 times [2018-09-26 08:16:16,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:17,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:17,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:17,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:16:17,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:16:17,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:16:17,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:16:17,108 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 53 states. [2018-09-26 08:16:17,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:17,254 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:16:17,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:16:17,254 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 154 [2018-09-26 08:16:17,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:17,256 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:16:17,256 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:16:17,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:16:17,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:16:17,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-09-26 08:16:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:16:17,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:16:17,267 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-09-26 08:16:17,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:17,268 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:16:17,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:16:17,268 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:16:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:16:17,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:17,272 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1, 1] [2018-09-26 08:16:17,273 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:17,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:17,273 INFO L82 PathProgramCache]: Analyzing trace with hash 517563351, now seen corresponding path program 51 times [2018-09-26 08:16:17,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:17,549 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:17,549 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:16:17,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:16:17,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:16:17,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:16:17,552 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 54 states. [2018-09-26 08:16:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:17,650 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:16:17,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:16:17,650 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 157 [2018-09-26 08:16:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:17,652 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:16:17,652 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:16:17,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:16:17,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:16:17,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-09-26 08:16:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:16:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:16:17,660 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-09-26 08:16:17,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:17,660 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:16:17,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:16:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:16:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:16:17,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:17,663 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1, 1] [2018-09-26 08:16:17,663 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:17,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash -200655929, now seen corresponding path program 52 times [2018-09-26 08:16:17,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:18,274 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:18,274 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:16:18,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:16:18,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:16:18,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:16:18,276 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 55 states. [2018-09-26 08:16:19,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:19,182 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:16:19,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:16:19,182 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 160 [2018-09-26 08:16:19,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:19,184 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:16:19,184 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:16:19,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=2760, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:16:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:16:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-09-26 08:16:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:16:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:16:19,196 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-09-26 08:16:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:19,203 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:16:19,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:16:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:16:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:16:19,205 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:19,205 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1, 1] [2018-09-26 08:16:19,206 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:19,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash 855842263, now seen corresponding path program 53 times [2018-09-26 08:16:19,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:19,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:19,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:19,772 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:19,772 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:16:19,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:16:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:16:19,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:16:19,774 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 56 states. [2018-09-26 08:16:20,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:20,684 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:16:20,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:16:20,684 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 163 [2018-09-26 08:16:20,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:20,686 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:16:20,686 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:16:20,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=214, Invalid=2866, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:16:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:16:20,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-09-26 08:16:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:16:20,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:16:20,699 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-09-26 08:16:20,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:20,699 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:16:20,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:16:20,699 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:16:20,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:16:20,701 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:20,701 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1, 1] [2018-09-26 08:16:20,701 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:20,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:20,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1473135047, now seen corresponding path program 54 times [2018-09-26 08:16:20,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:21,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:21,264 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:21,264 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:16:21,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:16:21,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:16:21,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:16:21,267 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 57 states. [2018-09-26 08:16:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:22,074 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:16:22,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:16:22,074 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 166 [2018-09-26 08:16:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:22,076 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:16:22,076 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:16:22,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=218, Invalid=2974, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:16:22,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:16:22,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-09-26 08:16:22,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:16:22,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:16:22,089 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-09-26 08:16:22,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:22,089 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:16:22,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:16:22,090 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:16:22,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:16:22,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:22,092 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1, 1] [2018-09-26 08:16:22,092 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:22,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:22,092 INFO L82 PathProgramCache]: Analyzing trace with hash 192501719, now seen corresponding path program 55 times [2018-09-26 08:16:22,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:22,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:22,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:16:22,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:16:22,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:16:22,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:16:22,583 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 58 states. [2018-09-26 08:16:23,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:23,354 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:16:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:16:23,354 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 169 [2018-09-26 08:16:23,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:23,356 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:16:23,356 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:16:23,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=222, Invalid=3084, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:16:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:16:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-09-26 08:16:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:16:23,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:16:23,371 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-09-26 08:16:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:23,372 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:16:23,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:16:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:16:23,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:16:23,373 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:23,374 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1, 1] [2018-09-26 08:16:23,374 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:23,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:23,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1039517639, now seen corresponding path program 56 times [2018-09-26 08:16:23,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:23,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:23,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:23,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:16:23,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:16:23,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:16:23,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:16:23,901 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 59 states. [2018-09-26 08:16:24,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:24,735 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:16:24,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:16:24,735 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 172 [2018-09-26 08:16:24,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:24,737 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:16:24,737 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:16:24,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=226, Invalid=3196, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:16:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:16:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-09-26 08:16:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:16:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:16:24,753 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-09-26 08:16:24,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:24,753 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:16:24,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:16:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:16:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:16:24,756 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:24,756 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1, 1] [2018-09-26 08:16:24,756 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:24,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1557926359, now seen corresponding path program 57 times [2018-09-26 08:16:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:25,428 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:25,429 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:25,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:16:25,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:16:25,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:16:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:16:25,431 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 60 states. [2018-09-26 08:16:26,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:26,230 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:16:26,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:16:26,230 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 175 [2018-09-26 08:16:26,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:26,232 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:16:26,232 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:16:26,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=3310, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:16:26,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:16:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-09-26 08:16:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:16:26,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:16:26,246 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-09-26 08:16:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:26,247 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:16:26,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:16:26,247 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:16:26,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:16:26,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:26,253 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1, 1] [2018-09-26 08:16:26,253 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:26,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:26,253 INFO L82 PathProgramCache]: Analyzing trace with hash 769707463, now seen corresponding path program 58 times [2018-09-26 08:16:26,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:26,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:26,733 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:26,733 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:16:26,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:16:26,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:16:26,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:16:26,735 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 61 states. [2018-09-26 08:16:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:27,535 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:16:27,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:16:27,536 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 178 [2018-09-26 08:16:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:27,537 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:16:27,537 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:16:27,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=234, Invalid=3426, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:16:27,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:16:27,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-09-26 08:16:27,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:16:27,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:16:27,551 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-09-26 08:16:27,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:27,552 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:16:27,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:16:27,552 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:16:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:16:27,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:27,554 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1, 1] [2018-09-26 08:16:27,554 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:27,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash -473216041, now seen corresponding path program 59 times [2018-09-26 08:16:27,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:27,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:28,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:28,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:16:28,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:16:28,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:16:28,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:16:28,056 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 62 states. [2018-09-26 08:16:28,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:28,798 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:16:28,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:16:28,799 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 181 [2018-09-26 08:16:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:28,800 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:16:28,800 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:16:28,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=238, Invalid=3544, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:16:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:16:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-09-26 08:16:28,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:16:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:16:28,816 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-09-26 08:16:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:28,817 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:16:28,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:16:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:16:28,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:16:28,819 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:28,819 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1, 1] [2018-09-26 08:16:28,819 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:28,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:28,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1494264889, now seen corresponding path program 60 times [2018-09-26 08:16:28,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:28,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:29,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:29,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:16:29,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:16:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:16:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:16:29,330 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 63 states. [2018-09-26 08:16:30,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:30,073 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:16:30,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:16:30,074 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 184 [2018-09-26 08:16:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:30,075 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:16:30,075 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:16:30,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=3664, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:16:30,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:16:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-09-26 08:16:30,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:16:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-09-26 08:16:30,088 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-09-26 08:16:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:30,089 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-09-26 08:16:30,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:16:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-09-26 08:16:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:16:30,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:30,091 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1, 1] [2018-09-26 08:16:30,091 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:30,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:30,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1692861911, now seen corresponding path program 61 times [2018-09-26 08:16:30,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:30,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:30,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:30,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:30,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:16:30,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:16:30,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:16:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:16:30,564 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 64 states. [2018-09-26 08:16:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:31,327 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:16:31,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:16:31,327 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 187 [2018-09-26 08:16:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:31,329 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:16:31,330 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:16:31,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=246, Invalid=3786, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:16:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:16:31,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-09-26 08:16:31,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:16:31,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:16:31,344 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-09-26 08:16:31,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:31,345 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:16:31,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:16:31,345 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:16:31,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:16:31,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:31,347 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1, 1] [2018-09-26 08:16:31,347 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:31,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:31,348 INFO L82 PathProgramCache]: Analyzing trace with hash 545348039, now seen corresponding path program 62 times [2018-09-26 08:16:31,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:31,830 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:31,830 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:16:31,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:16:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:16:31,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:16:31,832 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 65 states. [2018-09-26 08:16:32,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:32,683 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:16:32,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:16:32,684 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 190 [2018-09-26 08:16:32,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:32,685 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:16:32,686 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:16:32,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=250, Invalid=3910, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:16:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:16:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-09-26 08:16:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:16:32,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-09-26 08:16:32,701 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-09-26 08:16:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:32,702 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-09-26 08:16:32,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:16:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-09-26 08:16:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:16:32,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:32,705 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1, 1] [2018-09-26 08:16:32,705 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:32,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:32,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1395703849, now seen corresponding path program 63 times [2018-09-26 08:16:32,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:33,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:33,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:16:33,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:16:33,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:16:33,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:16:33,247 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 66 states. [2018-09-26 08:16:33,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:33,850 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:16:33,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:16:33,850 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 193 [2018-09-26 08:16:33,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:33,852 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:16:33,852 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:16:33,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=254, Invalid=4036, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:16:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:16:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-09-26 08:16:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:16:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:16:33,865 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-09-26 08:16:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:33,866 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:16:33,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:16:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:16:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:16:33,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:33,869 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1, 1] [2018-09-26 08:16:33,869 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:33,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash 167174087, now seen corresponding path program 64 times [2018-09-26 08:16:33,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:34,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:34,376 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:34,376 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:16:34,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:16:34,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:16:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:16:34,379 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 67 states. [2018-09-26 08:16:35,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:35,111 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:16:35,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:16:35,112 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 196 [2018-09-26 08:16:35,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:35,113 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:16:35,113 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:16:35,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=4164, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:16:35,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:16:35,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 200. [2018-09-26 08:16:35,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:16:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-09-26 08:16:35,125 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-09-26 08:16:35,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:35,125 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-09-26 08:16:35,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:16:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-09-26 08:16:35,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:16:35,127 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:35,128 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1, 1] [2018-09-26 08:16:35,128 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:35,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:35,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1876690473, now seen corresponding path program 65 times [2018-09-26 08:16:35,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:35,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:35,548 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:35,548 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:16:35,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:16:35,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:16:35,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:16:35,550 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 68 states. [2018-09-26 08:16:36,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:36,101 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:16:36,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:16:36,101 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 199 [2018-09-26 08:16:36,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:36,102 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:16:36,103 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:16:36,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=262, Invalid=4294, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:16:36,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:16:36,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-09-26 08:16:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:16:36,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:16:36,114 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-09-26 08:16:36,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:36,114 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:16:36,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:16:36,115 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:16:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:16:36,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:36,117 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1, 1] [2018-09-26 08:16:36,117 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:36,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash -894442041, now seen corresponding path program 66 times [2018-09-26 08:16:36,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:36,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:36,492 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:36,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:16:36,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:16:36,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:16:36,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:16:36,493 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 69 states. [2018-09-26 08:16:37,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:37,035 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:16:37,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:16:37,036 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 202 [2018-09-26 08:16:37,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:37,037 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:16:37,037 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:16:37,038 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=266, Invalid=4426, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:16:37,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:16:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 206. [2018-09-26 08:16:37,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:16:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:16:37,049 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-09-26 08:16:37,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:37,050 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:16:37,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:16:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:16:37,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:16:37,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:37,052 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1, 1] [2018-09-26 08:16:37,052 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:37,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:37,053 INFO L82 PathProgramCache]: Analyzing trace with hash -343591977, now seen corresponding path program 67 times [2018-09-26 08:16:37,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:37,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:37,545 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:37,545 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:16:37,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:16:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:16:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:16:37,547 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 70 states. [2018-09-26 08:16:38,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:38,106 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-09-26 08:16:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:16:38,107 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 205 [2018-09-26 08:16:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:38,108 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:16:38,108 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:16:38,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=270, Invalid=4560, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:16:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:16:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-09-26 08:16:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:16:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:16:38,119 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-09-26 08:16:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:38,119 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:16:38,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:16:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:16:38,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:16:38,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:38,121 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1, 1] [2018-09-26 08:16:38,122 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:38,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:38,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1039373369, now seen corresponding path program 68 times [2018-09-26 08:16:38,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:38,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:38,626 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:38,626 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:16:38,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:16:38,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:16:38,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:16:38,627 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 71 states. [2018-09-26 08:16:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:39,320 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 08:16:39,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:16:39,320 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 208 [2018-09-26 08:16:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:39,321 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:16:39,322 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:16:39,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=274, Invalid=4696, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:16:39,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:16:39,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 212. [2018-09-26 08:16:39,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:16:39,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 08:16:39,331 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-09-26 08:16:39,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:39,331 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 08:16:39,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:16:39,332 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 08:16:39,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:16:39,334 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:39,334 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1, 1] [2018-09-26 08:16:39,334 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:39,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:39,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1550651945, now seen corresponding path program 69 times [2018-09-26 08:16:39,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:39,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:39,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:39,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:16:39,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:16:39,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:16:39,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:16:39,892 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 72 states. [2018-09-26 08:16:40,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:40,449 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-09-26 08:16:40,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:16:40,449 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 211 [2018-09-26 08:16:40,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:40,450 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:16:40,451 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:16:40,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=278, Invalid=4834, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:16:40,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:16:40,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-09-26 08:16:40,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:16:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:16:40,461 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-09-26 08:16:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:40,461 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:16:40,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:16:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:16:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:16:40,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:40,463 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1, 1] [2018-09-26 08:16:40,463 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:40,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1198289351, now seen corresponding path program 70 times [2018-09-26 08:16:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:40,871 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:40,872 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:40,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:16:40,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:16:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:16:40,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:16:40,873 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 73 states. [2018-09-26 08:16:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:41,475 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-26 08:16:41,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:16:41,475 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 214 [2018-09-26 08:16:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:41,477 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:16:41,477 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:16:41,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=282, Invalid=4974, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:16:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:16:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 218. [2018-09-26 08:16:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:16:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-09-26 08:16:41,489 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-09-26 08:16:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:41,489 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-09-26 08:16:41,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:16:41,490 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-09-26 08:16:41,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:16:41,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:41,495 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1, 1] [2018-09-26 08:16:41,495 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:41,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1527961641, now seen corresponding path program 71 times [2018-09-26 08:16:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:41,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:41,959 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:41,959 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:16:41,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:16:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:16:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:16:41,960 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 74 states. [2018-09-26 08:16:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:42,488 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-09-26 08:16:42,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:16:42,488 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 217 [2018-09-26 08:16:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:42,489 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:16:42,490 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:16:42,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=5116, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:16:42,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:16:42,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-09-26 08:16:42,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:16:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:16:42,501 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-09-26 08:16:42,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:42,501 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:16:42,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:16:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:16:42,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:16:42,502 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:42,503 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1, 1] [2018-09-26 08:16:42,503 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:42,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:42,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1439696953, now seen corresponding path program 72 times [2018-09-26 08:16:42,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:42,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:42,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:42,972 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:16:42,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:16:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:16:42,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:16:42,973 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 75 states. [2018-09-26 08:16:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:43,577 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 08:16:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:16:43,577 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 220 [2018-09-26 08:16:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:43,578 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:16:43,578 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:16:43,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=290, Invalid=5260, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:16:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:16:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2018-09-26 08:16:43,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:16:43,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-09-26 08:16:43,591 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-09-26 08:16:43,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:43,591 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-09-26 08:16:43,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:16:43,591 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-09-26 08:16:43,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:16:43,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:43,593 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1, 1] [2018-09-26 08:16:43,593 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:43,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash -466361897, now seen corresponding path program 73 times [2018-09-26 08:16:43,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:44,092 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:44,092 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:16:44,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:16:44,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:16:44,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:16:44,094 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 76 states. [2018-09-26 08:16:44,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:44,783 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:16:44,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:16:44,783 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 223 [2018-09-26 08:16:44,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:44,785 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:16:44,785 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:16:44,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=294, Invalid=5406, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:16:44,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:16:44,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2018-09-26 08:16:44,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:16:44,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:16:44,799 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-09-26 08:16:44,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:44,799 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:16:44,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:16:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:16:44,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:16:44,800 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:44,801 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1, 1] [2018-09-26 08:16:44,801 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:44,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:44,802 INFO L82 PathProgramCache]: Analyzing trace with hash 834076103, now seen corresponding path program 74 times [2018-09-26 08:16:44,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:45,332 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:45,333 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:45,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:16:45,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:16:45,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:16:45,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:16:45,334 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 77 states. [2018-09-26 08:16:45,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:45,970 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-09-26 08:16:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:16:45,970 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 226 [2018-09-26 08:16:45,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:45,971 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:16:45,972 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:16:45,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=298, Invalid=5554, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:16:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:16:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 230. [2018-09-26 08:16:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:16:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-09-26 08:16:45,980 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-09-26 08:16:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:45,981 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-09-26 08:16:45,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:16:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-09-26 08:16:45,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:16:45,982 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:45,982 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1, 1] [2018-09-26 08:16:45,982 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:45,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:45,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1577524183, now seen corresponding path program 75 times [2018-09-26 08:16:45,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:46,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:46,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:16:46,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:16:46,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:16:46,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:16:46,419 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 78 states. [2018-09-26 08:16:47,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:47,268 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 08:16:47,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:16:47,268 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 229 [2018-09-26 08:16:47,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:47,269 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:16:47,270 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:16:47,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=302, Invalid=5704, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:16:47,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:16:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-09-26 08:16:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:16:47,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:16:47,282 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-09-26 08:16:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:47,282 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:16:47,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:16:47,283 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:16:47,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:16:47,284 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:47,284 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1, 1] [2018-09-26 08:16:47,284 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:47,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:47,285 INFO L82 PathProgramCache]: Analyzing trace with hash 492929991, now seen corresponding path program 76 times [2018-09-26 08:16:47,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:47,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:47,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:47,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:16:47,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:16:47,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:16:47,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:16:47,787 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 79 states. [2018-09-26 08:16:48,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:48,507 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-26 08:16:48,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:16:48,508 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 232 [2018-09-26 08:16:48,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:48,509 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:16:48,509 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:16:48,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=306, Invalid=5856, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:16:48,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:16:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 236. [2018-09-26 08:16:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:16:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 08:16:48,519 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-09-26 08:16:48,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:48,520 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 08:16:48,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:16:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 08:16:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:16:48,521 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:48,521 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1, 1] [2018-09-26 08:16:48,521 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:48,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash 386323927, now seen corresponding path program 77 times [2018-09-26 08:16:48,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:48,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:48,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:48,986 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:48,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:16:48,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:16:48,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:16:48,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:16:48,987 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 80 states. [2018-09-26 08:16:49,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:49,681 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-09-26 08:16:49,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:16:49,681 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 235 [2018-09-26 08:16:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:49,683 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:16:49,683 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 08:16:49,683 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=310, Invalid=6010, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:16:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 08:16:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-09-26 08:16:49,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:16:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-09-26 08:16:49,691 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-09-26 08:16:49,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:49,691 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-09-26 08:16:49,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:16:49,691 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-09-26 08:16:49,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:16:49,692 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:49,692 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1, 1] [2018-09-26 08:16:49,693 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:49,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1534096953, now seen corresponding path program 78 times [2018-09-26 08:16:49,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:50,182 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:50,183 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:16:50,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:16:50,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:16:50,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:16:50,184 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 81 states. [2018-09-26 08:16:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:50,897 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-26 08:16:50,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:16:50,897 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 238 [2018-09-26 08:16:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:50,898 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:16:50,898 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:16:50,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=314, Invalid=6166, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:16:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:16:50,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 242. [2018-09-26 08:16:50,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:16:50,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-26 08:16:50,910 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-09-26 08:16:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:50,910 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-26 08:16:50,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:16:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-26 08:16:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-26 08:16:50,911 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:50,912 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1, 1] [2018-09-26 08:16:50,912 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:50,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash 466816983, now seen corresponding path program 79 times [2018-09-26 08:16:50,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:51,490 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:51,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:51,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:16:51,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:16:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:16:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:16:51,492 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 82 states. [2018-09-26 08:16:52,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:52,173 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-09-26 08:16:52,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:16:52,174 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 241 [2018-09-26 08:16:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:52,175 INFO L225 Difference]: With dead ends: 248 [2018-09-26 08:16:52,175 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 08:16:52,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=6324, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:16:52,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 08:16:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-09-26 08:16:52,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:16:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 08:16:52,185 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-09-26 08:16:52,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:52,186 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 08:16:52,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:16:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 08:16:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:16:52,187 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:52,187 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1, 1] [2018-09-26 08:16:52,187 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:52,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash -157216825, now seen corresponding path program 80 times [2018-09-26 08:16:52,188 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:52,685 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:52,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:52,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:16:52,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:16:52,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:16:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:16:52,686 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 83 states. [2018-09-26 08:16:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:53,416 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-26 08:16:53,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:16:53,416 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 244 [2018-09-26 08:16:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:53,418 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:16:53,418 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:16:53,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=322, Invalid=6484, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:16:53,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:16:53,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2018-09-26 08:16:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-26 08:16:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-09-26 08:16:53,430 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-09-26 08:16:53,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:53,430 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-09-26 08:16:53,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:16:53,430 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-09-26 08:16:53,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-26 08:16:53,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:53,432 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1, 1] [2018-09-26 08:16:53,432 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:53,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:53,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2129933865, now seen corresponding path program 81 times [2018-09-26 08:16:53,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:53,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:53,941 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:53,942 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:16:53,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:16:53,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:16:53,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:16:53,943 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 84 states. [2018-09-26 08:16:54,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:54,736 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-09-26 08:16:54,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:16:54,736 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 247 [2018-09-26 08:16:54,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:54,737 INFO L225 Difference]: With dead ends: 254 [2018-09-26 08:16:54,737 INFO L226 Difference]: Without dead ends: 252 [2018-09-26 08:16:54,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=6646, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:16:54,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-09-26 08:16:54,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-09-26 08:16:54,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:16:54,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 08:16:54,748 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-09-26 08:16:54,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:54,749 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 08:16:54,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:16:54,749 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 08:16:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:16:54,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:54,750 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1, 1] [2018-09-26 08:16:54,750 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:54,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:54,750 INFO L82 PathProgramCache]: Analyzing trace with hash 989205959, now seen corresponding path program 82 times [2018-09-26 08:16:54,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:54,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:55,282 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:55,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:16:55,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:16:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:16:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:16:55,284 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 85 states. [2018-09-26 08:16:56,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:56,074 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-09-26 08:16:56,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:16:56,074 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 250 [2018-09-26 08:16:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:56,076 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:16:56,076 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:16:56,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=330, Invalid=6810, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:16:56,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:16:56,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 254. [2018-09-26 08:16:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-09-26 08:16:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-09-26 08:16:56,088 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-09-26 08:16:56,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:56,088 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-09-26 08:16:56,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:16:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-09-26 08:16:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-26 08:16:56,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:56,090 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1, 1] [2018-09-26 08:16:56,090 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:56,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:56,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1666253783, now seen corresponding path program 83 times [2018-09-26 08:16:56,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:56,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:56,659 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:56,659 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:16:56,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:16:56,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:16:56,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:16:56,660 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 86 states. [2018-09-26 08:16:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:57,463 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-09-26 08:16:57,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:16:57,463 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 253 [2018-09-26 08:16:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:57,464 INFO L225 Difference]: With dead ends: 260 [2018-09-26 08:16:57,464 INFO L226 Difference]: Without dead ends: 258 [2018-09-26 08:16:57,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=334, Invalid=6976, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:16:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-26 08:16:57,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-09-26 08:16:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:16:57,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 08:16:57,472 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-09-26 08:16:57,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:57,473 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 08:16:57,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:16:57,473 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 08:16:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:16:57,474 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:57,474 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1, 1] [2018-09-26 08:16:57,474 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:57,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:57,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1863410745, now seen corresponding path program 84 times [2018-09-26 08:16:57,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:58,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:58,145 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:58,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:16:58,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:16:58,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:16:58,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:16:58,146 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 87 states. [2018-09-26 08:16:58,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:16:58,890 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-26 08:16:58,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:16:58,890 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 256 [2018-09-26 08:16:58,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:16:58,891 INFO L225 Difference]: With dead ends: 263 [2018-09-26 08:16:58,892 INFO L226 Difference]: Without dead ends: 261 [2018-09-26 08:16:58,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=338, Invalid=7144, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:16:58,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-09-26 08:16:58,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 260. [2018-09-26 08:16:58,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-09-26 08:16:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-09-26 08:16:58,903 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-09-26 08:16:58,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:16:58,903 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-09-26 08:16:58,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:16:58,903 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-09-26 08:16:58,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-26 08:16:58,905 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:16:58,905 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1, 1] [2018-09-26 08:16:58,905 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:16:58,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:16:58,905 INFO L82 PathProgramCache]: Analyzing trace with hash -415056425, now seen corresponding path program 85 times [2018-09-26 08:16:58,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:16:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:16:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:16:59,476 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:16:59,476 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:16:59,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:16:59,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:16:59,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:16:59,478 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 88 states. [2018-09-26 08:17:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:00,268 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-09-26 08:17:00,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:17:00,269 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 259 [2018-09-26 08:17:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:00,270 INFO L225 Difference]: With dead ends: 266 [2018-09-26 08:17:00,270 INFO L226 Difference]: Without dead ends: 264 [2018-09-26 08:17:00,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=342, Invalid=7314, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:17:00,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-26 08:17:00,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2018-09-26 08:17:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:17:00,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-09-26 08:17:00,283 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-09-26 08:17:00,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:00,284 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-09-26 08:17:00,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:17:00,284 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-09-26 08:17:00,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:17:00,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:00,285 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1, 1] [2018-09-26 08:17:00,286 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:00,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:00,286 INFO L82 PathProgramCache]: Analyzing trace with hash 267035079, now seen corresponding path program 86 times [2018-09-26 08:17:00,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:00,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:00,843 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:00,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:00,843 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:17:00,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:17:00,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:17:00,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:17:00,845 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 89 states. [2018-09-26 08:17:01,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:01,733 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-09-26 08:17:01,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:17:01,734 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 262 [2018-09-26 08:17:01,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:01,735 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:17:01,735 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:17:01,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=346, Invalid=7486, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:17:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:17:01,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 266. [2018-09-26 08:17:01,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-26 08:17:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-26 08:17:01,747 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-09-26 08:17:01,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:01,747 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-26 08:17:01,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:17:01,748 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-26 08:17:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-26 08:17:01,749 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:01,749 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1, 1] [2018-09-26 08:17:01,749 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:01,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:01,750 INFO L82 PathProgramCache]: Analyzing trace with hash 964753367, now seen corresponding path program 87 times [2018-09-26 08:17:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:02,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:02,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:02,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:17:02,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:17:02,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:17:02,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:17:02,423 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 90 states. [2018-09-26 08:17:03,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:03,291 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-09-26 08:17:03,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:17:03,291 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 265 [2018-09-26 08:17:03,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:03,293 INFO L225 Difference]: With dead ends: 272 [2018-09-26 08:17:03,293 INFO L226 Difference]: Without dead ends: 270 [2018-09-26 08:17:03,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=350, Invalid=7660, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:17:03,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-26 08:17:03,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-09-26 08:17:03,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:17:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-26 08:17:03,300 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-09-26 08:17:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:03,300 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-26 08:17:03,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:17:03,300 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-26 08:17:03,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:17:03,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:03,301 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1, 1] [2018-09-26 08:17:03,301 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:03,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:03,302 INFO L82 PathProgramCache]: Analyzing trace with hash -951441465, now seen corresponding path program 88 times [2018-09-26 08:17:03,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:03,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:03,888 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:03,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:03,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:17:03,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:17:03,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:17:03,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:17:03,890 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 91 states. [2018-09-26 08:17:04,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:04,827 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-26 08:17:04,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:17:04,827 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 268 [2018-09-26 08:17:04,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:04,828 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:17:04,828 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:17:04,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=354, Invalid=7836, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:17:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:17:04,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 272. [2018-09-26 08:17:04,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-09-26 08:17:04,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-09-26 08:17:04,837 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-09-26 08:17:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:04,837 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-09-26 08:17:04,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:17:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-09-26 08:17:04,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-26 08:17:04,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:04,839 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1, 1] [2018-09-26 08:17:04,839 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:04,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:04,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1901350441, now seen corresponding path program 89 times [2018-09-26 08:17:04,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:05,589 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:05,589 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:17:05,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:17:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:17:05,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:17:05,590 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 92 states. [2018-09-26 08:17:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:06,495 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-09-26 08:17:06,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:17:06,495 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 271 [2018-09-26 08:17:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:06,496 INFO L225 Difference]: With dead ends: 278 [2018-09-26 08:17:06,496 INFO L226 Difference]: Without dead ends: 276 [2018-09-26 08:17:06,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=358, Invalid=8014, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:17:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-09-26 08:17:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2018-09-26 08:17:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:17:06,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-09-26 08:17:06,505 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-09-26 08:17:06,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:06,505 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-09-26 08:17:06,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:17:06,506 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-09-26 08:17:06,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:17:06,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:06,507 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1, 1] [2018-09-26 08:17:06,507 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:06,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:06,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1100141113, now seen corresponding path program 90 times [2018-09-26 08:17:06,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:07,150 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:07,150 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:17:07,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:17:07,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:17:07,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:17:07,151 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 93 states. [2018-09-26 08:17:08,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:08,063 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-09-26 08:17:08,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:17:08,063 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 274 [2018-09-26 08:17:08,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:08,065 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:17:08,065 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:17:08,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=362, Invalid=8194, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:17:08,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:17:08,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 278. [2018-09-26 08:17:08,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-26 08:17:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-09-26 08:17:08,074 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-09-26 08:17:08,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:08,074 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-09-26 08:17:08,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:17:08,074 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-09-26 08:17:08,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-26 08:17:08,075 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:08,075 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1, 1] [2018-09-26 08:17:08,075 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:08,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:08,076 INFO L82 PathProgramCache]: Analyzing trace with hash 593685463, now seen corresponding path program 91 times [2018-09-26 08:17:08,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:08,704 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:08,704 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:17:08,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:17:08,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:17:08,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:17:08,706 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 94 states. [2018-09-26 08:17:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:09,623 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-09-26 08:17:09,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:17:09,623 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 277 [2018-09-26 08:17:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:09,625 INFO L225 Difference]: With dead ends: 284 [2018-09-26 08:17:09,625 INFO L226 Difference]: Without dead ends: 282 [2018-09-26 08:17:09,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=366, Invalid=8376, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:17:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-26 08:17:09,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-09-26 08:17:09,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:17:09,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 08:17:09,632 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-09-26 08:17:09,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:09,633 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 08:17:09,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:17:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 08:17:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:17:09,634 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:09,634 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1, 1] [2018-09-26 08:17:09,634 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:09,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:09,634 INFO L82 PathProgramCache]: Analyzing trace with hash -189549625, now seen corresponding path program 92 times [2018-09-26 08:17:09,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:09,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:10,289 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:10,289 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:17:10,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:17:10,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:17:10,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:17:10,290 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 95 states. [2018-09-26 08:17:11,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:11,299 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-26 08:17:11,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:17:11,299 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 280 [2018-09-26 08:17:11,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:11,301 INFO L225 Difference]: With dead ends: 287 [2018-09-26 08:17:11,301 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 08:17:11,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=370, Invalid=8560, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:17:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 08:17:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 284. [2018-09-26 08:17:11,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-09-26 08:17:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-09-26 08:17:11,314 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-09-26 08:17:11,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:11,315 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-09-26 08:17:11,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:17:11,315 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-09-26 08:17:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-26 08:17:11,316 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:11,316 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1, 1] [2018-09-26 08:17:11,317 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:11,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1011262935, now seen corresponding path program 93 times [2018-09-26 08:17:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:12,026 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:12,026 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:17:12,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:17:12,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:17:12,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:17:12,028 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 96 states. [2018-09-26 08:17:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:13,093 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-09-26 08:17:13,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:17:13,093 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 283 [2018-09-26 08:17:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:13,094 INFO L225 Difference]: With dead ends: 290 [2018-09-26 08:17:13,094 INFO L226 Difference]: Without dead ends: 288 [2018-09-26 08:17:13,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=374, Invalid=8746, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:17:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-09-26 08:17:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2018-09-26 08:17:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:17:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-09-26 08:17:13,110 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-09-26 08:17:13,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:13,110 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-09-26 08:17:13,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:17:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-09-26 08:17:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:17:13,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:13,113 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1, 1] [2018-09-26 08:17:13,113 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:13,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:13,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1635629511, now seen corresponding path program 94 times [2018-09-26 08:17:13,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:13,900 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:13,900 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:17:13,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:17:13,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:17:13,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:17:13,902 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 97 states. [2018-09-26 08:17:14,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:14,925 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-09-26 08:17:14,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:17:14,926 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 286 [2018-09-26 08:17:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:14,927 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:17:14,927 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:17:14,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=8934, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:17:14,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:17:14,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 290. [2018-09-26 08:17:14,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-09-26 08:17:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-09-26 08:17:14,940 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-09-26 08:17:14,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:14,940 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-09-26 08:17:14,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:17:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-09-26 08:17:14,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-26 08:17:14,942 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:14,942 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1, 1] [2018-09-26 08:17:14,942 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:14,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:14,942 INFO L82 PathProgramCache]: Analyzing trace with hash 636936151, now seen corresponding path program 95 times [2018-09-26 08:17:14,943 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:15,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:15,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:17:15,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:17:15,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:17:15,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:17:15,678 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 98 states. [2018-09-26 08:17:16,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:16,728 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-09-26 08:17:16,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:17:16,729 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 289 [2018-09-26 08:17:16,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:16,730 INFO L225 Difference]: With dead ends: 296 [2018-09-26 08:17:16,730 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 08:17:16,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=382, Invalid=9124, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:17:16,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 08:17:16,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-09-26 08:17:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:17:16,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-26 08:17:16,743 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-09-26 08:17:16,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:16,743 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-26 08:17:16,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:17:16,743 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-26 08:17:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:17:16,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:16,745 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1, 1] [2018-09-26 08:17:16,745 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:16,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -198492217, now seen corresponding path program 96 times [2018-09-26 08:17:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:17,514 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:17,514 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:17,514 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:17:17,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:17:17,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:17:17,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:17:17,516 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 99 states. [2018-09-26 08:17:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:18,562 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-26 08:17:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:17:18,563 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 292 [2018-09-26 08:17:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:18,564 INFO L225 Difference]: With dead ends: 299 [2018-09-26 08:17:18,564 INFO L226 Difference]: Without dead ends: 297 [2018-09-26 08:17:18,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=386, Invalid=9316, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:17:18,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-09-26 08:17:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 296. [2018-09-26 08:17:18,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-26 08:17:18,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-26 08:17:18,577 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-09-26 08:17:18,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:18,578 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-26 08:17:18,578 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:17:18,578 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-26 08:17:18,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-26 08:17:18,579 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:18,580 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1, 1] [2018-09-26 08:17:18,580 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:18,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:18,580 INFO L82 PathProgramCache]: Analyzing trace with hash 890477015, now seen corresponding path program 97 times [2018-09-26 08:17:18,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:19,332 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:19,332 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:19,333 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:17:19,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:17:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:17:19,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:17:19,334 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 100 states. [2018-09-26 08:17:20,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:20,426 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-09-26 08:17:20,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:17:20,426 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 295 [2018-09-26 08:17:20,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:20,427 INFO L225 Difference]: With dead ends: 302 [2018-09-26 08:17:20,428 INFO L226 Difference]: Without dead ends: 300 [2018-09-26 08:17:20,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=390, Invalid=9510, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:17:20,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-09-26 08:17:20,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2018-09-26 08:17:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:17:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-09-26 08:17:20,437 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-09-26 08:17:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:20,437 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-09-26 08:17:20,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:17:20,438 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-09-26 08:17:20,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:17:20,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:20,439 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1, 1] [2018-09-26 08:17:20,439 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:20,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:20,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1810086457, now seen corresponding path program 98 times [2018-09-26 08:17:20,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:21,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:21,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:17:21,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:17:21,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:17:21,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:17:21,264 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 101 states. [2018-09-26 08:17:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:22,337 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-26 08:17:22,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:17:22,337 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 298 [2018-09-26 08:17:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:22,338 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:17:22,338 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:17:22,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=394, Invalid=9706, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:17:22,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:17:22,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 302. [2018-09-26 08:17:22,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-09-26 08:17:22,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-09-26 08:17:22,347 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-09-26 08:17:22,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:22,348 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-09-26 08:17:22,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:17:22,348 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-09-26 08:17:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-26 08:17:22,349 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:22,349 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1, 1] [2018-09-26 08:17:22,349 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:22,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash -969092137, now seen corresponding path program 99 times [2018-09-26 08:17:22,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:23,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:23,116 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:23,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:17:23,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:17:23,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:17:23,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:17:23,117 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 102 states. [2018-09-26 08:17:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:24,285 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-26 08:17:24,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:17:24,285 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 301 [2018-09-26 08:17:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:24,286 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:17:24,287 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:17:24,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=398, Invalid=9904, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:17:24,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:17:24,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-09-26 08:17:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:17:24,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-26 08:17:24,300 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-09-26 08:17:24,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:24,300 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-26 08:17:24,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:17:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-26 08:17:24,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:17:24,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:24,302 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1, 1] [2018-09-26 08:17:24,302 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:24,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:24,303 INFO L82 PathProgramCache]: Analyzing trace with hash 548457415, now seen corresponding path program 100 times [2018-09-26 08:17:24,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:26,269 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 0 proven. 15050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:26,269 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:26,269 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:17:26,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:17:26,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:17:26,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:26,271 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 103 states. [2018-09-26 08:17:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:29,260 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-26 08:17:29,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:17:29,262 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 304 [2018-09-26 08:17:29,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:29,263 INFO L225 Difference]: With dead ends: 311 [2018-09-26 08:17:29,263 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:17:29,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:29,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:17:29,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2018-09-26 08:17:29,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-09-26 08:17:29,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-09-26 08:17:29,286 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 304 [2018-09-26 08:17:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:29,286 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-09-26 08:17:29,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:17:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-09-26 08:17:29,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-09-26 08:17:29,288 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:17:29,289 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 101, 1, 1, 1] [2018-09-26 08:17:29,289 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:17:29,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:17:29,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1041403351, now seen corresponding path program 101 times [2018-09-26 08:17:29,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:17:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:17:30,431 INFO L134 CoverageAnalysis]: Checked inductivity of 15352 backedges. 4077 proven. 11275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:17:30,431 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:17:30,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:17:30,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:17:30,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:17:30,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:30,433 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 103 states. [2018-09-26 08:17:31,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:17:31,570 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-09-26 08:17:31,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:17:31,570 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 307 [2018-09-26 08:17:31,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:17:31,571 INFO L225 Difference]: With dead ends: 308 [2018-09-26 08:17:31,571 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 08:17:31,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1478, Invalid=9028, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:17:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 08:17:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 08:17:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 08:17:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 08:17:31,574 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 307 [2018-09-26 08:17:31,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:17:31,574 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 08:17:31,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:17:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 08:17:31,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 08:17:31,579 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 08:17:31,706 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-09-26 08:17:32,423 WARN L178 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-09-26 08:17:32,998 WARN L178 SmtUtils]: Spent 567.00 ms on a formula simplification that was a NOOP. DAG size: 508 [2018-09-26 08:17:33,574 WARN L178 SmtUtils]: Spent 571.00 ms on a formula simplification that was a NOOP. DAG size: 503 [2018-09-26 08:17:33,582 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 43) no Hoare annotation was computed. [2018-09-26 08:17:33,607 INFO L422 ceAbstractionStarter]: At program point L32(lines 29 38) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~y~4 50)) (.cse1 (<= 50 ULTIMATE.start_main_~y~4))) (or (and (<= 48 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 48) .cse1) (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and (<= 44 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 44) .cse1) (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)) (and (<= ULTIMATE.start_main_~y~4 65) (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 8) .cse1 (<= 8 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 37) .cse1 (<= 37 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 30) .cse0 (<= 30 ULTIMATE.start_main_~x~4) .cse1) (and (<= 36 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 36) .cse1) (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 40) .cse0 (<= 40 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= 90 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 90)) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 28) .cse1 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= 3 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 3) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse1) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse0 .cse1) (and .cse0 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse1) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= 78 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 78)) (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse1) (and (<= 29 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 50) .cse0 (<= 50 ULTIMATE.start_main_~x~4) .cse1) (and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 25) .cse1 (<= 25 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76) (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91) (<= 91 ULTIMATE.start_main_~x~4)) (and (<= 12 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 12) .cse1) (and (<= 20 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 20) .cse1) (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~y~4) (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (and (<= ULTIMATE.start_main_~x~4 32) .cse0 (<= 32 ULTIMATE.start_main_~x~4) .cse1) (and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67)) (and (<= 38 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 38) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 26) .cse1 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and .cse0 (<= 15 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 15)) (and (<= 34 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 34) .cse1) (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) (<= 81 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~y~4 60) (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4)) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 21) .cse0 (<= 21 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 5) .cse0 .cse1 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 17) .cse1 (<= 17 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 2 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 2)) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54) (<= 54 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) .cse1) (and (<= 74 ULTIMATE.start_main_~y~4) (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 1) .cse1 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83)) (and (<= 95 ULTIMATE.start_main_~x~4) (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (and (<= ULTIMATE.start_main_~x~4 16) .cse0 (<= 16 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 31) .cse0 .cse1 (<= 31 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= 92 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 92)) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)) (and (<= ULTIMATE.start_main_~x~4 7) .cse0 (<= 7 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= 73 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 73)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52)) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 70)) (and .cse0 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 33) .cse0 (<= 33 ULTIMATE.start_main_~x~4) .cse1) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (and (<= 6 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 6)) (and (<= ULTIMATE.start_main_~x~4 10) .cse0 .cse1 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~y~4) (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66)) (and (<= ULTIMATE.start_main_~x~4 46) .cse0 (<= 46 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 .cse1 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~x~4) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79)) (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4) (<= 84 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) (<= 89 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~x~4) (<= 75 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~y~4 69) (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4)) (and (<= 47 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 47) .cse1) (and (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64)) (and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51)) (and .cse0 (<= ULTIMATE.start_main_~x~4 4) .cse1 (<= 4 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) .cse1))) [2018-09-26 08:17:33,608 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 43) the Hoare annotation is: true [2018-09-26 08:17:33,608 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 31) the Hoare annotation is: false [2018-09-26 08:17:33,608 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 43) no Hoare annotation was computed. [2018-09-26 08:17:33,608 INFO L422 ceAbstractionStarter]: At program point L26(lines 26 30) the Hoare annotation is: false [2018-09-26 08:17:33,621 INFO L422 ceAbstractionStarter]: At program point L16(lines 16 27) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~y~4 50)) (.cse1 (<= 50 ULTIMATE.start_main_~y~4))) (or (and (<= 48 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 48) .cse1) (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and (<= 44 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 44) .cse1) (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)) (and (<= ULTIMATE.start_main_~y~4 65) (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 8) .cse1 (<= 8 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 37) .cse1 (<= 37 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 30) .cse0 (<= 30 ULTIMATE.start_main_~x~4) .cse1) (and (<= 36 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 36) .cse1) (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 40) .cse0 (<= 40 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= 90 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 90)) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 28) .cse1 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= 3 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 3) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse1) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse0 .cse1) (and .cse0 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse1) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= 78 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 78)) (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse1) (and (<= 29 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 50) .cse0 (<= 50 ULTIMATE.start_main_~x~4) .cse1) (and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 25) .cse1 (<= 25 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76) (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91) (<= 91 ULTIMATE.start_main_~x~4)) (and (<= 12 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 12) .cse1) (and (<= 20 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 20) .cse1) (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~y~4) (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (and (<= ULTIMATE.start_main_~x~4 32) .cse0 (<= 32 ULTIMATE.start_main_~x~4) .cse1) (and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67)) (and (<= 38 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 38) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 26) .cse1 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and .cse0 (<= 15 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 15)) (and (<= 34 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 34) .cse1) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) (<= 81 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~y~4 60) (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4)) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 21) .cse0 (<= 21 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 5) .cse0 .cse1 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 17) .cse1 (<= 17 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 2 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 2)) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54) (<= 54 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) .cse1) (and (<= 74 ULTIMATE.start_main_~y~4) (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 1) .cse1 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83)) (and (<= 95 ULTIMATE.start_main_~x~4) (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (and (<= ULTIMATE.start_main_~x~4 16) .cse0 (<= 16 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 31) .cse0 .cse1 (<= 31 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= 92 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 92)) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)) (and (<= ULTIMATE.start_main_~x~4 7) .cse0 (<= 7 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= 73 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 73)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52)) (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 70)) (and .cse0 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 33) .cse0 (<= 33 ULTIMATE.start_main_~x~4) .cse1) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (and (<= 6 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 6)) (and (<= ULTIMATE.start_main_~x~4 10) .cse0 .cse1 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~y~4) (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66)) (and (<= ULTIMATE.start_main_~x~4 46) .cse0 (<= 46 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 .cse1 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~x~4) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79)) (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4) (<= 84 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) (<= 89 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~x~4) (<= 75 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~y~4 69) (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4)) (and (<= 47 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 47) .cse1) (and (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64)) (and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51)) (and .cse0 (<= ULTIMATE.start_main_~x~4 4) .cse1 (<= 4 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) .cse1))) [2018-09-26 08:17:33,626 INFO L422 ceAbstractionStarter]: At program point L42(lines 13 42) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~y~4 50)) (.cse1 (<= 50 ULTIMATE.start_main_~y~4))) (or (and (<= 48 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 48) .cse1) (and (<= 99 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 99) (<= 99 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 99)) (and (<= 44 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 44) .cse1) (and (<= 55 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 55) (<= 55 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 55)) (and (<= ULTIMATE.start_main_~y~4 65) (<= 65 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 65) (<= 65 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 35) (<= 35 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 8) .cse1 (<= 8 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 37) .cse1 (<= 37 ULTIMATE.start_main_~x~4)) (and (<= 63 ULTIMATE.start_main_~x~4) (<= 63 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 63) (<= ULTIMATE.start_main_~x~4 63)) (and (<= ULTIMATE.start_main_~x~4 59) (<= ULTIMATE.start_main_~y~4 59) (<= 59 ULTIMATE.start_main_~y~4) (<= 59 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 62) (<= 62 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 62) (<= 62 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 30) .cse0 (<= 30 ULTIMATE.start_main_~x~4) .cse1) (and (<= 36 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 36) .cse1) (and (<= ULTIMATE.start_main_~y~4 93) (<= 93 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 93) (<= 93 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 40) .cse0 (<= 40 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 43) (<= 43 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 41) (<= 41 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and (<= ULTIMATE.start_main_~x~4 90) (<= 90 ULTIMATE.start_main_~y~4) (<= 90 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 90)) (and (<= 53 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 53) (<= ULTIMATE.start_main_~y~4 53) (<= 53 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 28) .cse1 (<= 28 ULTIMATE.start_main_~x~4)) (and (<= 3 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 3) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 24) (<= 24 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 (<= 14 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 14) .cse1) (and (<= 18 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 18) .cse0 .cse1) (and .cse0 (<= 9 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 9) .cse1) (and (<= ULTIMATE.start_main_~x~4 78) (<= 78 ULTIMATE.start_main_~y~4) (<= 78 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 78)) (and (<= ULTIMATE.start_main_~y~4 96) (<= 96 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 96) (<= 96 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 0) (<= 0 ULTIMATE.start_main_~x~4) .cse1) (and (<= 29 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 29)) (and (<= ULTIMATE.start_main_~x~4 50) .cse0 (<= 50 ULTIMATE.start_main_~x~4) .cse1) (and (<= 58 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 58) (<= ULTIMATE.start_main_~x~4 58) (<= 58 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 25) .cse1 (<= 25 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 76) (<= 76 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 76) (<= 76 ULTIMATE.start_main_~x~4)) (and (<= 91 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 91) (<= ULTIMATE.start_main_~y~4 91) (<= 91 ULTIMATE.start_main_~x~4)) (and (<= 12 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 12) .cse1) (and (<= 20 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 20) .cse1) (and (<= 80 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 80) (<= ULTIMATE.start_main_~y~4 80) (<= 80 ULTIMATE.start_main_~x~4)) (and (<= 71 ULTIMATE.start_main_~y~4) (<= 71 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 71) (<= ULTIMATE.start_main_~y~4 71)) (and (<= ULTIMATE.start_main_~x~4 82) (<= 82 ULTIMATE.start_main_~x~4) (<= 82 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 82)) (and (<= ULTIMATE.start_main_~x~4 32) .cse0 (<= 32 ULTIMATE.start_main_~x~4) .cse1) (and (<= 72 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 72) (<= 72 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 72)) (and (<= 67 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 67) (<= 67 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 67)) (and (<= 38 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 38) .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 26) .cse1 (<= 26 ULTIMATE.start_main_~x~4)) (and (<= 57 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 57) (<= 57 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 57)) (and .cse0 (<= 15 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 15)) (and (<= 34 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 34) .cse1) (and (<= ULTIMATE.start_main_~x~4 68) (<= 68 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 68) (<= 68 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~y~4 81) (<= ULTIMATE.start_main_~x~4 81) (<= 81 ULTIMATE.start_main_~x~4) (<= 81 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 27) (<= 27 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~y~4 60) (<= 60 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 60) (<= 60 ULTIMATE.start_main_~y~4)) (and (<= 86 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 86) (<= 86 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 86)) (and (<= ULTIMATE.start_main_~x~4 21) .cse0 (<= 21 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 5) .cse0 .cse1 (<= 5 ULTIMATE.start_main_~x~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 17) .cse1 (<= 17 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 2 ULTIMATE.start_main_~x~4) .cse1 (<= ULTIMATE.start_main_~x~4 2)) (and (<= 54 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 54) (<= ULTIMATE.start_main_~y~4 54) (<= 54 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 98) (<= 98 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 98) (<= 98 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 13) (<= 13 ULTIMATE.start_main_~x~4) .cse1) (and (<= 74 ULTIMATE.start_main_~y~4) (<= 74 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 74) (<= ULTIMATE.start_main_~y~4 74)) (and (<= ULTIMATE.start_main_~x~4 11) (<= 11 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_main_~x~4 1) .cse1 (<= 1 ULTIMATE.start_main_~x~4)) (and (<= 83 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 83) (<= 83 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 83)) (and (<= 95 ULTIMATE.start_main_~x~4) (<= 95 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 95) (<= ULTIMATE.start_main_~x~4 95)) (and (<= ULTIMATE.start_main_~x~4 16) .cse0 (<= 16 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 31) .cse0 .cse1 (<= 31 ULTIMATE.start_main_~x~4)) (and .cse0 (<= 19 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 19) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 22) (<= 22 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 92) (<= 92 ULTIMATE.start_main_~y~4) (<= 92 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 92)) (and (<= 56 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 56) (<= ULTIMATE.start_main_~x~4 56) (<= 56 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 87) (<= 87 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 87) (<= 87 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 85) (<= 85 ULTIMATE.start_main_~y~4) (<= 85 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 85)) (and (<= ULTIMATE.start_main_~y~4 94) (<= ULTIMATE.start_main_~x~4 94) (<= 94 ULTIMATE.start_main_~y~4) (<= 94 ULTIMATE.start_main_~x~4)) (and (<= 88 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 88) (<= 88 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 88)) (and (<= ULTIMATE.start_main_~x~4 7) .cse0 (<= 7 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 73) (<= 73 ULTIMATE.start_main_~y~4) (<= 73 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 73)) (and (<= ULTIMATE.start_main_~x~4 52) (<= 52 ULTIMATE.start_main_~x~4) (<= 52 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 52)) (and (<= ULTIMATE.start_main_~y~4 100) (< 99 ULTIMATE.start_main_~y~4) (<= 100 ULTIMATE.start_main_~x~4)) (and (<= 70 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 70) (<= 70 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 70)) (and .cse0 (<= ULTIMATE.start_main_~x~4 42) (<= 42 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 33) .cse0 (<= 33 ULTIMATE.start_main_~x~4) .cse1) (and (<= 61 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 61) (<= 61 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 61)) (and (<= 6 ULTIMATE.start_main_~x~4) .cse0 .cse1 (<= ULTIMATE.start_main_~x~4 6)) (and (<= ULTIMATE.start_main_~x~4 10) .cse0 .cse1 (<= 10 ULTIMATE.start_main_~x~4)) (and (<= 66 ULTIMATE.start_main_~y~4) (<= 66 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 66) (<= ULTIMATE.start_main_~x~4 66)) (and (<= ULTIMATE.start_main_~x~4 46) .cse0 (<= 46 ULTIMATE.start_main_~x~4) .cse1) (and .cse0 .cse1 (<= 45 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 45)) (and (<= ULTIMATE.start_main_~y~4 79) (<= 79 ULTIMATE.start_main_~x~4) (<= 79 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 79)) (and (<= ULTIMATE.start_main_~y~4 84) (<= ULTIMATE.start_main_~x~4 84) (<= 84 ULTIMATE.start_main_~y~4) (<= 84 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~y~4 89) (<= ULTIMATE.start_main_~x~4 89) (<= 89 ULTIMATE.start_main_~x~4) (<= 89 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 77) (<= 77 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 77) (<= 77 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~x~4 75) (<= ULTIMATE.start_main_~y~4 75) (<= 75 ULTIMATE.start_main_~x~4) (<= 75 ULTIMATE.start_main_~y~4)) (and (<= ULTIMATE.start_main_~y~4 69) (<= 69 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 69) (<= 69 ULTIMATE.start_main_~y~4)) (and (<= 47 ULTIMATE.start_main_~x~4) .cse0 (<= ULTIMATE.start_main_~x~4 47) .cse1) (and (<= 97 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 97) (<= ULTIMATE.start_main_~x~4 97) (<= 97 ULTIMATE.start_main_~y~4)) (and .cse0 (<= ULTIMATE.start_main_~x~4 39) (<= 39 ULTIMATE.start_main_~x~4) .cse1) (and (<= ULTIMATE.start_main_~x~4 64) (<= 64 ULTIMATE.start_main_~x~4) (<= 64 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~y~4 64)) (and (<= 51 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~y~4 51) (<= 51 ULTIMATE.start_main_~y~4) (<= ULTIMATE.start_main_~x~4 51)) (and .cse0 (<= ULTIMATE.start_main_~x~4 4) .cse1 (<= 4 ULTIMATE.start_main_~x~4)) (and (<= ULTIMATE.start_main_~x~4 23) (<= 23 ULTIMATE.start_main_~x~4) .cse0 .cse1) (and .cse0 (<= 49 ULTIMATE.start_main_~x~4) (<= ULTIMATE.start_main_~x~4 49) .cse1))) [2018-09-26 08:17:33,700 INFO L202 PluginConnector]: Adding new model gj2007.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:17:33 BoogieIcfgContainer [2018-09-26 08:17:33,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:17:33,702 INFO L168 Benchmark]: Toolchain (without parser) took 89092.35 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:17:33,702 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:17:33,703 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:17:33,703 INFO L168 Benchmark]: Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:17:33,704 INFO L168 Benchmark]: RCFGBuilder took 270.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:17:33,704 INFO L168 Benchmark]: TraceAbstraction took 88751.34 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:17:33,707 INFO L336 ainManager$Toolchain]: ####################### 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 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.73 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 19.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 270.41 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88751.34 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: 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 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((48 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 48) && 50 <= main_~y~4) || (((99 <= main_~y~4 && main_~y~4 <= 99) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((44 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 44) && 50 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && 55 <= main_~x~4) && main_~x~4 <= 55)) || (((main_~y~4 <= 65 && 65 <= main_~x~4) && main_~x~4 <= 65) && 65 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 35) && 35 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 8) && 50 <= main_~y~4) && 8 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 37) && 50 <= main_~y~4) && 37 <= main_~x~4)) || (((63 <= main_~x~4 && 63 <= main_~y~4) && main_~y~4 <= 63) && main_~x~4 <= 63)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (((main_~x~4 <= 30 && main_~y~4 <= 50) && 30 <= main_~x~4) && 50 <= main_~y~4)) || (((36 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 36) && 50 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 40 && main_~y~4 <= 50) && 40 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 43) && 43 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && 90 <= main_~x~4) && main_~y~4 <= 90)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && main_~y~4 <= 53) && 53 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 28) && 50 <= main_~y~4) && 28 <= main_~x~4)) || (((3 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 3) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 24) && 24 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 14 <= main_~x~4) && main_~x~4 <= 14) && 50 <= main_~y~4)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 9 <= main_~x~4) && main_~x~4 <= 9) && 50 <= main_~y~4)) || (((main_~x~4 <= 78 && 78 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 0) && 0 <= main_~x~4) && 50 <= main_~y~4)) || (((29 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((58 <= main_~x~4 && main_~y~4 <= 58) && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 25) && 50 <= main_~y~4) && 25 <= main_~x~4)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((12 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 12) && 50 <= main_~y~4)) || (((20 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 20) && 50 <= main_~y~4)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (((71 <= main_~y~4 && 71 <= main_~x~4) && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 82 <= main_~y~4) && main_~y~4 <= 82)) || (((main_~x~4 <= 32 && main_~y~4 <= 50) && 32 <= main_~x~4) && 50 <= main_~y~4)) || (((72 <= main_~x~4 && main_~x~4 <= 72) && 72 <= main_~y~4) && main_~y~4 <= 72)) || (((67 <= main_~x~4 && main_~y~4 <= 67) && 67 <= main_~y~4) && main_~x~4 <= 67)) || (((38 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 38) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 26) && 50 <= main_~y~4) && 26 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((main_~y~4 <= 50 && 15 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 15)) || (((34 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 34) && 50 <= main_~y~4)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~x~4) && 81 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 27) && 27 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 60 && 60 <= main_~x~4) && main_~x~4 <= 60) && 60 <= main_~y~4)) || (((86 <= main_~y~4 && main_~y~4 <= 86) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((main_~x~4 <= 21 && main_~y~4 <= 50) && 21 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 5 && main_~y~4 <= 50) && 50 <= main_~y~4) && 5 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 17) && 50 <= main_~y~4) && 17 <= main_~x~4)) || (((main_~y~4 <= 50 && 2 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 2)) || (((54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54) && 54 <= main_~x~4)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 13) && 13 <= main_~x~4) && 50 <= main_~y~4)) || (((74 <= main_~y~4 && 74 <= main_~x~4) && main_~x~4 <= 74) && main_~y~4 <= 74)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 1) && 50 <= main_~y~4) && 1 <= main_~x~4)) || (((83 <= main_~x~4 && main_~y~4 <= 83) && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((95 <= main_~x~4 && 95 <= main_~y~4) && main_~y~4 <= 95) && main_~x~4 <= 95)) || (((main_~x~4 <= 16 && main_~y~4 <= 50) && 16 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 31 && main_~y~4 <= 50) && 50 <= main_~y~4) && 31 <= main_~x~4)) || (((main_~y~4 <= 50 && 19 <= main_~x~4) && main_~x~4 <= 19) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && 92 <= main_~x~4) && main_~y~4 <= 92)) || (((56 <= main_~x~4 && main_~y~4 <= 56) && main_~x~4 <= 56) && 56 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4) && 94 <= main_~x~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && 88 <= main_~x~4) && main_~x~4 <= 88)) || (((main_~x~4 <= 7 && main_~y~4 <= 50) && 7 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && 73 <= main_~x~4) && main_~y~4 <= 73)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 52 <= main_~y~4) && main_~y~4 <= 52)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (((70 <= main_~y~4 && main_~x~4 <= 70) && 70 <= main_~x~4) && main_~y~4 <= 70)) || (((main_~y~4 <= 50 && main_~x~4 <= 42) && 42 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 33 && main_~y~4 <= 50) && 33 <= main_~x~4) && 50 <= main_~y~4)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && 61 <= main_~y~4) && main_~y~4 <= 61)) || (((6 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 6)) || (((main_~x~4 <= 10 && main_~y~4 <= 50) && 50 <= main_~y~4) && 10 <= main_~x~4)) || (((66 <= main_~y~4 && 66 <= main_~x~4) && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((main_~x~4 <= 46 && main_~y~4 <= 50) && 46 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((main_~y~4 <= 79 && 79 <= main_~x~4) && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~x~4) && 89 <= main_~y~4)) || (((main_~x~4 <= 77 && 77 <= main_~x~4) && main_~y~4 <= 77) && 77 <= main_~y~4)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~x~4) && 75 <= main_~y~4)) || (((main_~y~4 <= 69 && 69 <= main_~x~4) && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((47 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 47) && 50 <= main_~y~4)) || (((97 <= main_~x~4 && main_~y~4 <= 97) && main_~x~4 <= 97) && 97 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 39) && 39 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 64 && 64 <= main_~x~4) && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((51 <= main_~x~4 && main_~y~4 <= 51) && 51 <= main_~y~4) && main_~x~4 <= 51)) || (((main_~y~4 <= 50 && main_~x~4 <= 4) && 50 <= main_~y~4) && 4 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((48 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 48) && 50 <= main_~y~4) || (((99 <= main_~y~4 && main_~y~4 <= 99) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((44 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 44) && 50 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && 55 <= main_~x~4) && main_~x~4 <= 55)) || (((main_~y~4 <= 65 && 65 <= main_~x~4) && main_~x~4 <= 65) && 65 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 35) && 35 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 8) && 50 <= main_~y~4) && 8 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 37) && 50 <= main_~y~4) && 37 <= main_~x~4)) || (((63 <= main_~x~4 && 63 <= main_~y~4) && main_~y~4 <= 63) && main_~x~4 <= 63)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (((main_~x~4 <= 30 && main_~y~4 <= 50) && 30 <= main_~x~4) && 50 <= main_~y~4)) || (((36 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 36) && 50 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 40 && main_~y~4 <= 50) && 40 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 43) && 43 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && 90 <= main_~x~4) && main_~y~4 <= 90)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && main_~y~4 <= 53) && 53 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 28) && 50 <= main_~y~4) && 28 <= main_~x~4)) || (((3 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 3) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 24) && 24 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 14 <= main_~x~4) && main_~x~4 <= 14) && 50 <= main_~y~4)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 9 <= main_~x~4) && main_~x~4 <= 9) && 50 <= main_~y~4)) || (((main_~x~4 <= 78 && 78 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 0) && 0 <= main_~x~4) && 50 <= main_~y~4)) || (((29 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((58 <= main_~x~4 && main_~y~4 <= 58) && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 25) && 50 <= main_~y~4) && 25 <= main_~x~4)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((12 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 12) && 50 <= main_~y~4)) || (((20 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 20) && 50 <= main_~y~4)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (((71 <= main_~y~4 && 71 <= main_~x~4) && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 82 <= main_~y~4) && main_~y~4 <= 82)) || (((main_~x~4 <= 32 && main_~y~4 <= 50) && 32 <= main_~x~4) && 50 <= main_~y~4)) || (((72 <= main_~x~4 && main_~x~4 <= 72) && 72 <= main_~y~4) && main_~y~4 <= 72)) || (((67 <= main_~x~4 && main_~y~4 <= 67) && 67 <= main_~y~4) && main_~x~4 <= 67)) || (((38 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 38) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 26) && 50 <= main_~y~4) && 26 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((main_~y~4 <= 50 && 15 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 15)) || (((34 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 34) && 50 <= main_~y~4)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~x~4) && 81 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 27) && 27 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 60 && 60 <= main_~x~4) && main_~x~4 <= 60) && 60 <= main_~y~4)) || (((86 <= main_~y~4 && main_~y~4 <= 86) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((main_~x~4 <= 21 && main_~y~4 <= 50) && 21 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 5 && main_~y~4 <= 50) && 50 <= main_~y~4) && 5 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 17) && 50 <= main_~y~4) && 17 <= main_~x~4)) || (((main_~y~4 <= 50 && 2 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 2)) || (((54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54) && 54 <= main_~x~4)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 13) && 13 <= main_~x~4) && 50 <= main_~y~4)) || (((74 <= main_~y~4 && 74 <= main_~x~4) && main_~x~4 <= 74) && main_~y~4 <= 74)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 1) && 50 <= main_~y~4) && 1 <= main_~x~4)) || (((83 <= main_~x~4 && main_~y~4 <= 83) && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((95 <= main_~x~4 && 95 <= main_~y~4) && main_~y~4 <= 95) && main_~x~4 <= 95)) || (((main_~x~4 <= 16 && main_~y~4 <= 50) && 16 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 31 && main_~y~4 <= 50) && 50 <= main_~y~4) && 31 <= main_~x~4)) || (((main_~y~4 <= 50 && 19 <= main_~x~4) && main_~x~4 <= 19) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && 92 <= main_~x~4) && main_~y~4 <= 92)) || (((56 <= main_~x~4 && main_~y~4 <= 56) && main_~x~4 <= 56) && 56 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4) && 94 <= main_~x~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && 88 <= main_~x~4) && main_~x~4 <= 88)) || (((main_~x~4 <= 7 && main_~y~4 <= 50) && 7 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && 73 <= main_~x~4) && main_~y~4 <= 73)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 52 <= main_~y~4) && main_~y~4 <= 52)) || ((main_~y~4 <= 100 && 99 < main_~y~4) && 100 <= main_~x~4)) || (((70 <= main_~y~4 && main_~x~4 <= 70) && 70 <= main_~x~4) && main_~y~4 <= 70)) || (((main_~y~4 <= 50 && main_~x~4 <= 42) && 42 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 33 && main_~y~4 <= 50) && 33 <= main_~x~4) && 50 <= main_~y~4)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && 61 <= main_~y~4) && main_~y~4 <= 61)) || (((6 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 6)) || (((main_~x~4 <= 10 && main_~y~4 <= 50) && 50 <= main_~y~4) && 10 <= main_~x~4)) || (((66 <= main_~y~4 && 66 <= main_~x~4) && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((main_~x~4 <= 46 && main_~y~4 <= 50) && 46 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((main_~y~4 <= 79 && 79 <= main_~x~4) && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~x~4) && 89 <= main_~y~4)) || (((main_~x~4 <= 77 && 77 <= main_~x~4) && main_~y~4 <= 77) && 77 <= main_~y~4)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~x~4) && 75 <= main_~y~4)) || (((main_~y~4 <= 69 && 69 <= main_~x~4) && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((47 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 47) && 50 <= main_~y~4)) || (((97 <= main_~x~4 && main_~y~4 <= 97) && main_~x~4 <= 97) && 97 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 39) && 39 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 64 && 64 <= main_~x~4) && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((51 <= main_~x~4 && main_~y~4 <= 51) && 51 <= main_~y~4) && main_~x~4 <= 51)) || (((main_~y~4 <= 50 && main_~x~4 <= 4) && 50 <= main_~y~4) && 4 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((48 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 48) && 50 <= main_~y~4) || (((99 <= main_~y~4 && main_~y~4 <= 99) && 99 <= main_~x~4) && main_~x~4 <= 99)) || (((44 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 44) && 50 <= main_~y~4)) || (((55 <= main_~y~4 && main_~y~4 <= 55) && 55 <= main_~x~4) && main_~x~4 <= 55)) || (((main_~y~4 <= 65 && 65 <= main_~x~4) && main_~x~4 <= 65) && 65 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 35) && 35 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 8) && 50 <= main_~y~4) && 8 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 37) && 50 <= main_~y~4) && 37 <= main_~x~4)) || (((63 <= main_~x~4 && 63 <= main_~y~4) && main_~y~4 <= 63) && main_~x~4 <= 63)) || (((main_~x~4 <= 59 && main_~y~4 <= 59) && 59 <= main_~y~4) && 59 <= main_~x~4)) || (((main_~x~4 <= 62 && 62 <= main_~y~4) && main_~y~4 <= 62) && 62 <= main_~x~4)) || (((main_~x~4 <= 30 && main_~y~4 <= 50) && 30 <= main_~x~4) && 50 <= main_~y~4)) || (((36 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 36) && 50 <= main_~y~4)) || (((main_~y~4 <= 93 && 93 <= main_~y~4) && main_~x~4 <= 93) && 93 <= main_~x~4)) || (((main_~x~4 <= 40 && main_~y~4 <= 50) && 40 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 43) && 43 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 41 && 41 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~x~4 <= 90 && 90 <= main_~y~4) && 90 <= main_~x~4) && main_~y~4 <= 90)) || (((53 <= main_~x~4 && main_~x~4 <= 53) && main_~y~4 <= 53) && 53 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 28) && 50 <= main_~y~4) && 28 <= main_~x~4)) || (((3 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 3) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 24) && 24 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 14 <= main_~x~4) && main_~x~4 <= 14) && 50 <= main_~y~4)) || (((18 <= main_~x~4 && main_~x~4 <= 18) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 9 <= main_~x~4) && main_~x~4 <= 9) && 50 <= main_~y~4)) || (((main_~x~4 <= 78 && 78 <= main_~y~4) && 78 <= main_~x~4) && main_~y~4 <= 78)) || (((main_~y~4 <= 96 && 96 <= main_~y~4) && main_~x~4 <= 96) && 96 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 0) && 0 <= main_~x~4) && 50 <= main_~y~4)) || (((29 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 29)) || (((main_~x~4 <= 50 && main_~y~4 <= 50) && 50 <= main_~x~4) && 50 <= main_~y~4)) || (((58 <= main_~x~4 && main_~y~4 <= 58) && main_~x~4 <= 58) && 58 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 25) && 50 <= main_~y~4) && 25 <= main_~x~4)) || (((main_~x~4 <= 76 && 76 <= main_~y~4) && main_~y~4 <= 76) && 76 <= main_~x~4)) || (((91 <= main_~y~4 && main_~x~4 <= 91) && main_~y~4 <= 91) && 91 <= main_~x~4)) || (((12 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 12) && 50 <= main_~y~4)) || (((20 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 20) && 50 <= main_~y~4)) || (((80 <= main_~y~4 && main_~x~4 <= 80) && main_~y~4 <= 80) && 80 <= main_~x~4)) || (((71 <= main_~y~4 && 71 <= main_~x~4) && main_~x~4 <= 71) && main_~y~4 <= 71)) || (((main_~x~4 <= 82 && 82 <= main_~x~4) && 82 <= main_~y~4) && main_~y~4 <= 82)) || (((main_~x~4 <= 32 && main_~y~4 <= 50) && 32 <= main_~x~4) && 50 <= main_~y~4)) || (((72 <= main_~x~4 && main_~x~4 <= 72) && 72 <= main_~y~4) && main_~y~4 <= 72)) || (((67 <= main_~x~4 && main_~y~4 <= 67) && 67 <= main_~y~4) && main_~x~4 <= 67)) || (((38 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 38) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 26) && 50 <= main_~y~4) && 26 <= main_~x~4)) || (((57 <= main_~y~4 && main_~y~4 <= 57) && 57 <= main_~x~4) && main_~x~4 <= 57)) || (((main_~y~4 <= 50 && 15 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 15)) || (((34 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 34) && 50 <= main_~y~4)) || (((main_~y~4 <= 81 && main_~x~4 <= 81) && 81 <= main_~x~4) && 81 <= main_~y~4)) || (((main_~x~4 <= 68 && 68 <= main_~x~4) && main_~y~4 <= 68) && 68 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 27) && 27 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 60 && 60 <= main_~x~4) && main_~x~4 <= 60) && 60 <= main_~y~4)) || (((86 <= main_~y~4 && main_~y~4 <= 86) && 86 <= main_~x~4) && main_~x~4 <= 86)) || (((main_~x~4 <= 21 && main_~y~4 <= 50) && 21 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 5 && main_~y~4 <= 50) && 50 <= main_~y~4) && 5 <= main_~x~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 17) && 50 <= main_~y~4) && 17 <= main_~x~4)) || (((main_~y~4 <= 50 && 2 <= main_~x~4) && 50 <= main_~y~4) && main_~x~4 <= 2)) || (((54 <= main_~y~4 && main_~x~4 <= 54) && main_~y~4 <= 54) && 54 <= main_~x~4)) || (((main_~x~4 <= 98 && 98 <= main_~x~4) && main_~y~4 <= 98) && 98 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 13) && 13 <= main_~x~4) && 50 <= main_~y~4)) || (((74 <= main_~y~4 && 74 <= main_~x~4) && main_~x~4 <= 74) && main_~y~4 <= 74)) || (((main_~x~4 <= 11 && 11 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 1) && 50 <= main_~y~4) && 1 <= main_~x~4)) || (((83 <= main_~x~4 && main_~y~4 <= 83) && 83 <= main_~y~4) && main_~x~4 <= 83)) || (((95 <= main_~x~4 && 95 <= main_~y~4) && main_~y~4 <= 95) && main_~x~4 <= 95)) || (((main_~x~4 <= 16 && main_~y~4 <= 50) && 16 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 31 && main_~y~4 <= 50) && 50 <= main_~y~4) && 31 <= main_~x~4)) || (((main_~y~4 <= 50 && 19 <= main_~x~4) && main_~x~4 <= 19) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && main_~x~4 <= 22) && 22 <= main_~x~4)) || (((main_~x~4 <= 92 && 92 <= main_~y~4) && 92 <= main_~x~4) && main_~y~4 <= 92)) || (((56 <= main_~x~4 && main_~y~4 <= 56) && main_~x~4 <= 56) && 56 <= main_~y~4)) || (((main_~x~4 <= 87 && 87 <= main_~y~4) && main_~y~4 <= 87) && 87 <= main_~x~4)) || (((main_~y~4 <= 85 && 85 <= main_~y~4) && 85 <= main_~x~4) && main_~x~4 <= 85)) || (((main_~y~4 <= 94 && main_~x~4 <= 94) && 94 <= main_~y~4) && 94 <= main_~x~4)) || (((88 <= main_~y~4 && main_~y~4 <= 88) && 88 <= main_~x~4) && main_~x~4 <= 88)) || (((main_~x~4 <= 7 && main_~y~4 <= 50) && 7 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 73 && 73 <= main_~y~4) && 73 <= main_~x~4) && main_~y~4 <= 73)) || (((main_~x~4 <= 52 && 52 <= main_~x~4) && 52 <= main_~y~4) && main_~y~4 <= 52)) || (((70 <= main_~y~4 && main_~x~4 <= 70) && 70 <= main_~x~4) && main_~y~4 <= 70)) || (((main_~y~4 <= 50 && main_~x~4 <= 42) && 42 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 33 && main_~y~4 <= 50) && 33 <= main_~x~4) && 50 <= main_~y~4)) || (((61 <= main_~x~4 && main_~x~4 <= 61) && 61 <= main_~y~4) && main_~y~4 <= 61)) || (((6 <= main_~x~4 && main_~y~4 <= 50) && 50 <= main_~y~4) && main_~x~4 <= 6)) || (((main_~x~4 <= 10 && main_~y~4 <= 50) && 50 <= main_~y~4) && 10 <= main_~x~4)) || (((66 <= main_~y~4 && 66 <= main_~x~4) && main_~y~4 <= 66) && main_~x~4 <= 66)) || (((main_~x~4 <= 46 && main_~y~4 <= 50) && 46 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 50 <= main_~y~4) && 45 <= main_~x~4) && main_~x~4 <= 45)) || (((main_~y~4 <= 79 && 79 <= main_~x~4) && 79 <= main_~y~4) && main_~x~4 <= 79)) || (((main_~y~4 <= 84 && main_~x~4 <= 84) && 84 <= main_~y~4) && 84 <= main_~x~4)) || (((main_~y~4 <= 89 && main_~x~4 <= 89) && 89 <= main_~x~4) && 89 <= main_~y~4)) || (((main_~x~4 <= 77 && 77 <= main_~x~4) && main_~y~4 <= 77) && 77 <= main_~y~4)) || (((main_~x~4 <= 75 && main_~y~4 <= 75) && 75 <= main_~x~4) && 75 <= main_~y~4)) || (((main_~y~4 <= 69 && 69 <= main_~x~4) && main_~x~4 <= 69) && 69 <= main_~y~4)) || (((47 <= main_~x~4 && main_~y~4 <= 50) && main_~x~4 <= 47) && 50 <= main_~y~4)) || (((97 <= main_~x~4 && main_~y~4 <= 97) && main_~x~4 <= 97) && 97 <= main_~y~4)) || (((main_~y~4 <= 50 && main_~x~4 <= 39) && 39 <= main_~x~4) && 50 <= main_~y~4)) || (((main_~x~4 <= 64 && 64 <= main_~x~4) && 64 <= main_~y~4) && main_~y~4 <= 64)) || (((51 <= main_~x~4 && main_~y~4 <= 51) && 51 <= main_~y~4) && main_~x~4 <= 51)) || (((main_~y~4 <= 50 && main_~x~4 <= 4) && 50 <= main_~y~4) && 4 <= main_~x~4)) || (((main_~x~4 <= 23 && 23 <= main_~x~4) && main_~y~4 <= 50) && 50 <= main_~y~4)) || (((main_~y~4 <= 50 && 49 <= main_~x~4) && main_~x~4 <= 49) && 50 <= main_~y~4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. SAFE Result, 88.6s OverallTime, 102 OverallIterations, 102 TraceHistogramMax, 45.8s AutomataDifference, 0.0s DeadEndRemovalTime, 2.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4135 SDtfs, 5051 SDslu, 293062 SDs, 0 SdLazy, 593303 SolverSat, 3652 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5354 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 5252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=308occurred in iteration=101, 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.9s AutomataMinimizationTime, 102 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 308 NumberOfFragments, 3926 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 15861 NumberOfCodeBlocks, 15861 NumberOfCodeBlocksAsserted, 102 NumberOfCheckSat, 15759 ConstructedInterpolants, 0 QuantifiedInterpolants, 20797041 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 102 InterpolantComputations, 1 PerfectInterpolantSequences, 4077/525402 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-17-33-722.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007.c.i_4.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-17-33-722.csv Received shutdown request...